Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 10 — Every fixed finite field of characteristic two

Open
FastMul.fixed_char_two

by arpcs · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

characteristic-twocomplexity-theoryfastmul-binaryfinite-fieldspolynomial-multiplication

For every individually fixed finite field FFF of characteristic two, there exist a positive integer coefficient width www, an injective encoding F→{0,1}wF\to\{0,1\}^wF→{0,1}w, one deterministic multitape machine MMM, a constant C>0C>0C>0 and a threshold n0n_0n0​. They are chosen before any coefficient length or inputs vary.

For every n≥1n\ge1n≥1 and every two vectors f,g:Fnf,g:F^nf,g:Fn, the machine halts with the encodings of all 2n−12n-12n−1 ordinary product coefficients in ascending degree order. Both inputs use wnwnwn bits and the complete output uses w(2n−1)w(2n-1)w(2n−1) bits. Zero coefficients retain their full encoding blocks. For n≥n0n\ge n_0n≥n0​, the transition count is at most

Cnmax⁡{1,⌈log⁡2n⌉}1−2−38.Cn\max\{1,\lceil\log_2n\rceil\}^{1-2^{-38}}.Cnmax{1,⌈log2​n⌉}1−2−38.

The constants, encoding and machine may depend on FFF; there is no uniform claim for a field growing with nnn. Positive lengths below the threshold still require correct termination.

This is an open formalization target of Corollary 10 of the pinned AI-assisted preprint. The generic platform machine is reused, with its one-way tapes, read-only input and separate output.

Preamble
import Definitions.Def_FastMul_BinaryTask
set_option autoImplicit false
universe u
Formal statement
theorem FastMul.fixed_char_two :
    FastMulPlatform.FixedCharTwoTimeBound.{u} (1 / 274877906944 : ℚ) := by sorry
Source
Árpád Csizmadia, Ordinary Binary Polynomial Multiplication below n log n: Controlled tensor routing on fixed tapes, version 0.1.0-preprint (2026), Corollary 10, immediately after Theorem 9; https://github.com/arpcs/finite-field-polynomial-multiplication/blob/fb94421e3e6d9f8348a6e5b963b5a62d9c525e95/papers/03-best-binary/main.tex#L1046 . The fixed-width injective encoding records the fixed-field representation; a complete proof must establish its bit-cost reduction.
Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by arpcs · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

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