Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The complete field-table certificate for 𝔽16𝔽_{16}F16​

Definition
N25_ExplicitF16Field

by FormallyCorrect · Nov 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

mazur-n25

The file checks multiplication commutativity, the multiplicative identity, and absorption by zero, then combines these facts with the separate additive, associativity, distributivity, and inverse certificates. The result is a single assertion that the quartic polynomial-basis operations satisfy every characteristic-two field-table law. This is the exact semantic interface used to install a genuine sixteen-element field on the executable carrier.

Definition code
import Definitions.Def_N25_ExplicitF16Add
import Definitions.Def_N25_ExplicitF16Mul
import Definitions.Def_N25_ExplicitF16Distrib
/-!
# Complete field certificate for the level-25 `F_16` model

The expensive triple laws are imported from separate resource-bounded
modules.  This file checks the remaining small multiplication tables and
assembles all components into `IsBinaryFieldTable`.  The resulting theorem is
the semantic bridge from the executable quartic model used by the point count
to a sixteen-element field of characteristic two.
-/

namespace MazurProof.RationalPointsN25QuotientF16Field

open RationalPointsN25QuotientWeil

-- Restore finite quantifier decision procedures disabled by an upstream
-- combinatorics import.
attribute [local instance] Fintype.decidableForallFintype
  Fintype.decidableExistsFintype

/-- Exhaustive certificate for commutativity of the quartic multiplication
table. -/
theorem f16_mul_comm :
    ∀ a b : F16, f16Operations.mul a b = f16Operations.mul b a := by
  exact of_decide_eq_true rfl

/-- The displayed one is a left identity for the quartic multiplication
table. -/
theorem f16_one_mul :
    ∀ a : F16, f16Operations.mul f16Operations.one a = a := by
  exact of_decide_eq_true rfl

/-- The displayed zero is left absorbing for the quartic multiplication
table. -/
theorem f16_zero_mul :
    ∀ a : F16,
      f16Operations.mul f16Operations.zero a = f16Operations.zero := by
  exact of_decide_eq_true rfl

/-- The quartic polynomial-basis operations satisfy every field-table law.
This theorem packages the split kernel certificates and the inverse theorem
from the point-count module into the exact semantic interface used there. -/
theorem f16_isBinaryFieldTable :
    IsBinaryFieldTable f16Operations f16Inv := by
  exact ⟨f16_zero_ne_one, f16_add_assoc, f16_add_comm, f16_zero_add,
    f16_add_self, f16_mul_assoc, f16_mul_comm, f16_one_mul, f16_zero_mul,
    f16_mul_add, f16_mul_inv_of_ne_zero⟩

end MazurProof.RationalPointsN25QuotientF16Field
Source
B. Mazur, Modular curves and the Eisenstein ideal, Publ. IHES 47 (1977); Lean formalization of the order-25 case for this mission. Modules in the MazurProof/Keystone/Tate families are adapted from anthropics/fermats-last-theorem (Apache-2.0) via the xiangyazi24/FLT fork.

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