IndisputableMonolith.Masses.SectorDependentTorsion
SectorDependentTorsion supplies the geometric primitives for the cubic polytope Q_D at D=3, including its vertices as 0-cells, edges, faces, and the sector quantities S0, S1, S2. Mass-spectrum researchers cite these objects when enumerating generation steps or proving torsion-forcing constraints. The module consists entirely of definitions with no theorems or proofs.
claimThe vertices of the cubic polytope $Q_D$ (its 0-cells), together with the edges, faces, and sector-dependent quantities $S_0$, $S_1$, $S_2$ evaluated at $D=3$.
background
The module sits inside the Recognition Science treatment of masses and inherits the cubic-ledger geometry from the Alpha Derivation module, whose doc-comment states that it supplies a constructive derivation of the fine-structure constant from vertex deficits of Q_3 via Gauss-Bonnet. It introduces the 0-cells (vertices) of Q_D, the associated 1-cells and 2-cells, and the three sector invariants S0, S1, S2 that encode torsion dependence across generations. These objects are the concrete carriers of the Euler characteristic and cube-invariance statements used downstream.
proof idea
This is a definition module, no proofs.
why it matters in Recognition Science
The definitions feed the SDGT Forcing theorem, whose doc-comment states that sector-dependent generation torsion is forced by the partition constraint summing to N_3=55 and the lepton-uniqueness condition, and the Step Value Enumeration module, whose doc-comment identifies the step values {13,11,6,8} as Q_3 cube invariants via the Euler characteristic V-E+F=2 on the boundary sphere. The module therefore supplies the geometric substrate for the mass-sector forcing chain.
scope and limits
- Does not contain theorems or proofs.
- Does not compute numerical values of constants.
- Does not treat dimensions other than D=3.
- Does not derive the mass ladder or phi-ladder relations.
used by (2)
depends on (1)
declarations in this module (73)
-
def
cube_vertices' -
def
cube_edges' -
def
cube_faces' -
def
cube_body -
theorem
vertices_at_D3 -
theorem
edges_at_D3 -
theorem
faces_at_D3 -
def
S0 -
def
S1 -
def
S2 -
theorem
S0_at_D3 -
theorem
S1_at_D3 -
theorem
S2_at_D3 -
def
N0 -
def
N1 -
def
N2 -
theorem
N0_at_D3 -
theorem
N1_at_D3 -
theorem
N2_at_D3 -
theorem
N0_eq_W_at_D3 -
theorem
N0_ne_W_at_D1 -
theorem
N0_ne_W_at_D2 -
theorem
N0_ne_W_at_D4 -
theorem
N0_ne_W_at_D5 -
theorem
N2_minus_N1 -
theorem
N1_minus_N0 -
theorem
N_diff_eq_edges_at_D3 -
def
lepton_step_12 -
def
lepton_step_23 -
theorem
lepton_step_12_eq -
theorem
lepton_step_23_eq -
theorem
lepton_total_span -
def
down_step_12 -
def
down_step_23 -
theorem
down_step_12_eq -
theorem
down_step_23_eq -
theorem
down_total_span -
theorem
down_span_eq_W_minus_D -
def
down_rung_gen1 -
def
down_rung_gen2 -
def
down_rung_gen3 -
theorem
down_rung_gen1_eq -
theorem
down_rung_gen2_eq -
theorem
down_rung_gen3_eq -
theorem
down_generation_ordering -
def
vertex_face_excess -
theorem
vertex_face_excess_at_D3 -
def
up_step_12 -
def
up_step_23 -
theorem
up_step_12_eq -
theorem
up_step_23_eq -
theorem
up_total_span -
def
up_rung_gen1 -
def
up_rung_gen2 -
def
up_rung_gen3 -
theorem
up_rung_gen1_eq -
theorem
up_rung_gen2_eq -
theorem
up_rung_gen3_eq -
theorem
up_generation_ordering -
def
cross_sector_shift_down -
theorem
cross_sector_shift_eq -
theorem
lepton_span_eq_N0 -
theorem
down_span_plus_D_eq_W -
theorem
up_span_eq_twice_edges -
def
N3' -
theorem
N3'_at_D3 -
theorem
sector_spans_partition_N3 -
theorem
cyclic_chain -
theorem
up_lepton_share_Epass -
theorem
lepton_down_share_F -
theorem
up_minus_lepton_span -
theorem
lepton_minus_down_span -
theorem
total_cells_eq_D_pow_D