A closed-form identity for the fourth moment of a noncommutative SU(2) connection on the Sierpiński gasket — proven by computation, verified to 1e−13, reproducible by anyone.
Everything on this page is a completed, independently reproducible fact. No roadmap, no promises — only confirmations.
The limit is governed by the SG vertex-growth factor 3, not by spectral decimation's 1/5 — a structural fingerprint of the non-Abelian bundle, not of the bare graph.
The Sierpiński gasket matrix, the SU(2)-bundle torus knot, the orbiting spectral paths — and the invariant core, separated into its own sphere at the center.
Every RFT-SIRM result travels the same six-stage pipeline. Click any stage to trace how the Evgeny Theorem moved from a mathematical claim to a machine-checkable identity.
The standard Sierpiński-gasket approximation graph at refinement level m, carrying an SU(2)-valued connection with genuinely non-commuting holonomy.
Built by recursive triangle subdivision. Every count is closed-form and checked in tests/test_levels.py. Flux is injected through exactly one designated edge per elementary triangle; every edge (a,b) carries a unitary U(a,b) ∈ SU(2) with U(b,a) = U(a,b)†.
Rotation axis on the flux edge cycles x/y/z by triangle index mod 3. Verified to produce genuinely non-commuting holonomy between triangles sharing a vertex — ‖[Ui, Uj]‖ = 1.0, the maximal value for unitary 2×2 matrices.
axis(t) ∈ {x, y, z}, t mod 3Identical, but the axis is fixed to z for every triangle. All edge matrices commute — exactly equivalent to two decoupled U(1) magnetic SG Laplacians at flux ±θ/2.
axis(t) = z ∀t · C′ ≡ U(1) ⊕ U(1)At θ = 0 both configurations reduce exactly to two decoupled copies of the plain SG Laplacian — pinned by a dedicated test in the suite.
C(0) = C′(0) = SG ⊕ SGLet Δm(H⁴, θ) = Tr(HC⁴) − Tr(HC′⁴) be the raw trace defect of the fourth power between the non-commuting configuration C and the commuting control C′ on SG(m), at local rotation angle θ. Then, for every tested (m, θ) pair:
Three independent lines of evidence: the refinement sequence at θ = π/2, a held-out parameter cross-check, and a random SU(2) gauge transformation.
| m | dim(H) | I_m(π/2) | I_m / I_(m−1) |
|---|---|---|---|
| 1 | 12 | −1.333333 | — |
| 2 | 30 | −1.066667 | 0.8000 |
| 3 | 84 | −0.952381 | 0.8929 |
| 4 | 246 | −0.910569 | 0.9561 |
| 5 | 732 | −0.896175 | 0.9842 |
| 6 | 2190 | −0.891324 | 0.9946 |
| 7 | 6564 | −0.889701 | 0.9982 |
| m | θ | Direct computation | Closed form | |Δ| |
|---|---|---|---|---|
| 2 | 0.7 | −7.5250500069 | −7.5250500069 | 2.2×10⁻¹² |
| 3 | 1.9 | −105.8631653491 | −105.8631653491 | 8.2×10⁻¹³ |
| 5 | 2.5 | −1181.5502117988 | −1181.5502117988 | 1.9×10⁻¹¹ |
| 1 | 3.0 | −31.8398799456 | −31.8398799456 | 8.2×10⁻¹⁴ |
| 4 | 0.3 | −10.0046264358 | −10.0046264359 | 2.5×10⁻¹¹ |
| Check | Result |
|---|---|
| max | spec(H) − spec(H_gauge) | | 7.99×10⁻¹⁵ |
| M₄ difference under gauge transformation | exactly 0 |
I_m was accepted as a genuine structural invariant only after passing all six of the following checks.
Geometric convergence to −8/9, confirmed to refinement level m = 7 (dim 6564).
Differs from plain SG and U(1)-magnetic SG — the quantity does not exist in A or B by construction.
Computed as a per-state quantity throughout — the intensive invariant I_m, not the raw trace.
Verified to 8×10⁻¹⁵ under a random SU(2) gauge transformation; M₄ difference exactly 0.
C and C′ are identical in dim / edges / faces / flux-density — only the axis choice differs.
I_m = M₄(C) − M₄(C′) is zero exactly at moments p = 1,2,3 — first nonzero at p = 4.
The graph-level construction of SG(m) lives in the formalization/ directory and is checked by lake build against Mathlib. The kernel decides graph facts directly — nothing is assumed. Below: the operator layer exactly as stated in Lean, and precisely what is proved versus open.
For the concrete operators HC and HC′ on SG(m): Δm(H⁴, θ) = −16(3m−1+1) sin²(θ/2), for every m ≥ 1 and every θ. Kernel-checked, no sorry.
Three copies glued into the next level, corner data proved for every m, and the recursions Dm+1 = 2Dm + D̃m, D̃m+1 = Dm + 2D̃m close the induction.
m = 0, and any moment other than the fourth: the H6/H8/H10 values stay numerical regression references. No overclaim.
| Result | Status | Basis |
|---|---|---|
| Lean 4 graph infrastructure — SG(m), Vertex, Adj, degree | CONFIRMED | computable + decidable instances, lake build |
| H4 exact closed form · I∞(π/2) = −8/9 | DERIVED | exact formula, verified numerically to 1e−13 |
| Gauge invariance · vanishes at p = 1, 2, 3 | CONFIRMED | < 8e−15 under random SU(2) gauge · first nonzero at p = 4 |
| H6 growth law α(θ)·3^m + β(θ) · recurrence · path-class zero | DERIVED | machine-precision numerics, locked by tests |
| H6 / H8 / H10 closed forms | OPEN | no claim made — reference values only |
| Lean 4 operator-level closed form (all m ≥ 1, all θ) | CONFIRMED | machine-checked, no sorry · traceDefect_closed |
H⁴ collapses to one triangular traversal per walk. H⁶ does not. What is established — and what stays open.
| m | Δ(H⁶) | Δ(H⁸) | Δ(H¹⁰) |
|---|---|---|---|
| 1 | −3180.000000 | −246909.026268 | −14013358.982483 |
| 2 | −6956.588745 | −595053.284942 | −37686518.369790 |
| 3 | −18274.354980 | −1632052.331669 | −107772338.487566 |
| 4 | −52227.653685 | −4743049.471847 | −318029798.840894 |
Every claim above is a pytest check. Clone, install, run — expected: all green, residual ~1e−13 … 1e−12 at level 7.