Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Fixed-width binary expansion has a polynomial realizer

Proved
OPI.W6.IsPR.natBits_pr

by sragavan · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

lean-formalizationquantum-algorithmstwo-fold-opi-construction

For natural numbers L,kL, kL,k, natBits(L,k)\mathrm{natBits}(L, k)natBits(L,k) is the list of the LLL binary digits of k mod 2Lk \bmod 2^Lkmod2L, most significant bit first.

IsPR(h)\mathrm{IsPR}(h)IsPR(h) means that hhh has a polynomial realizer: a program of the underlying machine model whose running charge and output size are bounded by a monotone polynomial in the input size, where a natural number nnn has size 2n+12n+12n+1 (unary coding).

Statement. The map (L,k)↦natBits(L,k)(L, k) \mapsto \mathrm{natBits}(L, k)(L,k)↦natBits(L,k) has a polynomial realizer.

Binary expansions appear in the entries of the lookup tables of the circuit (phase tables, controlled-rotation tables, encodings of coordinates), so the generator needs this realizer to output those tables.

Preamble
import Definitions.Def_TwoFoldOPI_CL_Part03
import Mathlib
import Definitions.Def_QAlgorithms_Defs_Circuit
import Definitions.Def_QAlgorithms_Defs_GradientMethods
import Definitions.Def_QAlgorithms_Defs_OPIOraclePrograms
import Definitions.Def_QAlgorithms_Defs_OPIUniformity
import Definitions.Def_QAlgorithms_Defs_Fourier
import Definitions.Def_TwoFoldOPI_elemBits
import Definitions.Def_TwoFoldOPI_schurSquare
import Definitions.Def_TwoFoldOPI_schurFailureSum
import Definitions.Def_CodingTheory
import Definitions.Def_OAIThreeMachineSched01
import Definitions.Def_CookLevin_Cost
import Definitions.Def_TwoFoldOPI_codeOf
import Definitions.Def_TwoFoldOPI_solves
import Definitions.Def_TwoFoldOPI_Input
import Definitions.Def_TwoFoldOPI_CLSerializableF
open OPI.W6.IsPR
open OAI.ThreeMachine.StackCompiler OPI
variable {α : Type} [Coding α]
Formal statement
theorem OPI.W6.IsPR.natBits_pr : IsPR (fun x : ℕ × ℕ => natBits x.1 x.2) := by sorry
Source
Formalization of Theorem 7.4 (algorithmic part), repository https://github.com/sragavan99/lean-prove2me-fills/blob/f7224a159e790347c1a83c5ac23c63e5094a6a2c/WorkInProgress/QuantumOPIVariants/OPI/BitsPR.lean#L135-L145

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