Keyboard shortcuts

Press or to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Control Quotient Universal Minimality

Abstract

The quotient by all monoid-indexed public outcomes is the universal coarsest action-complete concept.

Theorem 1.1 (The control quotient is the universal action completion).

Proof. Machine-checked in Lean as D5/S3/ConceptDynamics/Control/ControlQuotientUniversalMinimality.control_quotient_universal_minimality (✓ std3). ∎

Source. Repository-derived.

Commentary.

The control profile is constructed directly from the source monoid action: at a state it records the public readout after every action. The named control carrier is the quotient by equality of these complete profiles, and the canonical projection is retained in every public equation.

The empty action recovers the present readout. Multiplication in the monoid makes every action preserve profile equality, producing an induced action on the quotient; evaluating a profile at a chosen action gives the corresponding public consequence from the current quotient value.

For any competing concept, the theorem requires recovery, action closure, and consequence determination as separate public premises. Consequence determination forces its equality kernel into the control kernel, and the imported realized-image criterion supplies the unique factor onto the canonical quotient image.

Finally, finite intervention words and single monoid actions induce the same state equivalence. Word composition gives one direction, while the one-action word gives the reverse, identifying this quotient with the family’s dynamic completion at the kernel level.

References