Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.4 — Triangle-tensor adversary for the hidden sign

Open
TarskiBootstrap.Dimensional.Supplement.lemma_4_4

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, AAA be as in Lemma 4.3, and let Γ0\Gamma_0Γ0​ be 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. Label F′=H−1(F)⊔H0(F)⊔H1(F)\mathcal F'=H_{-1}(\mathcal F)\sqcup H_0(\mathcal F)\sqcup H_1(\mathcal F)F′=H−1​(F)⊔H0​(F)⊔H1​(F) by (s,f)(s,f)(s,f), with oracle (s,f)↦(x↦(f(x),σsf(x)))(s,f)\mapsto\bigl(x\mapsto(f(x),\sigma^f_s(x))\bigr)(s,f)↦(x↦(f(x),σsf​(x))) and answer TarskiH(s,f)=σsf(f∗)\mathrm{Tarski}^H(s,f)=\sigma^f_s(f^*)TarskiH(s,f)=σsf​(f∗). Then Γ=K3⊗Γ0\Gamma=K_3\otimes\Gamma_0Γ=K3​⊗Γ0​ is a nonnegative adversary matrix for TarskiH(n,k)∣F′\mathrm{Tarski}^H(n,k)|_{\mathcal F'}TarskiH(n,k)∣F′​ and

∥Γ∥≥2λand∥Γ∘Δx′∥≤2δfor every x∈[n]k,\|\Gamma\|\ge2\lambda\qquad\text{and}\qquad\|\Gamma\circ\Delta'_x\|\le2\delta\quad\text{for every }x\in[n]^k,∥Γ∥≥2λand∥Γ∘Δx′​∥≤2δfor every x∈[n]k,

so Γ\GammaΓ yields the spectral lower bound (2λ)/(2δ)=λ/δ(2\lambda)/(2\delta)=\lambda/\delta(2λ)/(2δ)=λ/δ.

The hidden-sign problem therefore keeps the adversary ratio of the original family; it is the inner problem composed with ordered search.

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
  • reading: Γ "yields a spectral lower bound of λ/δ" → SpectralWitness for Γ with the pair (2λ, 2δ); reason: the proof (4.5)–(4.6) establishes ‖Γ‖ ≥ 2λ and ‖Γ ∘ Δ′_x‖ ≤ 2δ and concludes "(2λ)/(2δ) = λ/δ"; the literal pair (λ, δ) fails for the unscaled Γ (F = {f1, f2} with distinct fixed points, Γ0 = [[0,1],[1,0]], λ = δ = 1 and f1(x) ≠ f2(x) give ‖Γ ∘ Δ′_x‖ = 2 > δ), so the ratio reading is the one the page proves
  • encoding: F′ = H_{−1}(F) ⊔ H_0(F) ⊔ H_1(F) as a set of Tarski* instances → inputs indexed by labels (s, f) ∈ SignType × F; reason: the source labels F′ uniquely by (s, f) and indexes Γ by the labels (p. 18)
Preamble
import Definitions.Def_TarskiBootstrap_Dimensional_Supplement_HiddenSign
import Definitions.Def_TarskiBootstrap_Dimensional_Witness

open scoped Matrix
Formal statement
namespace TarskiBootstrap.Dimensional.Supplement

/-- Lemma 4.4, PDF/printed p. 18, in the reading its proof establishes ((4.5), (4.6)):
`Γ = K_3 ⊗ Γ_0`, indexed by the labels `(s, f)` of `F′`, is a nonnegative adversary
matrix for `Tarski^H(n, k)|F′` with `‖Γ‖ ≥ 2λ` and `‖Γ ∘ Δ′_x‖ ≤ 2δ` for every `x`,
i.e. a spectral lower bound of `(2λ)/(2δ) = λ/δ`. -/
theorem lemma_4_4 {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)
    (Γ₀ : Matrix F F ℝ) (lam δ : ℝ) (hδ : 0 < δ)
    (hΓ₀ : NonnegativeAdversary (fun f : F => fixedPoint f.val) Γ₀)
    (hw : SpectralWitness (fun f : F => f.val) Γ₀ lam δ) :
    NonnegativeAdversary
        (fun p : SignType × F => tarskiHAnswer (hiddenSignOracle A p.1 p.2.val))
        (hiddenSignAdversary Γ₀) ∧
      SpectralWitness (fun p : SignType × F => hiddenSignOracle A p.1 p.2.val)
        (hiddenSignAdversary Γ₀) (2 * 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, Lemma 4.4, PDF/printed p. 18; proof (4.5)–(4.6), p. 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