IndisputableMonolith.Foundation.GaugeFromCube
GaugeFromCube defines the D-cube vertices as maps Fin D to {0,1} together with edge, face, and signed-permutation counts to supply discrete geometry for gauge groups. Researchers working on the Yang-Mills mass gap or discrete origins of color would cite it. The module consists entirely of definitions and cardinality statements with no proof obligations.
claimA vertex of the $D$-cube is a function $\{0,1\}^D$, i.e., an element of the set of maps from $\{1,\dots,D\}$ to $\{0,1\}$.
background
The module follows DimensionForcing, which proves D=3 is forced by the RS framework through topological, self-similar, and other arguments. It also imports ParticleGenerations (P-001: three fermion generations) and QuarkColors (P-007: N_c=3).
CubeVertex is introduced as the set of functions Fin D → {0,1}. Companion definitions give the cardinalities 2^D for vertices, D·2^{D-1} for edges, and the order of the hyperoctahedral group for signed permutations of the axes.
proof idea
This is a definition module, no proofs.
why it matters in Recognition Science
It supplies the cube geometry imported by YangMillsMassGap (QG-005), the module that resolves one of the seven Millennium problems from the J-cost functional alone. The vertex and symmetry counts connect the D=3 forcing and the three-color/three-generation results to the discrete substrate of non-Abelian gauge structure.
scope and limits
- Does not derive an explicit gauge group from the cube symmetries.
- Does not compute masses, couplings, or the J-cost on these objects.
- Does not address non-cubic lattices or dimensions other than the forced D=3.
- Does not contain any theorem linking the cube directly to the recognition functional.
used by (1)
depends on (3)
declarations in this module (43)
-
def
CubeVertex -
theorem
cube_vertex_count -
theorem
cube3_vertex_count -
def
cube_edge_count -
theorem
cube3_edge_count -
def
cube_face_count -
theorem
cube3_face_count -
structure
SignedPerm -
theorem
signed_perm_card -
theorem
cube_aut_order -
def
IsAxisPermutation -
def
axis_perm_count -
theorem
axis_perm_count_D3 -
def
IsSignFlip -
def
sign_flip_count -
theorem
sign_flip_count_D3 -
def
IsEvenSignFlip -
def
sign_parity -
def
even_sign_flip_count -
theorem
even_sign_flip_count_D3 -
def
parity_quotient_order -
theorem
three_layer_factorization -
theorem
sm_factorization -
structure
GaugeLayer -
def
color_layer -
def
weak_layer -
def
hypercharge_layer -
theorem
gauge_rank_match -
theorem
dimension_sum -
theorem
dimension_sum_triangular -
theorem
s3_is_weyl_of_su3 -
theorem
color_from_axis_permutations -
theorem
even_flips_give_weak_structure -
theorem
parity_gives_hypercharge -
theorem
unique_gauge_factorization -
theorem
no_alternative_321 -
def
sm_gauge_ranks -
def
cube_gauge_ranks -
theorem
cube_matches_sm -
theorem
total_gauge_dim -
theorem
gauge_order_product -
theorem
gauge_generation_unification -
theorem
gauge_group_certificate