Keyboard shortcuts

Press or to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Universal Sufficiency Factorization

Abstract

Universal sufficiency is equivalently target factorization or constancy on fibers.

Lemma 1.1 (The target factor agrees on represented coordinates).

Proof. Machine-checked in Lean as D5/S3/ConceptDynamics/Sufficiency/UniversalSufficiencyFactorization.targetFactor_apply (✓ std3). ∎

Source. Repository-derived.

Commentary.

Suppose the target is constant whenever two states have the same concept coordinate. The resulting map from concept coordinates to the target image sends every represented coordinate q_C(x) to the canonical target point determined by x.

Coordinates outside the range of q_C are filled using an arbitrary state, which exists because the state space is nonempty. This choice cannot affect the represented coordinates covered by the lemma.

Theorem 1.2 (Universal sufficiency has three equivalent forms).

Proof. Machine-checked in Lean as D5/S3/ConceptDynamics/Sufficiency/UniversalSufficiencyFactorization.universal_sufficiency_factorization (✓ std3). ∎

Source. Repository-derived.

Commentary.

A concept readout is sufficient for a target exactly when the canonical target-image readout factors through it. The same factorization exists exactly when the target is constant on each fiber of the concept readout.

Fiber constancy makes the factor map well-defined on represented coordinates. Nonemptiness of the state space supplies a target image value for any concept coordinates that no state represents; the auxiliary lemma proves agreement on all represented ones.

The repository proof reuses the pinned library’s factor-through criterion and extension operation. Repository searches found adjacent factorization results but no existing declaration that combines this canonical target-image refinement with the fiber criterion.

References

  • Truth anchor: D5/S3/ConceptDynamics/Sufficiency/UniversalSufficiencyFactorization.targetFactor_apply
  • Truth anchor: D5/S3/ConceptDynamics/Sufficiency/UniversalSufficiencyFactorization.universal_sufficiency_factorization
  • Dependency: D5/S3/ConceptDynamics/ConceptJoinUniversal