PreservesJSymmetry
plain-language theorem explainer
A recognition tracker preserves J symmetry exactly when its event list is balanced under reciprocal pairing. This definition is cited in ledger construction steps of the recognition forcing argument. It is implemented as the balanced_list predicate applied to the tracker's events.
Claim. For a recognition tracker $T$ with event list $L$, $T$ preserves $J$-symmetry when $L$ is balanced: $forall e, count_L(e) = count_L(reciprocal(e))$.
background
The Recognition Forcing module derives recognition structures from cost foundations. A RecognitionTracker is a structure whose sole field is a list of recognition events. The balanced_list predicate from LedgerForcing states that a list is balanced when every event appears exactly as often as its reciprocal, enforcing the double-entry constraint on the ledger.
proof idea
One-line definition that applies the balanced_list predicate directly to the events field of the supplied tracker.
why it matters
This supplies the symmetry hypothesis for ledger_is_minimal_recognition_tracker, which constructs a LedgerForcing.Ledger from the tracker. It advances the recognition_forcing_complete master theorem by guaranteeing balanced events. In the framework it supports J-uniqueness (T5) by maintaining the symmetry needed to reach recognition structures from cost minima.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.