Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.1 (companion theorem) — quantum Booleanization Q(C)=Θ(Qbool(C))Q(C)=\Theta(Q_{\mathrm{bool}}(C))Q(C)=Θ(Qbool​(C))

Open
ExactLearningSeparation678.Randomized.Supplement.theorem_4_1

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

machine-learningp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-informationquery-complexity

There are absolute constants a,b>0a,b>0a,b>0 such that for every concept class C⊆{0,1}NC\subseteq\{0,1\}^NC⊆{0,1}N,

a Qbool(C)≤Q(C)≤b Qbool(C),a\,Q_{\mathrm{bool}}(C)\le Q(C)\le b\,Q_{\mathrm{bool}}(C),aQbool​(C)≤Q(C)≤bQbool​(C),

where Q(C)Q(C)Q(C) is the bounded-error quantum query complexity of exactly learning CCC and Qbool(C)=max⁡P⊆CQ(bP)Q_{\mathrm{bool}}(C)=\max_{P\subseteq C}Q(b_P)Qbool​(C)=maxP⊆C​Q(bP​) is the largest bounded-error quantum query complexity of deciding membership bP(c)=1[c∈P]b_P(c)=1[c\in P]bP​(c)=1[c∈P] of the unknown concept in a subset PPP.

Quantumly, identifying a concept is therefore no harder, up to a constant factor, than the hardest single yes/no question about it.

Formalization Note The constants precede the coordinate set and the class. Q(bP)Q(b_P)Q(bP​) uses the same quantum query model as Q(C)Q(C)Q(C), with a Boolean output and success probability at least 2/32/32/3 for every c∈Cc\in Cc∈C.

Differences from the source:

  • encoding: coordinates [N] of C ⊆ {0,1}^N → an arbitrary finite type ι : Type with decidable equality, concepts ι → Bool; reason: a relabeling of [N]; every N, including N = 0, is an instance
  • encoding: bounded-error quantum and randomized query complexities Q(C), R(C) → the published quantumExactComplexity (QueryAlg, XOR oracle, any finite workspace) and classicalExactComplexity (randomized decision trees, worst-case query bound), success ≥ 2/3 on every target; reason: the mission’s published models of the source’s Q and R
  • encoding: Q(C) = Θ(Q_bool(C)) for every C → a, b > 0 quantified before ι and C with a·Q_bool ≤ Q ≤ b·Q_bool; reason: the source’s Θ is uniform over all classes
Preamble
import Definitions.Def_ExactLearningSeparation678_Randomized_Supplement_Models

open Classical
set_option autoImplicit false
Formal statement
namespace ExactLearningSeparation678.Randomized.Supplement

open QAlgorithms.Learning

/-- Theorem 4.1 (Quantum Booleanization), p.29: `Q(C) = Θ(Q_bool(C))` uniformly: absolute
`a, b > 0`, fixed before `N` and `C`, with `a · Q_bool(C) ≤ Q(C) ≤ b · Q_bool(C)`. -/
theorem theorem_4_1 : ∃ a b : ℝ, 0 < a ∧ 0 < b ∧
    ∀ (ι : Type) [Fintype ι] [DecidableEq ι] (C : Finset (ι → Bool)),
      a * (Qbool C : ℝ) ≤ (quantumExactComplexity C : ℝ) ∧
      (quantumExactComplexity C : ℝ) ≤ b * (Qbool C : ℝ) := by sorry

end ExactLearningSeparation678.Randomized.Supplement
Source
Srinivasan Arunachalam, Amin Shiraz Gilani, Nikhil S. Mande, STOC 2027 submission #678 (October 2026), Theorem 4.1, p.29; Booleanization, p.28; https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/678.pdf

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