Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

ReifierTemplates

Abstract

Uniform pointwise registration descriptor and generic evidence providers in the content plane.

Theorem 1.1 (pointwise).

Lean statement: D5/S3/ConceptDynamics/InformationEscape/ReifierTemplates.pointwise

Proof. Machine-checked in Lean as D5/S3/ConceptDynamics/InformationEscape/ReifierTemplates.pointwise (✓ std3). ∎

Source. Repository-derived.

Commentary.

The descriptor retains the carrier parameters and both supplied functions; its bridge from the complete pointwise equation to the generated law is a proved equivalence.

Theorem 1.2 (sensitivity).

Lean statement: D5/S3/ConceptDynamics/InformationEscape/ReifierTemplates.sensitivity

Proof. Machine-checked in Lean as D5/S3/ConceptDynamics/InformationEscape/ReifierTemplates.sensitivity (✓ std3). ∎

Source. Repository-derived.

Commentary.

Arena nondegeneracy supplies an inhabited state, and a nontrivial output type supplies distinct values for the existing pointwise slot-sensitivity theorem.

Theorem 1.3 (variation).

Lean statement: D5/S3/ConceptDynamics/InformationEscape/ReifierTemplates.variation

Proof. Machine-checked in Lean as D5/S3/ConceptDynamics/InformationEscape/ReifierTemplates.variation (✓ std3). ∎

Source. Repository-derived.

Commentary.

Sensitivity at a supplied readout slot yields a realization satisfying the law and another refuting it, by a classical case split without enumeration.

References