Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Tarski∗(n,k)^*(n,k)∗(n,k) instances and solutions

Definition
TarskiBootstrap_Dimensional_Supplement_TarskiStar

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

A Tarski∗(n,k)^*(n,k)∗(n,k) instance is a pair (f,σ)(f,\sigma)(f,σ) of a monotone map f:[n]k→[n]kf:[n]^k\to[n]^kf:[n]k→[n]k and a monotone sign function σ:[n]k→{−1,0,1}\sigma:[n]^k\to\{-1,0,1\}σ:[n]k→{−1,0,1}, monotone meaning σ(x)≤σ(y)\sigma(x)\le\sigma(y)σ(x)≤σ(y) whenever x⪯yx\preceq yx⪯y. The oracle at xxx returns (f(x),σ(x))(f(x),\sigma(x))(f(x),σ(x)). A point xxx is a solution if

(x⪯f(x) ∧ σ(x)≥0) ∨ (x⪰f(x) ∧ σ(x)≤0).\bigl(x\preceq f(x)\ \wedge\ \sigma(x)\ge0\bigr)\ \vee\ \bigl(x\succeq f(x)\ \wedge\ \sigma(x)\le0\bigr).(x⪯f(x) ∧ σ(x)≥0) ∨ (x⪰f(x) ∧ σ(x)≤0).

No bounded-increment restriction is imposed on fff. This is the intermediate problem through which the hidden-sign construction passes.

Formalization Note Signs are Mathlib's SignType, ordered −1<0<1-1<0<1−1<0<1.

Definition code
import Definitions.Def_TarskiBootstrap_Dimensional_Grid

namespace TarskiBootstrap.Dimensional.Supplement

/-- Definition 2.3, PDF/printed p. 6: a `Tarski*(n, k)` instance is a monotone
`f : [n]^k → [n]^k` together with a monotone sign function `σ : [n]^k → {-1, 0, 1}`
(`σ(x) ≤ σ(y)` whenever `x ⪯ y`); no bounded-increment condition is imposed. -/
def IsTarskiStarInstance {n k : ℕ+} (f : Grid n k → Grid n k)
    (σ : Grid n k → SignType) : Prop :=
  Monotone f ∧ Monotone σ

/-- Definition 2.3: `x` solves the `Tarski*` instance `(f, σ)` iff
`x ⪯ f(x) ∧ σ(x) ≥ 0` or `x ⪰ f(x) ∧ σ(x) ≤ 0`. -/
def IsTarskiStarSolution {n k : ℕ+} (f : Grid n k → Grid n k)
    (σ : Grid n k → SignType) (x : Grid n k) : Prop :=
  (x ≤ f x ∧ 0 ≤ σ x) ∨ (f x ≤ x ∧ σ x ≤ 0)

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, Definition 2.3, PDF/printed p. 6, 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