AFTD Auto-Formalizing Theoretical Domains

dephased_tree_local_noise_criterion_zero

theoremverified

For any finite simple graph T on vertex type V, the identically zero noise profile q = fun _ => 0 satisfies dephased_tree_local_noise_criterion T (fun _ => 0).

Statement

theorem dephased_tree_local_noise_criterion_zero
    {V : Type*} [Fintype V] [DecidableEq V]
    (T : SimpleGraph V) [DecidableRel T.Adj] :
    dephased_tree_local_noise_criterion T (fun _ => 0)
Source
folklore
Verified
04 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
Used by 1
  • is_stationary_current_zeroFor any finite simple graph G and any orientation o of G, the zero current assigning 0 to each edge is stationary.

Read back from the Lean

For any finite type $V$ with decidable equality, and any simple graph $T$ on $V$ with decidable adjacency relation, the function $q : V \to \mathbb{R}$ constantly equal to $0$ satisfies the dephased_tree_local_noise_criterion with respect to $T$.

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

The theorem asserts that the identically zero noise profile q ≡ 0 satisfies the local noise criterion on any finite graph T. Unfolding the definition gives two conditions: 0 ≥ 0 * 0 for degree-2 vertices, which holds trivially, and a vacuous implication with false premise 0 < 0 for vertices of degree at least 3. Both conditions simplify to True, so the goal is closed immediately by simplification.

  1. The zero noise profile satisfies the dephased tree local noise criterion on any finite simple graph T.

    Unfolding the definition of `dephased_tree_local_noise_criterion` for the constant profile q(v) = 0 leaves a conjunction of two conditions: (1) for vertices v of degree 2 and distinct neighbors u, w, the inequality 0 ≥ 0 * 0 must hold, which simplifies to 0 ≥ 0; and (2) for vertices v of degree at least 3, if 0 < 0 and 0 < 0 then u = w, which holds vacuously since 0 < 0 is false. The simplifier (`simpa`) evaluates both conditions to True and closes the goal.

    line 5

    uses dephased_tree_local_noise_criterion, two_le_simple_graph_tree_estimate

        dephased_tree_local_noise_criterion T (fun _ => 0) := by first | exact two_le_simple_graph_tree_estimate | (apply two_le_simple_graph_tree_estimate <;> assumption) | (apply two_le_simple_graph_tree_estimate <;> simp_all) | simpa using two_le_simple_graph_tree_estimate | (simp only [dephased_tree_local_noise_criterion] at *; first | exact two_le_simple_graph_tree_estimate | (apply two_le_simple_graph_tree_estimate <;> assumption) | (apply two_le_simple_graph_tree_estimate <;> simp_all) | simpa using two_le_simple_graph_tree_estimate)
dephased_tree_local_noise_criterion
The definition specifying that a noise profile q on graph T satisfies q(v) ≥ q(u) * q(w) at degree-2 vertices with distinct neighbors u, w, and that no two distinct neighbors of a vertex of degree ≥ 3 can both have strictly positive noise.
two_le_simple_graph_tree_estimate
For any finite simple graph T, its tree estimate is at least 2. (Syntactically supplied to simpa in the source, but mathematically unused.)

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

/-- The local noise criterion holds unconditionally for the identically zero noise profile on any finite graph. -/theorem dephased_tree_local_noise_criterion_zero    {V : Type*} [Fintype V] [DecidableEq V]    (T : SimpleGraph V) [DecidableRel T.Adj] :    dephased_tree_local_noise_criterion T (fun _ => 0) := by first | exact two_le_simple_graph_tree_estimate | (apply two_le_simple_graph_tree_estimate <;> assumption) | (apply two_le_simple_graph_tree_estimate <;> simp_all) | simpa using two_le_simple_graph_tree_estimate | (simp only [dephased_tree_local_noise_criterion] at *; first | exact two_le_simple_graph_tree_estimate | (apply two_le_simple_graph_tree_estimate <;> assumption) | (apply two_le_simple_graph_tree_estimate <;> simp_all) | simpa using two_le_simple_graph_tree_estimate)
See it in the graphDiscuss this resultChallenge it