sixteen_spin_partition_fn
For a simple graph G on a finite type V with decidable equality and decidable adjacency, and an edge angle function θ : Sym2 V → ℝ on unordered pairs of vertices, sixteen_spin_partition_fn G θ is defined as (1 / (16 ^ Fintype.card V : ℂ)) times the sum over all spin configurations s : V → Fin 4 → Fin 2 of the product over all edges e ∈ G.edgeFinset of sixteen_spin_weight (θ e) (fun i => if s u i = s v i then 0 else 1), evaluating on endpoints u, v of e via Sym2.lift.
Statement
open scoped Classical in noncomputable def sixteen_spin_partition_fn {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (θ : Sym2 V → ℝ) : ℂ
- Defined in
- OP-1695; arXiv:2610.27080
- Verified
- 14 Nov 2026
- Axioms
- none listed
- Built on 1
- sixteen_spin_weightFor a real angle θ and a difference vector d in (Fin 2)^4, the sixteen-spin edge weight w(d) is exp(8 i θ) if d = (0, 1, 0, 1), exp(-8 i…
Read back from the Lean
For a finite type V with decidable equality, a simple graph G on V with decidable adjacency, and a function θ : Sym2 V → ℝ, sixteen_spin_partition_fn G θ is defined as the complex number:
(1 / 16^(|V|)) * ∑_{s : V → Fin 4 → Fin 2} ∏_{e ∈ G.edgeFinset} weight(e, s)
where each vertex configuration s assigns to each vertex v ∈ V a 4-bit string s v : Fin 4 → Fin 2, and for each edge e = s(u, v) (an unordered pair {u, v}), the edge weight is given by sixteen_spin_weight (θ e) d, where d : Fin 4 → Fin 2 is defined coordinate-wise by d i = 0 if s u i = s v i and d i = 1 if s u i ≠ s v i.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
open scoped Classical in /-- The sixteen-spin partition function for an edge-weighted graph G with angles on Sym2 V. -/ noncomputable def sixteen_spin_partition_fn {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (θ : Sym2 V → ℝ) : ℂ := (1 / (16 ^ Fintype.card V : ℂ)) * ∑ s : V → Fin 4 → Fin 2, ∏ e ∈ G.edgeFinset, Sym2.lift ⟨fun u v => sixteen_spin_weight (θ s(u, v)) (fun i => if s u i = s v i then 0 else 1), fun u v => by have h : (fun i => (if s u i = s v i then (0 : Fin 2) else 1)) = (fun i => (if s v i = s u i then (0 : Fin 2) else 1)) := by funext i; by_cases heq : s u i = s v i <;> simp [heq, eq_comm] simp [h, Sym2.eq_swap]⟩ e