tree_katz_ising_F
def
For any finite simple graph G on a vertex type V with decidable equality and adjacency, tree_katz_ising_F G is the integer invariant F(G) = 140 ∑_v d_v^3 - 1020 ∑_{vw ∈ E(G)} d_v d_w - 40 ∑_v d_v^2.
Statement
def tree_katz_ising_F {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] : ℤ
- Defined in
- arXiv:2609.20390
- Verified
- 14 Nov 2026
- Axioms
- none listed
- Built on 1
- tree_degree_sq_sumFor any finite type V and simple graph G on V with decidable adjacency, tree_degree_sq_sum G is the integer (with codomain ℤ) defined as…
Read back from the Lean
A definition of an integer-valued quantity tree_katz_ising_F for a simple graph G on a finite vertex type V (with decidable equality and decidable adjacency), defined as:
140 * (the sum over all vertices v of (degree(v))^3)
- 1020 * (the sum over all edges e = {u, v} of degree(u) * degree(v))
- 40 * tree_degree_sq_sum(G).
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
/-- The sixth-order Ising entanglement invariant F(G) = 140 ∑ d_v^3 - 1020 ∑ d_v d_w - 40 ∑ d_v^2. -/ def tree_katz_ising_F {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] : ℤ := 140 * (∑ v : V, (G.degree v : ℤ) ^ 3) - 1020 * (∑ e ∈ G.edgeFinset, Sym2.lift ⟨fun v w => (G.degree v : ℤ) * (G.degree w : ℤ), fun _ _ => mul_comm _ _⟩ e) - 40 * tree_degree_sq_sum G