Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.2 — Logarithmic hardness bootstrapping

Open
TarskiBootstrap.Dimensional.Supplement.theorem_1_2

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, whose possible fixed points lie on an antichain AAA. Suppose Γ0\Gamma_0Γ0​ is a nonnegative adversary matrix for Tarski(n,k)∣F\mathrm{Tarski}(n,k)|_{\mathcal F}Tarski(n,k)∣F​ yielding a spectral lower bound of λ/δ\lambda/\deltaλ/δ, δ>0\delta>0δ>0: ∥Γ0∥≥λ\|\Gamma_0\|\ge\lambda∥Γ0​∥≥λ and ∥Γ0∘Δx∥≤δ\|\Gamma_0\circ\Delta_x\|\le\delta∥Γ0​∘Δx​∥≤δ for every query xxx. Then for every integer m≥2m\ge2m≥2 there are a family F′\mathcal F'F′ of monotone self-maps of [nm]2k[nm]^{2k}[nm]2k, each with a unique fixed point, and a nonnegative adversary matrix Γ\GammaΓ for Tarski(nm,2k)∣F′\mathrm{Tarski}(nm,2k)|_{\mathcal F'}Tarski(nm,2k)∣F′​ with

∥Γ∥ ≥ SA(OSm) λandmax⁡x∈[nm]2k∥Γ∘Δx∥ ≤ 2δ,\|\Gamma\|\ \ge\ \mathrm{SA}(\mathrm{OS}_m)\,\lambda\qquad\text{and}\qquad\max_{x\in[nm]^{2k}}\|\Gamma\circ\Delta_x\|\ \le\ 2\delta,∥Γ∥ ≥ SA(OSm​)λandx∈[nm]2kmax​∥Γ∘Δx​∥ ≤ 2δ,

i.e. a spectral lower bound of SA(OSm)λ/(2δ)\mathrm{SA}(\mathrm{OS}_m)\lambda/(2\delta)SA(OSm​)λ/(2δ). Norms are spectral norms, and SA(OSm)\mathrm{SA}(\mathrm{OS}_m)SA(OSm​) is the spectral adversary value (2.8) of ordered search on mmm positions.

Increasing the width from nnn to nmnmnm and the dimension from kkk to 2k2k2k thus multiplies the nonnegative adversary bound by SA(OSm)=Ω(log⁡m)\mathrm{SA}(\mathrm{OS}_m)=\Omega(\log m)SA(OSm​)=Ω(logm); the theorem does not claim that the fixed points of F′\mathcal F'F′ lie on an antichain.

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: an integer m ≥ 2 → m : ℕ+ with 2 ≤ m; reason: same values
  • encoding: SA(OS_m) → osSA m, the spectral adversary value of the m ordered search strings with positions in Fin m; reason: Definition 2.2 and (2.8) transcribed
Preamble
import Definitions.Def_TarskiBootstrap_Dimensional_Supplement_OrderedSearch
import Definitions.Def_TarskiBootstrap_Dimensional_FixedPoint
import Definitions.Def_TarskiBootstrap_Dimensional_Witness

open scoped Matrix
Formal statement
namespace TarskiBootstrap.Dimensional.Supplement

/-- Theorem 1.2 (Logarithmic Hardness Bootstrapping Theorem), PDF/printed pp. 4–5
(restated p. 17, proof pp. 17–23). From a unique-fixed-point family `F` whose possible
fixed points lie on an antichain `A`, with a nonnegative adversary witness `λ/δ`, for
every `m ≥ 2` there is a family `F′` of monotone self-maps of `[nm]^{2k}` with unique
fixed points and a nonnegative adversary matrix `Γ` for `Tarski(nm, 2k)|F′` with
`‖Γ‖ ≥ SA(OS_m) λ` and `max_x ‖Γ ∘ Δ_x‖ ≤ 2δ`. -/
theorem theorem_1_2 {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)
    (lam δ : ℝ) (hδ : 0 < δ)
    (hwitness : ∃ Γ₀ : Matrix F F ℝ,
      NonnegativeAdversary (fun f : F => fixedPoint f.val) Γ₀ ∧
      SpectralWitness (fun f : F => f.val) Γ₀ lam δ)
    (m : ℕ+) (hm : 2 ≤ (m : ℕ)) :
    ∃ F' : Set (Grid (n * m) (2 * k) → Grid (n * m) (2 * k)),
      (∀ g : F', Monotone g.val ∧ ∃! x, g.val x = x) ∧
      ∃ Γ : Matrix F' F' ℝ,
        NonnegativeAdversary (fun g : F' => fixedPoint g.val) Γ ∧
        SpectralWitness (fun g : F' => g.val) Γ (osSA m * lam) (2 * δ) := 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, Theorem 1.2, PDF/printed pp. 4–5; restated p. 17; proof pp. 17–23, 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