is_half_integral_current
def
For a finite simple graph G with decidable equality on vertices and decidable adjacency, a function j on the edge finset of G into the reals is half-integral if for every edge e in G.edgeFinset, j(e) is equal to 0, 1/2, -1/2, 1, or -1.
Statement
def is_half_integral_current {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (j : G.edgeFinset → ℝ) : Prop
- Defined in
- arXiv:2204.00875
- Verified
- 12 Nov 2026
- Axioms
- none listed
- Used by 2
- cubic_half_integral_saturated_edges_minFor a finite simple graph G with decidable equality and adjacency, and an orientation o of G, the invariant b(G) is the infimum in the…
- op_1560_entropy_upper_bound_of_half_integralFor any finite simple graph G with orientation o and any half-integral stationary current j on G.edgeFinset with sum of |j(e)| equal to…
Read back from the Lean
Given a finite type V with decidable equality, a simple graph G on V with decidable adjacency, and a function j : G.edgeFinset → ℝ assigning a real number to each undirected edge of G, is_half_integral_current G j asserts that for every edge e in G.edgeFinset, j(e) is equal to 0, 1/2, -1/2, 1, or -1.
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
/-- A function j on the edges of G is half-integral if every edge current lies in {0, ±1/2, ±1}. -/ def is_half_integral_current {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (j : G.edgeFinset → ℝ) : Prop := ∀ e : G.edgeFinset, j e = 0 ∨ j e = 1/2 ∨ j e = -1/2 ∨ j e = 1 ∨ j e = -1