Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Conjugation and the antichain constructor B\mathcal BB

Definition
TarskiBootstrap_Dimensional_Supplement_AntichainConstructor

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

For x∈[n]kx\in[n]^kx∈[n]k its conjugate is xˉ=(n−1)1−x\bar x=(n-1)\mathbf 1-xxˉ=(n−1)1−x. For a self-map fff of [n]k[n]^k[n]k, the antichain constructor produces the self-map of [n]2k=[n]k×[n]k[n]^{2k}=[n]^k\times[n]^k[n]2k=[n]k×[n]k

B(f)(x,y)=(f(x), f(yˉ)‾).\mathcal B(f)(x,y)=\bigl(f(x),\ \overline{f(\bar y)}\bigr).B(f)(x,y)=(f(x), f(yˉ​)​).

For a family F\mathcal FF, B(F)={B(f):f∈F}\mathcal B(\mathcal F)=\{\mathcal B(f):f\in\mathcal F\}B(F)={B(f):f∈F}.

The constructor doubles the dimension and places the fixed points (f∗,f∗‾)(f^*,\overline{f^*})(f∗,f∗​) on the antichain of points with coordinate sum k(n−1)k(n-1)k(n−1), which the logarithmic and dimensional bootstrapping theorems require.

Formalization Note [n]2k[n]^{2k}[n]2k is represented as the product Grid n k × Grid n k with the componentwise order, which is the coordinatewise order on the 2k2k2k coordinates (an explicit order isomorphism is flattenBlocks n k 2 of the published grid definition).

Definition code
import Definitions.Def_TarskiBootstrap_Dimensional_FixedPoint

namespace TarskiBootstrap.Dimensional.Supplement

/-- The conjugate `x̄ = (n-1)𝟏 - x` of a grid point, §3.3, PDF/printed p. 16. -/
def gridConj {n k : ℕ+} (x : Grid n k) : Grid n k := fun i => Fin.rev (x i)

/-- Definition 3.8, PDF/printed p. 16: `B(f)(x, y) = (f(x), conj(f(conj y)))`.
The grid `[n]^{2k}` is the pair `Grid n k × Grid n k` with the product order, which is
the coordinatewise order on the `2k` coordinates. -/
def antichainConstructor {n k : ℕ+} (f : Grid n k → Grid n k) :
    Grid n k × Grid n k → Grid n k × Grid n k :=
  fun p => (f p.1, gridConj (f (gridConj p.2)))

/-- The image family `B(F) = {B(f) : f ∈ F}`. -/
def antichainFamily {n k : ℕ+} (F : Set (Grid n k → Grid n k)) :
    Set (Grid n k × Grid n k → Grid n k × Grid n k) :=
  Set.range (fun f : F => antichainConstructor f.val)

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 3.8 and equation (3.21), PDF/printed p. 16, 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