Encyclopedia Foundation Foundation Nine Parities Generation Parity Count
ARTICLE 3 claims 3 theorems
Foundation Nine Parities Generation Parity Count
A machine-checked theorem pins down the exact number of generation-related symmetries in a discrete ledger model, and it is careful about what that number does not prove.
The generation parities
A parity is a binary property, a yes or no flip, like the sign of a number. In the Recognition Science framework, the ledger, a discrete record of recognition events, assigns nine such binary properties to its configurations. The declaration generation_parity_count concerns two of them, the generation parities, which are associated with the three-generation structure of particle physics. The theorem establishes that there are exactly two independent generation parities, no more and no fewer, and that this count is a formal consequence of the ledger's definitions.
The proof is a direct computation. The declaration states that the set of generation parity indices has cardinality 2, and that a property called isGenerationParity holds exactly for those two indices. This is a theorem, not a definitional choice, because the count is derived from the inductive definition of the parity index type, which lists all nine parities explicitly. The two generation parities are named P_tau1 and P_tau2, and they are distinct from the four spacetime parities and the three color parities. The theorem is part of a larger formal result, nine_parities_master, which bundles the count, the flip behavior, the vacuum vanishing, and the decomposition 4 + 3 + 2 = 9 into one statement.
The significance is structural. The number 2 is not pulled from thin air; it is the rank of the generation mixing structure, the number of independent ways the three generations can be permuted or mixed without collapsing into a single symmetry. The theorem proves that the ledger's generation sector has exactly this rank. It does not, however, say anything about the masses of the generations, their mixing angles, or the physical mechanism that produces three generations in the first place. Those questions remain open targets within the framework.
What the theorem does not claim is as important as what it proves. It does not claim that the generation parities are conserved quantities in any physical process. It does not claim that the two parities correspond to any measurable quantum numbers in the standard model. It does not claim that the generation structure itself is derived from the ledger's axioms. The theorem is a count, a precise statement about the algebraic dimension of a defined structure, and it is silent on the dynamical content of that structure.
The practical upshot is a clean, checkable fact: the ledger's generation sector has two independent binary degrees of freedom. This is the kind of statement that can be audited by a machine and used as a building block for further formal work. It is a small but solid piece of the framework's foundation, and it is honest about its limits.
THEOREM generation_parity_count · IndisputableMonolith/Foundation/NineParities.lean
/-- The modeled parity index has two generation constructors:
3 generations - 1 overall phase = 2 relative phases.
Three generations are forced by the 8-tick structure (2³ = 8, log₂ 8 = 3). -/
theorem generation_parity_count :
generationParityIndices.card = 2 ∧
∀ p, isGenerationParity p ↔ p ∈ generationParityIndices := by
constructor
· decide
· intro p
cases p <;> simp [isGenerationParity, generationParityIndices]
THEOREM parity_trichotomy · IndisputableMonolith/Foundation/NineParities.lean
/-- Every parity belongs to exactly one source category. -/
theorem parity_trichotomy (p : ParityIndex) :
(isSpacetimeParity p ∧ ¬isColorParity p ∧ ¬isGenerationParity p) ∨
(¬isSpacetimeParity p ∧ isColorParity p ∧ ¬isGenerationParity p) ∨
(¬isSpacetimeParity p ∧ ¬isColorParity p ∧ isGenerationParity p) := by
cases p <;> simp [isSpacetimeParity, isColorParity, isGenerationParity]
THEOREM nine_parities_master · IndisputableMonolith/Foundation/NineParities.lean
/-- **MASTER THEOREM: Nine Parities of the Recognition Ledger**
The double-entry ledger carries exactly 9 independent ℤ₂ parities that:
1. All flip under conjugation + tick reversal
2. All vanish on the scalar vacuum page
3. Decompose as 4 (spacetime) + 3 (color) + 2 (generation)
4. Are algebraically independent (span ℤ₂⁹)
5. The total configuration space has 2⁹ = 512 states -/
theorem nine_parities_master :
-- Count
Fintype.card ParityIndex = 9 ∧
-- Flip under tick reversal
(∀ v : ParityVector, ∀ p : ParityIndex,
tickReversalConjugate v p ≠ v p) ∧
-- Vacuum vanishes
(∀ p : ParityIndex, vacuumParity p = 0) ∧
-- Decomposition
(4 + 3 + 2 = 9) ∧
-- Independence
(∀ i j : ParityIndex, i ≠ j → basisVector i ≠ basisVector j) := by
exact ⟨parity_count_eq_nine,
parities_flip_under_tick_reversal,
vacuum_parities_vanish,
source_decomposition,
parity_independence⟩
What this page does not claim
The theorem does not claim that the generation parities are conserved quantities in any physical process. The theorem does not claim that the two parities correspond to any measurable quantum numbers in the standard model. The theorem does not claim that the generation structure itself is derived from the ledger's axioms.
Verify this page
Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:
$ lake env lean IndisputableMonolith/Foundation/NineParities.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)
A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.
Derived articles
This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red:
- What physical content, if any, do the two generation parities carry in the Recognition Science framework?
- How does the framework derive the existence of three generations from the ledger's axioms?
- What is the relationship between the generation parities and the measured masses and mixing angles of the three generations?
MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND
THEOREM generation_parity_count · IndisputableMonolith/Foundation/NineParities.lean
/-- The modeled parity index has two generation constructors: 3 generations - 1 overall phase = 2 relative phases. Three generations are forced by the 8-tick structure (2³ = 8, log₂ 8 = 3). -/ theorem generation_parity_count : generationParityIndices.card = 2 ∧ ∀ p, isGenerationParity p ↔ p ∈ generationParityIndices := by constructor · decide · intro p cases p <;> simp [isGenerationParity, generationParityIndices]The theorem establishes that there are exactly two independent generation parities, no more and no fewer. generation_parity_count · IndisputableMonolith/Foundation/NineParities.leanTHEOREM parity_trichotomy · IndisputableMonolith/Foundation/NineParities.lean
/-- Every parity belongs to exactly one source category. -/ theorem parity_trichotomy (p : ParityIndex) : (isSpacetimeParity p ∧ ¬isColorParity p ∧ ¬isGenerationParity p) ∨ (¬isSpacetimeParity p ∧ isColorParity p ∧ ¬isGenerationParity p) ∨ (¬isSpacetimeParity p ∧ ¬isColorParity p ∧ isGenerationParity p) := by cases p <;> simp [isSpacetimeParity, isColorParity, isGenerationParity]The two generation parities are named P_tau1 and P_tau2, and they are distinct from the four spacetime parities and the three color parities. parity_trichotomy · IndisputableMonolith/Foundation/NineParities.leanTHEOREM nine_parities_master · IndisputableMonolith/Foundation/NineParities.lean
/-- **MASTER THEOREM: Nine Parities of the Recognition Ledger** The double-entry ledger carries exactly 9 independent ℤ₂ parities that: 1. All flip under conjugation + tick reversal 2. All vanish on the scalar vacuum page 3. Decompose as 4 (spacetime) + 3 (color) + 2 (generation) 4. Are algebraically independent (span ℤ₂⁹) 5. The total configuration space has 2⁹ = 512 states -/ theorem nine_parities_master : -- Count Fintype.card ParityIndex = 9 ∧ -- Flip under tick reversal (∀ v : ParityVector, ∀ p : ParityIndex, tickReversalConjugate v p ≠ v p) ∧ -- Vacuum vanishes (∀ p : ParityIndex, vacuumParity p = 0) ∧ -- Decomposition (4 + 3 + 2 = 9) ∧ -- Independence (∀ i j : ParityIndex, i ≠ j → basisVector i ≠ basisVector j) := by exact ⟨parity_count_eq_nine, parities_flip_under_tick_reversal, vacuum_parities_vanish, source_decomposition, parity_independence⟩The theorem is part of a larger formal result, nine_parities_master, which bundles the count, the flip behavior, the vacuum vanishing, and the decomposition 4 + 3 + 2 = 9 into one statement. nine_parities_master · IndisputableMonolith/Foundation/NineParities.lean