Keyboard shortcuts

Press or to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Maximum Factor-Compatible Subdomain

Abstract

Largest target-consistent fiber blocks give the sharp factor-compatible domain size.

Theorem 1.1 (Largest target blocks give the exact compatible-domain size).

Proof. Machine-checked in Lean as D5/S3/ConceptDynamics/TargetRisk/MaximumFactorCompatibleSubdomain.maximum_factor_compatible_subdomain (✓ std3). ∎

Source. Repository-derived.

Commentary.

The bound is constructed directly from the finite state carrier. For each realized concept value, it counts the largest joint concept-target block and then sums those maxima.

Fiberwise factorization makes every admitted concept fiber fit inside one such block. Conversely, selecting one maximizing target block in every realized concept fiber gives an admitted domain attaining the bound.

References