import Std /-! OMEGA bridges, 10 November 2026. Lean 4.19.0 + Std only. Concrete golden-pair algebra; the local 600-cell/icosahedron identification; all 56 degree <= 5 moment equalities; exact linear-field reconstruction. The fixture is literal integer-pair data emitted from the pinned geometry. The normalization to the real unit sphere and the identification with its integral moments are explained in PROOFS.md, not formalized here. -/ namespace OmegaBridges set_option autoImplicit false set_option maxRecDepth 100000 set_option maxHeartbeats 16000000 abbrev GP := Int × Int def gadd (p q : GP) : GP := (p.1+q.1, p.2+q.2) def gsub (p q : GP) : GP := (p.1-q.1, p.2-q.2) def gmul (p q : GP) : GP := (p.1*q.1+p.2*q.2, p.1*q.2+p.2*q.1+p.2*q.2) def gscale (k : Int) (p : GP) : GP := (k*p.1, k*p.2) def gnorm (p : GP) : Int := p.1*p.1+p.1*p.2-p.2*p.2 def gconj (p : GP) : GP := (p.1+p.2, -p.2) def gpow (p : GP) : Nat → GP | 0 => (1,0) | n+1 => gmul (gpow p n) p def gsum : List GP → GP | [] => (0,0) | p::ps => gadd p (gsum ps) macro "int_poly" : tactic => `(tactic| (try simp only [Int.mul_add, Int.add_mul, Int.mul_sub, Int.sub_mul, Int.neg_mul, Int.mul_neg, Int.neg_neg, Int.neg_add, Int.sub_eq_add_neg] all_goals try simp only [Int.mul_assoc, Int.mul_left_comm, Int.mul_comm] all_goals try simp only [Int.reduceMul] all_goals try simp only [← Int.mul_assoc] all_goals omega)) theorem golden_relation : gmul (0,1) (0,1) = gadd (1,0) (0,1) := rfl theorem golden_mul_comm (p q : GP) : gmul p q = gmul q p := by rcases p with ⟨a,b⟩ rcases q with ⟨c,d⟩ apply Prod.ext <;> dsimp [gmul] <;> int_poly theorem golden_mul_assoc (p q r : GP) : gmul (gmul p q) r = gmul p (gmul q r) := by rcases p with ⟨a,b⟩ rcases q with ⟨c,d⟩ rcases r with ⟨e,f⟩ apply Prod.ext <;> dsimp [gmul] <;> int_poly theorem conjugate_product (p : GP) : gmul p (gconj p) = (gnorm p,0) := by rcases p with ⟨a,b⟩ apply Prod.ext <;> dsimp [gmul,gconj,gnorm] <;> int_poly theorem norm_multiplicative (p q : GP) : gnorm (gmul p q) = gnorm p * gnorm q := by rcases p with ⟨a,b⟩ rcases q with ⟨c,d⟩ dsimp [gmul,gnorm] int_poly def fib (p : GP) : GP := (p.2, p.1+p.2) def goldenStep (p : GP) : GP := (13*p.1+6*p.2, 6*p.1+19*p.2) def goldenIter (p : GP) : Nat → GP | 0 => p | n+1 => goldenStep (goldenIter p n) theorem golden_step_is_multiplication (p : GP) : goldenStep p = gmul (13,6) p := by rcases p with ⟨a,b⟩ apply Prod.ext <;> dsimp [goldenStep,gmul] <;> int_poly theorem golden_step_is_fibonacci_polynomial (p : GP) : goldenStep p = gadd (gscale 13 p) (gscale 6 (fib p)) := by rcases p with ⟨a,b⟩ apply Prod.ext <;> dsimp [goldenStep,gadd,gscale,fib] <;> omega theorem golden_step_norm (p : GP) : gnorm (goldenStep p) = 211*gnorm p := by rw [golden_step_is_multiplication,norm_multiplicative] rfl theorem golden_iter_norm (p : GP) (n : Nat) : gnorm (goldenIter p n) = (211 : Int)^n * gnorm p := by induction n with | zero => simp [goldenIter] | succ n ih => rw [goldenIter,golden_step_norm,ih,Int.pow_succ] ac_rfl theorem golden_step_spectral_recurrence (p : GP) : gadd (goldenStep (goldenStep p)) (gscale 211 p) = gscale 32 (goldenStep p) := by rcases p with ⟨a,b⟩ apply Prod.ext <;> dsimp [goldenStep,gadd,gscale] <;> omega theorem golden_step_injective : ∀ p q, goldenStep p = goldenStep q → p = q := by intro p q h have h1 := congrArg Prod.fst h have h2 := congrArg Prod.snd h rcases p with ⟨a,b⟩ rcases q with ⟨c,d⟩ dsimp [goldenStep] at h1 h2 apply Prod.ext <;> dsimp <;> omega theorem conjugate_multiplier : gmul (13,6) (19,-6) = (211,0) := by decide +kernel abbrev V3 := GP × GP × GP def dot3 (p q : V3) : GP := gadd (gadd (gmul p.1 q.1) (gmul p.2.1 q.2.1)) (gmul p.2.2 q.2.2) def distanceNumerator (p q : List GP) : GP := gsum ((p.zip q).map (fun v => gmul (gsub v.1 v.2) (gsub v.1 v.2))) /- Generated by verify_bridges.py from the pinned graph construction. -/ def vertices600 : List (List GP) := [ [(-2, 0), (0, 0), (0, 0), (0, 0)], [(-1, 0), (-1, 0), (-1, 0), (-1, 0)], [(-1, 0), (-1, 0), (-1, 0), (1, 0)], [(-1, 0), (-1, 0), (1, 0), (-1, 0)], [(-1, 0), (-1, 0), (1, 0), (1, 0)], [(-1, 0), (-1, 1), (0, -1), (0, 0)], [(-1, 0), (-1, 1), (0, 1), (0, 0)], [(-1, 0), (0, -1), (0, 0), (-1, 1)], [(-1, 0), (0, -1), (0, 0), (1, -1)], [(-1, 0), (0, 0), (-1, 1), (0, -1)], [(-1, 0), (0, 0), (-1, 1), (0, 1)], [(-1, 0), (0, 0), (1, -1), (0, -1)], [(-1, 0), (0, 0), (1, -1), (0, 1)], [(-1, 0), (0, 1), (0, 0), (-1, 1)], [(-1, 0), (0, 1), (0, 0), (1, -1)], [(-1, 0), (1, -1), (0, -1), (0, 0)], [(-1, 0), (1, -1), (0, 1), (0, 0)], [(-1, 0), (1, 0), (-1, 0), (-1, 0)], [(-1, 0), (1, 0), (-1, 0), (1, 0)], [(-1, 0), (1, 0), (1, 0), (-1, 0)], [(-1, 0), (1, 0), (1, 0), (1, 0)], [(-1, 1), (-1, 0), (0, 0), (0, -1)], [(-1, 1), (-1, 0), (0, 0), (0, 1)], [(-1, 1), (0, -1), (-1, 0), (0, 0)], [(-1, 1), (0, -1), (1, 0), (0, 0)], [(-1, 1), (0, 0), (0, -1), (-1, 0)], [(-1, 1), (0, 0), (0, -1), (1, 0)], [(-1, 1), (0, 0), (0, 1), (-1, 0)], [(-1, 1), (0, 0), (0, 1), (1, 0)], [(-1, 1), (0, 1), (-1, 0), (0, 0)], [(-1, 1), (0, 1), (1, 0), (0, 0)], [(-1, 1), (1, 0), (0, 0), (0, -1)], [(-1, 1), (1, 0), (0, 0), (0, 1)], [(0, -1), (-1, 0), (-1, 1), (0, 0)], [(0, -1), (-1, 0), (1, -1), (0, 0)], [(0, -1), (-1, 1), (0, 0), (-1, 0)], [(0, -1), (-1, 1), (0, 0), (1, 0)], [(0, -1), (0, 0), (-1, 0), (-1, 1)], [(0, -1), (0, 0), (-1, 0), (1, -1)], [(0, -1), (0, 0), (1, 0), (-1, 1)], [(0, -1), (0, 0), (1, 0), (1, -1)], [(0, -1), (1, -1), (0, 0), (-1, 0)], [(0, -1), (1, -1), (0, 0), (1, 0)], [(0, -1), (1, 0), (-1, 1), (0, 0)], [(0, -1), (1, 0), (1, -1), (0, 0)], [(0, 0), (-2, 0), (0, 0), (0, 0)], [(0, 0), (-1, 0), (0, -1), (-1, 1)], [(0, 0), (-1, 0), (0, -1), (1, -1)], [(0, 0), (-1, 0), (0, 1), (-1, 1)], [(0, 0), (-1, 0), (0, 1), (1, -1)], [(0, 0), (-1, 1), (-1, 0), (0, -1)], [(0, 0), (-1, 1), (-1, 0), (0, 1)], [(0, 0), (-1, 1), (1, 0), (0, -1)], [(0, 0), (-1, 1), (1, 0), (0, 1)], [(0, 0), (0, -1), (-1, 1), (-1, 0)], [(0, 0), (0, -1), (-1, 1), (1, 0)], [(0, 0), (0, -1), (1, -1), (-1, 0)], [(0, 0), (0, -1), (1, -1), (1, 0)], [(0, 0), (0, 0), (-2, 0), (0, 0)], [(0, 0), (0, 0), (0, 0), (-2, 0)], [(0, 0), (0, 0), (0, 0), (2, 0)], [(0, 0), (0, 0), (2, 0), (0, 0)], [(0, 0), (0, 1), (-1, 1), (-1, 0)], [(0, 0), (0, 1), (-1, 1), (1, 0)], [(0, 0), (0, 1), (1, -1), (-1, 0)], [(0, 0), (0, 1), (1, -1), (1, 0)], [(0, 0), (1, -1), (-1, 0), (0, -1)], [(0, 0), (1, -1), (-1, 0), (0, 1)], [(0, 0), (1, -1), (1, 0), (0, -1)], [(0, 0), (1, -1), (1, 0), (0, 1)], [(0, 0), (1, 0), (0, -1), (-1, 1)], [(0, 0), (1, 0), (0, -1), (1, -1)], [(0, 0), (1, 0), (0, 1), (-1, 1)], [(0, 0), (1, 0), (0, 1), (1, -1)], [(0, 0), (2, 0), (0, 0), (0, 0)], [(0, 1), (-1, 0), (-1, 1), (0, 0)], [(0, 1), (-1, 0), (1, -1), (0, 0)], [(0, 1), (-1, 1), (0, 0), (-1, 0)], [(0, 1), (-1, 1), (0, 0), (1, 0)], [(0, 1), (0, 0), (-1, 0), (-1, 1)], [(0, 1), (0, 0), (-1, 0), (1, -1)], [(0, 1), (0, 0), (1, 0), (-1, 1)], [(0, 1), (0, 0), (1, 0), (1, -1)], [(0, 1), (1, -1), (0, 0), (-1, 0)], [(0, 1), (1, -1), (0, 0), (1, 0)], [(0, 1), (1, 0), (-1, 1), (0, 0)], [(0, 1), (1, 0), (1, -1), (0, 0)], [(1, -1), (-1, 0), (0, 0), (0, -1)], [(1, -1), (-1, 0), (0, 0), (0, 1)], [(1, -1), (0, -1), (-1, 0), (0, 0)], [(1, -1), (0, -1), (1, 0), (0, 0)], [(1, -1), (0, 0), (0, -1), (-1, 0)], [(1, -1), (0, 0), (0, -1), (1, 0)], [(1, -1), (0, 0), (0, 1), (-1, 0)], [(1, -1), (0, 0), (0, 1), (1, 0)], [(1, -1), (0, 1), (-1, 0), (0, 0)], [(1, -1), (0, 1), (1, 0), (0, 0)], [(1, -1), (1, 0), (0, 0), (0, -1)], [(1, -1), (1, 0), (0, 0), (0, 1)], [(1, 0), (-1, 0), (-1, 0), (-1, 0)], [(1, 0), (-1, 0), (-1, 0), (1, 0)], [(1, 0), (-1, 0), (1, 0), (-1, 0)], [(1, 0), (-1, 0), (1, 0), (1, 0)], [(1, 0), (-1, 1), (0, -1), (0, 0)], [(1, 0), (-1, 1), (0, 1), (0, 0)], [(1, 0), (0, -1), (0, 0), (-1, 1)], [(1, 0), (0, -1), (0, 0), (1, -1)], [(1, 0), (0, 0), (-1, 1), (0, -1)], [(1, 0), (0, 0), (-1, 1), (0, 1)], [(1, 0), (0, 0), (1, -1), (0, -1)], [(1, 0), (0, 0), (1, -1), (0, 1)], [(1, 0), (0, 1), (0, 0), (-1, 1)], [(1, 0), (0, 1), (0, 0), (1, -1)], [(1, 0), (1, -1), (0, -1), (0, 0)], [(1, 0), (1, -1), (0, 1), (0, 0)], [(1, 0), (1, 0), (-1, 0), (-1, 0)], [(1, 0), (1, 0), (-1, 0), (1, 0)], [(1, 0), (1, 0), (1, 0), (-1, 0)], [(1, 0), (1, 0), (1, 0), (1, 0)], [(2, 0), (0, 0), (0, 0), (0, 0)] ] def icoNodes : List V3 := [ ((0,-1), (0,0), (1,0)), ((0,-1), (0,0), (-1,0)), ((1,0), (0,-1), (0,0)), ((1,0), (0,1), (0,0)), ((0,0), (1,0), (0,-1)), ((0,0), (-1,0), (0,-1)), ((0,0), (1,0), (0,1)), ((0,0), (-1,0), (0,1)), ((-1,0), (0,-1), (0,0)), ((-1,0), (0,1), (0,0)), ((0,1), (0,0), (1,0)), ((0,1), (0,0), (-1,0)) ] def axis : List GP := [(-2,0),(0,0),(0,0),(0,0)] def axisNeighbors : List (List GP) := vertices600.filter (fun v => decide (distanceNumerator axis v = (8,-4))) def localAligned : List V3 := axisNeighbors.map (fun v => (gmul (0,1) (v[1]!), gmul (0,1) (v[3]!), gmul (0,1) (v[2]!))) theorem concrete_vertex_count : vertices600.length = 120 := by decide +kernel theorem concrete_vertex_shape : vertices600.all (fun v => decide (v.length=4)) = true := by decide +kernel theorem local_neighbor_count : axisNeighbors.length = 12 := by decide +kernel theorem local_neighbor_slice : axisNeighbors.all (fun v => decide (v[0]! = (0,-1))) = true := by decide +kernel theorem local_map_exact : localAligned = icoNodes := by decide +kernel def geometricRow (v : List GP) (j : Nat) : GP := gadd (gscale 13 (v[j]!)) (gsum ((vertices600.filter (fun w => decide (distanceNumerator v w = (8,-4)))).map (fun w => w[j]!))) theorem all_480_geometric_mode_entries : vertices600.all (fun v => (List.range 4).all (fun j => decide (geometricRow v j = gmul (13,6) (v[j]!)))) = true := by decide +kernel -- Standard icosahedral coordinates have one zero entry; the other entries -- are signed 1 and signed phi, in these three cyclic coordinate patterns. def standardIco : List V3 := [((0,0),(-1,0),(0,-1)), ((-1,0),(0,-1),(0,0)), ((0,-1),(0,0),(-1,0)), ((0,0),(-1,0),(0,1)), ((-1,0),(0,1),(0,0)), ((0,1),(0,0),(-1,0)), ((0,0),(1,0),(0,-1)), ((1,0),(0,-1),(0,0)), ((0,-1),(0,0),(1,0)), ((0,0),(1,0),(0,1)), ((1,0),(0,1),(0,0)), ((0,1),(0,0),(1,0))] theorem local_is_standard_icosahedron : icoNodes.length = 12 ∧ icoNodes.Nodup ∧ icoNodes.all (fun v => decide (v ∈ standardIco)) = true := by decide +kernel theorem local_radius : icoNodes.all (fun v => decide (dot3 v v = (2,1))) = true := by decide +kernel abbrev Exponent := Nat × Nat × Nat def exponents5 : List Exponent := ((List.range 6).flatMap (fun a => (List.range 6).flatMap (fun b => (List.range 6).map (fun c => (a,b,c))))).filter (fun e => decide (e.1+e.2.1+e.2.2 ≤ 5)) def monomial (v : V3) (e : Exponent) : GP := gmul (gmul (gpow v.1 e.1) (gpow v.2.1 e.2.1)) (gpow v.2.2 e.2.2) def momentSum (e : Exponent) : GP := gsum (icoNodes.map (fun v => monomial v e)) def expectedSum (e : Exponent) : GP := if e.1%2=1 ∨ e.2.1%2=1 ∨ e.2.2%2=1 then (0,0) else if e.1+e.2.1+e.2.2=0 then (12,0) else if e.1+e.2.1+e.2.2=2 then (8,4) else if e.1=4 ∨ e.2.1=4 ∨ e.2.2=4 then (12,12) else (4,4) theorem all_56_exponents : exponents5.length = 56 := by decide +kernel theorem degree_five_moment_table : exponents5.all (fun e => decide (momentSum e = expectedSum e)) = true := by decide +kernel theorem every_degree_five_moment (a b c : Nat) (h : a+b+c ≤ 5) : momentSum (a,b,c) = expectedSum (a,b,c) := by have ha : a < 6 := by omega have hb : b < 6 := by omega have hc : c < 6 := by omega have hm : (a,b,c) ∈ exponents5 := by simp only [exponents5,List.mem_filter,List.mem_flatMap,List.mem_map,List.mem_range] exact ⟨⟨a,ha,b,hb,c,hc,rfl⟩,by simpa using h⟩ exact of_decide_eq_true ((List.all_eq_true.mp degree_five_moment_table) _ hm) def sampleLinear (w : V3) : List GP := icoNodes.map (fun u => dot3 u w) def synthLinear (s : List GP) : V3 := (gsum ((icoNodes.zip s).map (fun v => gmul v.1.1 v.2)), gsum ((icoNodes.zip s).map (fun v => gmul v.1.2.1 v.2)), gsum ((icoNodes.zip s).map (fun v => gmul v.1.2.2 v.2))) theorem icosahedral_frame_identity (w : V3) : synthLinear (sampleLinear w) = (gmul (8,4) w.1,gmul (8,4) w.2.1,gmul (8,4) w.2.2) := by rcases w with ⟨⟨a,b⟩,⟨c,d⟩,⟨e,f⟩⟩ apply Prod.ext · apply Prod.ext <;> dsimp [sampleLinear,synthLinear,icoNodes,dot3,gsum,gadd,gmul] <;> int_poly · apply Prod.ext <;> apply Prod.ext <;> dsimp [sampleLinear,synthLinear,icoNodes,dot3,gsum,gadd,gmul] <;> int_poly def divide20 (p : GP) : GP := (p.1/20,p.2/20) def decodeLinear (s : List GP) : V3 := let v := synthLinear s (divide20 (gmul (3,-1) v.1),divide20 (gmul (3,-1) v.2.1), divide20 (gmul (3,-1) v.2.2)) theorem frame_inverse_numerator (p : GP) : gmul (3,-1) (gmul (8,4) p) = gscale 20 p := by rcases p with ⟨a,b⟩ apply Prod.ext <;> dsimp [gmul,gscale] <;> int_poly theorem linear_field_reconstruction (w : V3) : decodeLinear (sampleLinear w) = w := by unfold decodeLinear rw [icosahedral_frame_identity] simp only [frame_inverse_numerator] rcases w with ⟨⟨a,b⟩,⟨c,d⟩,⟨e,f⟩⟩ simp [divide20,gscale] theorem linear_samples_injective : ∀ x y, sampleLinear x = sampleLinear y → x = y := by intro x y h have hd := congrArg decodeLinear h simpa only [linear_field_reconstruction] using hd end OmegaBridges -- Dependency audit for every theorem in this file. #print axioms OmegaBridges.golden_relation #print axioms OmegaBridges.golden_mul_comm #print axioms OmegaBridges.golden_mul_assoc #print axioms OmegaBridges.conjugate_product #print axioms OmegaBridges.norm_multiplicative #print axioms OmegaBridges.golden_step_is_multiplication #print axioms OmegaBridges.golden_step_is_fibonacci_polynomial #print axioms OmegaBridges.golden_step_norm #print axioms OmegaBridges.golden_iter_norm #print axioms OmegaBridges.golden_step_spectral_recurrence #print axioms OmegaBridges.golden_step_injective #print axioms OmegaBridges.conjugate_multiplier #print axioms OmegaBridges.concrete_vertex_count #print axioms OmegaBridges.concrete_vertex_shape #print axioms OmegaBridges.local_neighbor_count #print axioms OmegaBridges.local_neighbor_slice #print axioms OmegaBridges.local_map_exact #print axioms OmegaBridges.all_480_geometric_mode_entries #print axioms OmegaBridges.local_is_standard_icosahedron #print axioms OmegaBridges.local_radius #print axioms OmegaBridges.all_56_exponents #print axioms OmegaBridges.degree_five_moment_table #print axioms OmegaBridges.every_degree_five_moment #print axioms OmegaBridges.icosahedral_frame_identity #print axioms OmegaBridges.frame_inverse_numerator #print axioms OmegaBridges.linear_field_reconstruction #print axioms OmegaBridges.linear_samples_injective