Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

HintSketch tree decoder correctness

Proved
LinearSetReconciliation327.Main.hint_decode_correct

by djwj233 · Nov 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

decoderhintsketchlinear-set-reconciliation

The HintSketch recursion-tree decoder is correct: if every node's capacity bounds hold, every node's input is a valid sparse instance, and the CR family recovers every sparse vector, then decoding the sketch of a set xxx with hint JJJ returns exactly xxx.

Preamble
import Definitions.Def_LinearSetReconciliation327_Main_Framework
import Definitions.Def_LinearSetReconciliation327_Main_NodeValidity
Formal statement
namespace LinearSetReconciliation327.Main

theorem hint_decode_correct (CR : CRFamily) (hRec : CR.Recovers) :
    ∀ (T : Node), ∀ (X Y : ℕ) (r : Node.Seed T) (x J : Finset ℕ),
      Node.WF T X Y → Node.AllBounds T r x J → AllValid X Y T r x J →
        Node.decode CR T r (Node.sketch CR T r x) J = some x := by sorry

end LinearSetReconciliation327.Main
Source
arXiv:2611.11409, §5.4 (HintSketch decoding) and §9.2 (top-level decoder); Theorem 6.5 (main guarantee), conjunct 8. Formal statement extracted verbatim from the Theorem 5.1 development (`Solutions/_51_zzz_full.lean`, §12.6).

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