pith. sign in
theorem

edgeDualCount_eq

proved
show as:
module
IndisputableMonolith.RecogSpec.RSBridge
domain
RecogSpec
line
47 · github
papers citing
none yet

plain-language theorem explainer

The equality fixes the edge-dual count at exactly 24 in the RS bridge construction. Researchers deriving CKM matrix elements from ledger geometry cite it to set the V_cb mixing angle at 1/24. The proof is a direct reflexivity that follows from unfolding the definition edgeDualCount := 2 * cubeEdges and evaluating the arithmetic.

Claim. Let $n$ be the edge-dual count defined by $n = 2$ times the number of cube edges. Then $n = 24$.

background

The RSBridge module derives CKM mixing angles from ledger geometry. Module documentation states that V_cb equals 1/24 from the edge-dual coupling, where 24 equals 2 times 12 edges of the cube dual, while V_ub and V_us arise from alpha and phi-ladder projections respectively. The local setting treats these counts as geometric inputs rather than free parameters. The upstream definition edgeDualCount : ℕ := 2 * cubeEdges supplies the count directly, while the meta-realization structure records coherence axioms needed for self-reference.

proof idea

The proof is a term-mode reflexivity. It unfolds the definition of edgeDualCount as 2 * cubeEdges and reduces the arithmetic expression to 24 by reflexivity.

why it matters

This equality anchors the V_cb element inside the Recognition Science bridge by fixing the geometric factor at 24. It supports the module claim that mixing angles are derived from counts such as the 24 edges of the cube dual rather than postulated. The result closes one link in the geometric derivation of the CKM hierarchy and aligns with the eight-tick octave and D=3 spatial structure of the forcing chain.

Switch to Lean above to see the machine-checked source, dependencies, and usage graph.