Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.3 — Validity of the hidden-sign instances

Open
TarskiBootstrap.Dimensional.Supplement.lemma_4_3

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

adversary-methodp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-query-complexitytarski-fixed-points

Let F\mathcal FF be a family of monotone self-maps of [n]k[n]^k[n]k, each with a unique fixed point f∗f^*f∗, whose possible fixed points lie on an antichain AAA, and let DDD be the downward closure of AAA. Then for every s∈{−1,0,1}s\in\{-1,0,1\}s∈{−1,0,1}:

  1. Hs:f↦(f,σsf)H_s:f\mapsto(f,\sigma^f_s)Hs​:f↦(f,σsf​) is injective on F\mathcal FF;
  2. for every f∈Ff\in\mathcal Ff∈F, the sign function σsf\sigma^f_sσsf​ is monotone;
  3. for every f∈Ff\in\mathcal Ff∈F, f∗f^*f∗ is the unique solution of the Tarski∗^*∗ instance (f,σsf)(f,\sigma^f_s)(f,σsf​): for all x∈[n]kx\in[n]^kx∈[n]k,
(x⪯f(x)∧σsf(x)≥0)∨(x⪰f(x)∧σsf(x)≤0)  ⟺  x=f∗.\bigl(x\preceq f(x)\wedge\sigma^f_s(x)\ge0\bigr)\vee\bigl(x\succeq f(x)\wedge\sigma^f_s(x)\le0\bigr)\iff x=f^*.(x⪯f(x)∧σsf​(x)≥0)∨(x⪰f(x)∧σsf​(x)≤0)⟺x=f∗.

Here σsf\sigma^f_sσsf​ equals sss at f∗f^*f∗, −1-1−1 at the other points of DDD and 111 off DDD. The lemma shows that Hs(F)H_s(\mathcal F)Hs​(F) consists of valid instances of the hidden-sign problem whatever sign is hidden.

Differences from the source:

  • encoding: a hard instance family for Tarski(n, k) in which every function has a unique fixed point → F : Set (Grid n k → Grid n k) with every member monotone and having a unique fixed point; reason: Definition 2.1: instances are monotone self-maps of [n]^k; "hard" adds no assumption beyond the stated witness
  • encoding: all possible fixed points lie on an antichain A → A antichain with possibleAnswers F ⊆ A; reason: literal transcription; the set of possible fixed points is the published possibleAnswers F
  • encoding: s ∈ {−1, 0, 1} → s : SignType; reason: the same three ordered values
  • encoding: f* is the unique solution → for all x, x is a solution ↔ x = fixedPoint f; reason: states both that f* solves the instance and that nothing else does; fixedPoint f is f* under uniqueness
Preamble
import Definitions.Def_TarskiBootstrap_Dimensional_Supplement_HiddenSign
import Definitions.Def_TarskiBootstrap_Dimensional_Supplement_TarskiStar
Formal statement
namespace TarskiBootstrap.Dimensional.Supplement

/-- Lemma 4.3, PDF/printed pp. 17–18: for every hidden sign `s ∈ {-1, 0, 1}`, the
hidden-sign constructor `H_s(f) = (f, σ_s^f)` is injective on `F`, each `σ_s^f` is
monotone, and `f*` is the unique solution of the `Tarski*` instance `(f, σ_s^f)`. -/
theorem lemma_4_3 {n k : ℕ+} (F : Set (Grid n k → Grid n k)) (A : Set (Grid n k))
    (hF : ∀ f : F, Monotone f.val ∧ ∃! x, f.val x = x)
    (hA : IsAntichain (· ≤ ·) A) (hcontains : possibleAnswers F ⊆ A)
    (s : SignType) :
    Function.Injective (fun f : F => (f.val, hiddenSign A s f.val)) ∧
    (∀ f : F, Monotone (hiddenSign A s f.val)) ∧
    (∀ f : F, ∀ x : Grid n k,
      IsTarskiStarSolution f.val (hiddenSign A s f.val) x ↔ x = fixedPoint f.val) := by sorry

end TarskiBootstrap.Dimensional.Supplement
Source
Li, Ma, Yang and Zhao, Bootstrapping Classical and Quantum Query Lower Bounds for Finding Tarski Fixed Points, STOC 2027 submission #6 (2026), frozen preprint, Lemma 4.3, PDF/printed pp. 17–18, SHA-256 320afa8333f95589a388b30ffbfd6d7b7e5d93cdf07fa8630825fbf7d0107d59; https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/6.pdf. Printed page = PDF page. No arXiv identifier/version supplied.

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