Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Stable coefficients for connected forests across all boundary patterns

Proved
WeldedPath.connected_coefficient_stability

by dmilosch · Nov 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

coefficient-stabilityfinite-dimensional-hilbert-spaceswelded-trees

Let H be a valid connected abstract forest on k vertices and G a valid welded-tree instance, with n≥16 and 2≤l≤n−4. Let B contain V_bd and be disjoint from V_weld. Assume

4k∣B∣2n≤12,96(n+1)k32n≤12.\frac{4k|B|}{2^n}\le\frac12, \qquad \frac{96(n+1)k^3}{2^n}\le\frac12.2n4k∣B∣​≤21​,2n96(n+1)k3​≤21​.

For an arbitrary complex coefficient family h(F,v,d), define its represented amplitude by

ψh(ϕ)=μref(ϕ)∑F⊆[k]∑v∈[k]1{F={u:ϕ(u)∈B},  F⊆Cϕtree(v)}h(F,v,Wϕfix(v)).\psi_h(\phi)=\sqrt{\mu^{\rm ref}(\phi)} \sum_{F\subseteq [k]}\sum_{v\in[k]} \mathbf 1_{\{F=\{u:\phi(u)\in B\},\;F\subseteq C^{\rm tree}_\phi(v)\}} h(F,v,W^{\rm fix}_\phi(v)).ψh​(ϕ)=μref(ϕ)​F⊆[k]∑​v∈[k]∑​1{F={u:ϕ(u)∈B},F⊆Cϕtree​(v)}​h(F,v,Wϕfix​(v)).

There exists another coefficient family h′ such that ψ_h′(φ)=ψ_h(φ) for every injective assignment φ, and

∥ψh′∥22≤2∑ϕ injective∣ψh(ϕ)∣2.\|\psi_{h'}\|_2^2\le 2\sum_{\phi\text{ injective}}|\psi_h(\phi)|^2.∥ψh′​∥22​≤2ϕ injective∑​∣ψh​(ϕ)∣2.

The conclusion concerns the norm of the represented amplitude. It covers the empty boundary pattern and every nonempty boundary pattern, without a factor counting the number of patterns.

Preamble
import Definitions.Def_WeldedPath_Supplement_projGood
Formal statement
namespace WeldedPath

open Classical Supplement
open scoped BigOperators

theorem connected_coefficient_stability :
    ∀ n l : ℕ, 16 ≤ n → 2 ≤ l → l ≤ n - 4 →
    ∀ G : WeldedInstance n, G.IsValid →
    ∀ H : AbsForest n, H.IsValid →
    ∀ s : Fin H.k, (∀ u, H.graph.Reachable s u) →
    ∀ B : Finset ℕ, Vbd n l ⊆ B → Disjoint B (Vweld n) →
      (H.k : ℝ) * (B.card : ℝ) * (4 / (2 : ℝ) ^ n) ≤ 1 / 2 →
      (H.k : ℝ) ^ 3 * (96 * ((n : ℝ) + 1) / (2 : ℝ) ^ n) ≤ 1 / 2 →
    ∀ h : Finset (Fin H.k) → Fin H.k →
      (Finset (Fin H.k) × Finset (Fin H.k × ℕ) × Finset (Fin H.k × ℕ)) → ℂ,
    let amplitude := fun h : Finset (Fin H.k) → Fin H.k →
      (Finset (Fin H.k) × Finset (Fin H.k × ℕ) × Finset (Fin H.k × ℕ)) → ℂ =>
      (WithLp.toLp 2 (fun φ : Fin H.k → Label n =>
        ∑ F : Finset (Fin H.k), ∑ v : Fin H.k,
          if (∀ u, (φ u).val ∈ B ↔ u ∈ F) ∧ F ⊆ H.Ctree φ v then
            (Real.sqrt (H.muRef l G φ) : ℂ) * h F v (H.Wfix φ v) else 0) :
        Hil (Fin H.k → Label n))
    ∃ h',
      (∀ φ, Function.Injective φ → amplitude h' φ = amplitude h φ) ∧
      ‖amplitude h'‖ ^ 2 ≤
        2 * ∑ φ, if Function.Injective φ then ‖amplitude h φ‖ ^ 2 else 0 := by
  sorry

end WeldedPath
Source
Carolan, Childs, Coudron, Gilani, Miloschewsky, Podder, Algorithmic Wave-Particle Duality: Pathfinding in Welded Trees is Hard, https://arxiv.org/html/2611.05912v1#S4.SS1, Section 4.1 and the coefficient-stability step of Lemma 4.3. This is an explicit connected-forest intermediate with the canonical reference measure and fixed data, covering all exact boundary-label patterns.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me