dephased_tree_two_positive_neighbors_degree_two
theoremverified
Under the local noise criterion, a vertex with two distinct positive-parameter neighbors has degree exactly two and itself has positive parameter.
Statement
theorem dephased_tree_two_positive_neighbors_degree_two {V : Type*} [Fintype V] [DecidableEq V] (T : SimpleGraph V) [DecidableRel T.Adj] (q : V → ℝ) (hlocal : dephased_tree_local_noise_criterion T q) (v u w : V) (hne : u ≠ w) (hu : T.Adj v u) (hw : T.Adj v w) (hqu : 0 < q u) (hqw : 0 < q w) : T.degree v = 2 ∧ 0 < q v
- Source
- Structural support-path reduction for OP-827, tested exhaustively through 10 vertices in experiment 22387.
- Verified
- 11 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- dephased_tree_local_noise_criterionFor a finite simple graph T on vertex type V and noise profile q : V → ℝ, dephased_tree_local_noise_criterion T q holds if both local…
Lean source view module on GitHub
theorem dephased_tree_two_positive_neighbors_degree_two {V : Type*} [Fintype V] [DecidableEq V] (T : SimpleGraph V) [DecidableRel T.Adj] (q : V → ℝ) (hlocal : dephased_tree_local_noise_criterion T q) (v u w : V) (hne : u ≠ w) (hu : T.Adj v u) (hw : T.Adj v w) (hqu : 0 < q u) (hqw : 0 < q w) : T.degree v = 2 ∧ 0 < q v := by classical have hdeg : 2 ≤ T.degree v := by have hcard : ({u,w} : Finset V).card = 2 := by simp [hne] have hsub : ({u,w} : Finset V) ⊆ T.neighborFinset v := by intro x hx simp only [Finset.mem_insert, Finset.mem_singleton] at hx rcases hx with rfl | rfl · simpa using hu · simpa using hw have hh := Finset.card_le_card hsub rw [hcard] at hh simpa using hh rcases hlocal with ⟨htwo,hbranch⟩ have hdegree : T.degree v = 2 := by by_contra h exact hne (hbranch v (by omega) u w hu hw hqu hqw) refine ⟨hdegree,?_⟩ have hbound := htwo v hdegree u w hne hu hw have hprod : 0 < q u * q w := mul_pos hqu hqw linarith