Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bottom-up threshold propagation stabilizes on a rooted tree

Proved
DirKECC1549.Main.hitting_set_stabilizes

by parclytaxel · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

directed-graphsgraph-algorithms

Let VVV have nnn vertices, let rrr be a root, and suppose a parent map fixes rrr and every vertex reaches rrr under repeated parent steps. Given arbitrary natural vertex weights and a threshold bbb, define Algorithm 2's propagated values by starting with zero at every vertex and repeatedly replacing each value with the vertex weight plus its children's previous values, reset to zero if the sum exceeds bbb. Then every value is unchanged between rounds nnn and n+1n+1n+1. This is a stabilization property of bottom-up propagation on a finite rooted tree, independent of any graph-edge or outdegree assumptions.

Preamble
import Definitions.Def_DirKECC1549_Main_HittingSet
set_option autoImplicit false
Formal statement
namespace DirKECC1549.Main
theorem hitting_set_stabilizes {n : ℕ} (r : Fin n) (par : Fin n → Fin n)
    (deg : Fin n → ℕ) (b : ℕ) (hroot : par r = r)
    (hreach : ∀ v, ∃ j : ℕ, par^[j] v = r) (v : Fin n) :
    alg2Rho r par deg b (n + 1) v = alg2Rho r par deg b n v := by sorry
end DirKECC1549.Main
Source
Derived auxiliary fact for Algorithm 2, Georgiadis, Kipouridis, Kosinas, Papadopoulos and Pergaminelis, STOC 2027 submission #1549, Section 3.2.1, pp. 13–14.

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