IndisputableMonolith.Masses.SectorDependentTorsion
SectorDependentTorsion supplies the D=3 cube invariants (vertices, edges, faces, body) and the three sector torsion parameters S0, S1, S2 for the Recognition mass ladder. Researchers working on SDGT forcing or step-value enumeration cite these definitions. The module is purely definitional; it contains no theorems or proofs.
claimThe 0-cells (vertices) of the cubic polytope $Q_D$, together with the derived edge, face and body counts at $D=3$, and the sector-dependent torsion values $S_0,S_1,S_2$ satisfying the Euler relation $V-E+F=2$ on the boundary sphere.
background
The module imports AlphaDerivation, whose doc-comment states it supplies a constructive derivation of $\alpha^{-1}$ from the geometry of the cubic ledger, including the structural derivation of $4\pi$ via vertex deficits of $Q_3$. It introduces the sibling definitions cube_vertices', cube_edges', cube_faces', cube_body, vertices_at_D3, edges_at_D3, faces_at_D3 together with S0, S1, S2 and their D=3 specializations. These objects encode the discrete geometry underlying the Recognition Science mass formula and the eight-tick octave at D=3.
proof idea
this is a definition module, no proofs
why it matters in Recognition Science
The definitions feed the SDGTForcing theorem, which proves sector-dependent generation torsion is forced by the partition constraint summing to $N_3=55$ and the lepton-uniqueness condition on {11,6}. They also supply the cube invariants required by StepValueEnumeration to identify the generation-step values {13,11,6,8} via the Euler characteristic at $\partial Q_3 \cong S^2$.
scope and limits
- Does not contain any theorem or proof.
- Does not compute numerical mass values.
- Does not state the full SDGT forcing argument.
- Does not address higher-dimensional cases beyond D=3.
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