Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Uniform binary field arithmetic at logarithmic width

Proved
TimeSpaceMA.GUV.fieldOperations_exists

by bersubs · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

complexity-theorycondensersfinite-fields

For each fixed positive multiplier aaa and width nnn, choose a field of size 2c2^c2c and its quadratic extension, where ccc is aaa times the binary length of the maximum of one and nnn. Give both fields binary labels. Deterministic polynomial-time multitape algorithms compute addition and multiplication in the larger field, the labels of the two embedded coefficients and zero, and the label of an embedded primitive element of the smaller field. Widths are supplied in unary. The positive floor applies to width zero, which is outside the correctness range of the condenser.

Preamble
import Definitions.Def_TimeSpaceMA_GUVFieldOperations
Formal statement
namespace TimeSpaceMA.GUV

theorem fieldOperations_exists :
    ∀ a (ha : 0 < a), Nonempty (BinaryFieldArithmetic a ha) := by sorry

end TimeSpaceMA.GUV
Source
Guruswami, Umans and Vadhan, Unbalanced Expanders and Randomness Extractors from Parvaresh–Vardy Codes, JACM 56(4), 2009, Theorem 6.3. https://www.cs.cmu.edu/~venkatg/pubs/papers/PV-condenser.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