pith. machine review for the scientific record. sign in
theorem proved term proof high

span_lepton_eq_W

show as:
view Lean formalization →

The lepton generation span sums exactly to the number of distinct 2D wallpaper groups. Researchers deriving forced mass hierarchies from sector-dependent torsion would cite this to fix leptons in the middle of the generation ladder. The proof is a one-line unfolding of the wallpaper count definition followed by native arithmetic decision.

claimThe lepton sector steps satisfy $11 + 6 = 17$, where 17 is the number of distinct two-dimensional wallpaper groups.

background

The SDGT Forcing Theorem shows that sector-dependent generation torsion is forced by three constraints: the partition sum of overlapping consecutive-pair spans must equal N₃ = 55, only the pair {11, 6} sums to the wallpaper count W = 17, and charge asymmetry selects the unique ordering. The upstream definition states that wallpaper_groups equals 17, the standard crystallographic constant proven by Fedorov in 1891. The Constants structure supplies the abstract bundle of CPM constants used to normalize the curvature fraction.

proof idea

One-line wrapper that unfolds the definition of wallpaper_groups to the constant 17 and applies native_decide to confirm the arithmetic equality 11 + 6 = 17.

why it matters in Recognition Science

This theorem supplies the lepton uniqueness step inside the SDGT forcing theorem, which selects the unique assignment of spans {13, 11} for up quarks, {11, 6} for leptons, and {6, 8} for down quarks. It closes one of the three forcing constraints listed in the module documentation. The four step values themselves remain open for derivation from a single principle.

scope and limits

formal statement (Lean)

 156theorem span_lepton_eq_W : (11 + 6 : ℕ) = Constants.AlphaDerivation.wallpaper_groups := by

proof body

Term-mode proof.

 157  unfold Constants.AlphaDerivation.wallpaper_groups
 158  native_decide

depends on (3)

Lean names referenced from this declaration's body.