Finite-Window Minimal Sufficiency
Abstract
The realized finite orbit window is sufficient for every target in the window, and every simultaneously sufficient effective-image interface determines the entire realized window.
Theorem 1.1 (The finite window is simultaneously sufficient and coarsest).
Proof. Machine-checked in Lean as D5/S3/ConceptDynamics/FutureWindows/FiniteWindowMinimalSufficiency.finite_future_window_minimal_sufficiency (✓ std3). ∎
Source. Repository-derived.
Commentary.
For each index from zero through n, the canonical readout into the realized image of the corresponding orbit target factors through the canonical readout into the realized image of the whole finite window. This is target sufficiency with both interfaces restricted to their effective images.
Conversely, let r be any interface whose realized image is sufficient for every orbit target in the window. The realized finite-window readout then factors through the realized image of r. With Refines(coarse, fine) meaning that coarse factors through fine, this is exactly the coarsest factor-through property.
No inhabitedness, finiteness, or dynamical hypothesis is assumed. The finite dependent product includes horizon zero, and the effective-image clause remains valid for an empty state type.
References
- Truth anchor:
D5/S3/ConceptDynamics/FutureWindows/FiniteWindowMinimalSufficiency.finite_future_window_minimal_sufficiency - Dependency: D5/S3/ConceptDynamics/Sufficiency/FiniteWindowMinimalSufficiency