Family-Indexed Product Completion
Abstract
Finite independent readouts have a product completion and pointwise dynamics.
Theorem 1.1 (The predictive completion of a finite product is the product of the completions).
Proof. Machine-checked in Lean as D5/S3/ObserverMemory/Fusion/FamilyIndexedProductCompletion.family_indexed_product_completion (✓ std3). ∎
Source. Repository-derived.
Commentary.
A finite index type carries dependent state and output families. The global update and readout are constructed pointwise from the component maps, and CompletedState is the canonical quotient by equality of complete future readout itineraries.
The named canonical equivalence sends the class of a configuration to the family of its coordinate classes. The first public law records this projection computation directly.
The second public law says that applying the induced global update before the equivalence is exactly the family of component completion updates.
Pinned repository primitives CompletedState, completionProjection, completionUpdate, and completeItinerary are imported and applied. Pinned Mathlib’s exact Setoid.piQuotientEquiv is composed with Quotient.congrRight; no family-indexed repository theorem was found.
References
- Truth anchor:
D5/S3/ObserverMemory/Fusion/FamilyIndexedProductCompletion.family_indexed_product_completion - Dependency: D5/S3/ObserverMemory/Refinement/PredictionCompletion