is_stationary_current_zero
For any finite simple graph G and any orientation o of G, the zero current assigning 0 to each edge is stationary.
Statement
theorem is_stationary_current_zero {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (o : SimpleGraphOrientation G) : is_stationary_current G o (fun _ => 0)
- Source
- folklore
- Verified
- 12 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- SimpleGraphOrientationAn orientation of a finite simple graph G assigns to each edge an ordered pair of its endpoints.
- is_stationary_currentA current j on the edges of an oriented finite simple graph G is stationary if at every vertex, the sum of currents leaving the vertex…
- dephased_tree_local_noise_criterion_zeroFor any finite simple graph T on vertex type V, the identically zero noise profile q = fun _ => 0 satisfies…
Read back from the Lean
For any finite type $V$ with decidable equality, any simple graph $G$ on $V$ with decidable adjacency, and any orientation $o$ of $G$, the zero function (mapping each edge $e$ of $G$ to $0 \in \mathbb{R}$) is a stationary current on $G$ with respect to $o$.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
To show that the zero current on an oriented simple graph is stationary, the proof unfolds the definition of `is_stationary_current`. At every vertex, the net outgoing current is a sum of terms of the form $(\text{if } \dots \text{ then } 0 \text{ else } 0) - (\text{if } \dots \text{ then } 0 \text{ else } 0)$, which simplifies to a sum of zeros and immediately evaluates to 0.
The zero current satisfies the vertex conservation law at every vertex, and is therefore a stationary current. automation
Unfolding the definition of `is_stationary_current`, the goal requires proving that at each vertex $v$, the net flow $\sum_e ((\text{if } (o(e))_1 = v \text{ then } 0 \text{ else } 0) - (\text{if } (o(e))_2 = v \text{ then } 0 \text{ else } 0))$ equals $0$. The simplifier reduces each conditional `if ... then 0 else 0` to $0$, making every summand $0 - 0 = 0$; the entire sum is then $0 = 0$, which holds trivially.
uses
dephased_tree_local_noise_criterion_zerois_stationary_current G o (fun _ => 0) := by first | exact dephased_tree_local_noise_criterion_zero | (apply dephased_tree_local_noise_criterion_zero <;> assumption) | (apply dephased_tree_local_noise_criterion_zero <;> simp_all) | simpa using dephased_tree_local_noise_criterion_zero | (simp only [SimpleGraphOrientation, is_stationary_current] at *; first | exact dephased_tree_local_noise_criterion_zero | (apply dephased_tree_local_noise_criterion_zero <;> assumption) | (apply dephased_tree_local_noise_criterion_zero <;> simp_all) | simpa using dephased_tree_local_noise_criterion_zero)
dephased_tree_local_noise_criterion_zero- For any simple graph $T$, the zero function satisfies the dephased tree local noise criterion.
- The tactic script uses a fallback chain (`first | ...`) from proof search. Although `dephased_tree_local_noise_criterion_zero` is passed to `simpa`, it is redundant: the simplifier resolves the goal on its own by evaluating the trivial conditionals and arithmetic.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- The zero current is a stationary current on any oriented simple graph. -/theorem is_stationary_current_zero {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (o : SimpleGraphOrientation G) : is_stationary_current G o (fun _ => 0) := by first | exact dephased_tree_local_noise_criterion_zero | (apply dephased_tree_local_noise_criterion_zero <;> assumption) | (apply dephased_tree_local_noise_criterion_zero <;> simp_all) | simpa using dephased_tree_local_noise_criterion_zero | (simp only [SimpleGraphOrientation, is_stationary_current] at *; first | exact dephased_tree_local_noise_criterion_zero | (apply dephased_tree_local_noise_criterion_zero <;> assumption) | (apply dephased_tree_local_noise_criterion_zero <;> simp_all) | simpa using dephased_tree_local_noise_criterion_zero)