mirror of
https://github.com/allaunthefox/SilverSight.git
synced 2026-07-31 01:25:21 +00:00
allaun
8a538036fe
UnifiedCovariant.lean:
- Quarantined Layer 2/2b: goldenEndomorphism, eigensolid_convergence,
crossingMatrix, and Sidon-orthogonality bypass sections removed due to
Mathlib 4.30.0-rc2 import path incompatibilities (Topology.*, LinearAlgebra.Basic)
- Wired Layer 2c: NR bracket MC equation (gate_C_d_CE_mu_zero from
CartanConnection.lean) and Yang-Baxter integrability
(layer_2d_yang_baxter_holds from YangBaxter.lean) with full docstrings
- Fixed Sidon lemma: revert+dec_trivial replaces direct dec_trivial
(fixes 'Expected type must not contain free variables' on Fin 8)
AGENTS.md:
- Added CartanConnection and YangBaxter to module status table
- Documented Layer 2c/2d architecture and Layer 2b quarantine
- Updated sorry counts (Layer 3 only, 7 geometric conjectures)
Build: 3299 jobs, 0 errors (lake build SilverSight.PIST.UnifiedCovariant)
Also verified: SilverSight.PIST.CartanConnection and
SilverSight.PIST.YangBaxter build cleanly
84 lines
3.8 KiB
Text
84 lines
3.8 KiB
Text
/-
|
||
CartanConnection.lean — Algebraic MC integrability for the Sidon crossing matrix
|
||
|
||
Defines the 2-cochain μ ∈ C²(V,V) from the Sidon crossing matrix (I₂, I₄)
|
||
and proves d_CE μ = 0 (the Jacobiator vanishes) by finite computation.
|
||
|
||
For 2-cochains the Nijenhuis–Richardson self-bracket satisfies
|
||
[μ,μ]_{NR}(X,Y,Z) = 2·J_μ(X,Y,Z). d_CE μ + ½[μ,μ]_{NR} = 0 → d_CE μ = 0.
|
||
|
||
Fusion-of-fusions context (see BREAKGLASS_NR_BRACKET_PROPOSAL.md):
|
||
Layer 2b (analytic): Sidon-orthogonality bypass (row-sum norm bound)
|
||
Layer 2c (algebraic): Jacobiator vanishing — THIS MODULE
|
||
Layer 2d (YB): [μ,μ]_{NR}=0 ⇔ Yang-Baxter integrability
|
||
Layer 2e (TL): Factorization through Fibonacci TL quotient
|
||
PIST: Same Sidon support separation drives gates
|
||
VCN: Vanishing terms = structural zero gaps
|
||
|
||
Gate C verification: `native_decide` on 7³ = 343 basis triples.
|
||
-/
|
||
|
||
import Mathlib.Data.Matrix.Basic
|
||
import Mathlib.Tactic
|
||
|
||
open scoped BigOperators
|
||
|
||
namespace SilverSight.PIST.CartanConnection
|
||
|
||
/-- The standard basis vectors of ℚ⁸ indexed by Fin 8. -/
|
||
def basisVec (i : Fin 8) : Fin 8 → ℚ := λ j => if i = j then 1 else 0
|
||
|
||
/-- The crossing weight C[i,j], from Layer 1 invariants I₂ + I₄:
|
||
σ = 39/256 (diagonal), τ = 1/7 (same-block off-diagonal), 0 (cross-block). -/
|
||
def C_weight (i j : Fin 8) : ℚ :=
|
||
if i = j then (39/256 : ℚ)
|
||
else if i.val / 2 = j.val / 2 then (1/7 : ℚ)
|
||
else 0
|
||
|
||
/-- The 2-cochain μ ∈ C²(ℚ⁸, ℚ⁸) associated to the Sidon crossing matrix.
|
||
On basis vectors: μ(e_i, e_j) = C[i,j]·(e_i − e_j).
|
||
This is alternating: μ(e_j,e_i) = −μ(e_i,e_j).
|
||
|
||
Explicit formula (for efficient native_decide evaluation):
|
||
μ(X,Y)[k] = (C·X)[k]·Y[k] − X[k]·(C·Y)[k] -/
|
||
def mu (X Y : Fin 8 → ℚ) : Fin 8 → ℚ :=
|
||
λ k => (∑ i : Fin 8, X i * C_weight i k) * Y k - X k * (∑ j : Fin 8, Y j * C_weight k j)
|
||
|
||
/-- The Chevalley–Eilenberg differential (Jacobiator) of a 2-cochain,
|
||
in the abelian case where the bracket on V is trivial:
|
||
(d_CE μ)(X,Y,Z) = μ(μ(X,Y), Z) + μ(μ(Y,Z), X) + μ(μ(Z,X), Y). -/
|
||
def Jacobiator (μ : (Fin 8 → ℚ) → (Fin 8 → ℚ) → (Fin 8 → ℚ))
|
||
(X Y Z : Fin 8 → ℚ) : Fin 8 → ℚ :=
|
||
μ (μ X Y) Z + μ (μ Y Z) X + μ (μ Z X) Y
|
||
|
||
/-- The 7 basis vectors v_k = e_k − e_7 of V = ker(Σ) = {w ∈ ℚ⁸ | Σ w_i = 0}.
|
||
k ranges over Fin 7, embedded into indices 0–6 of Fin 8. -/
|
||
def v (k : Fin 7) : Fin 8 → ℚ :=
|
||
λ i => if i = (k.castSucc : Fin 8) then 1
|
||
else if i = 7 then -1
|
||
else 0
|
||
|
||
/-- Theorem (Gate C): The Jacobiator of μ vanishes on all 7³ = 343 basis
|
||
triples of V. Verified by `native_decide`. By trilinearity this
|
||
extends to all of V, proving d_CE μ = 0. -/
|
||
theorem Jacobiator_basis_all : ((Finset.univ : Finset (Fin 7)).product
|
||
((Finset.univ : Finset (Fin 7)).product (Finset.univ : Finset (Fin 7)))).filter
|
||
(λ (ijk : Fin 7 × Fin 7 × Fin 7) => Jacobiator mu (v ijk.1) (v ijk.2.1) (v ijk.2.2) ≠ 0) = ∅ := by
|
||
native_decide
|
||
|
||
/-- Convenience: the Jacobiator vanishes for any single basis triple. -/
|
||
lemma Jacobiator_basis_zero (i j k : Fin 7) : Jacobiator mu (v i) (v j) (v k) = 0 := by
|
||
have h_all := Jacobiator_basis_all
|
||
have mem : (i, (j, k)) ∈ (Finset.univ : Finset (Fin 7)).product
|
||
((Finset.univ : Finset (Fin 7)).product (Finset.univ : Finset (Fin 7))) := by
|
||
simp
|
||
by_contra hne
|
||
have hmem_filter : (i, (j, k)) ∈ ((Finset.univ : Finset (Fin 7)).product
|
||
((Finset.univ : Finset (Fin 7)).product (Finset.univ : Finset (Fin 7)))).filter
|
||
(λ (ijk : Fin 7 × Fin 7 × Fin 7) => Jacobiator mu (v ijk.1) (v ijk.2.1) (v ijk.2.2) ≠ 0) := by
|
||
apply Finset.mem_filter.mpr
|
||
exact ⟨mem, hne⟩
|
||
rw [h_all] at hmem_filter
|
||
simp at hmem_filter
|
||
|
||
end SilverSight.PIST.CartanConnection
|