Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Fixed points of Frobenius lie in the prime field

Proved
LatticePrepro.exists_zmod_of_pow_eq

by WizardOfMenlo · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

coding-theorycvp-ncp-preprocessinghardness-of-approximationlatticespreprocessing

Let ppp be a prime and let Ω\OmegaΩ be a field that is an algebra over the prime field Fp=Z/pZ\mathbb{F}_p = \mathbb{Z}/p\mathbb{Z}Fp​=Z/pZ, with structure map ι ⁣:Fp→Ω\iota\colon \mathbb{F}_p \to \Omegaι:Fp​→Ω (so Ω\OmegaΩ has characteristic ppp). If an element c∈Ωc \in \Omegac∈Ω is fixed by the Frobenius map, then it comes from the prime field:

cp=c⟹c=ι(a)  for some a∈Fp.c^p = c \quad\Longrightarrow\quad c = \iota(a) \ \text{ for some } a \in \mathbb{F}_p.cp=c⟹c=ι(a)  for some a∈Fp​.

In the moment reconstruction theorem (Theorem A.7), the coefficients of the reconstructed coefficient function are shown to be fixed by Frobenius; this lemma then places them in Fp\mathbb{F}_pFp​, so that the reconstructed function takes values in the prime field, as coefficient functions must (Definition 4.1).

Formalization Note: Fp\mathbb{F}_pFp​ is ZMod p with Fact p.Prime, and ι\iotaι is algebraMap (ZMod p) Ω. The field Ω\OmegaΩ is arbitrary; it need not be finite (in the application it is an algebraic closure).

Preamble
import Mathlib

open Polynomial
variable {Ω : Type*} [Field Ω]
Formal statement
theorem LatticePrepro.exists_zmod_of_pow_eq {p : ℕ} [hp : Fact p.Prime] [Algebra (ZMod p) Ω] {c : Ω}
    (hc : c ^ p = c) : ∃ a : ZMod p, algebraMap (ZMod p) Ω a = c := by sorry
Source
G. Fenzi, G. Weissenberg, Nearly Optimal Hardness for CVP and NCP with Preprocessing (STOC 2027 submission #847; IACR ePrint 2026/2634, https://eprint.iacr.org/2026/2634), auxiliary lemma used in the proof of Theorem A.7 (\label{thm:moment-hankel-reconstruction}); Lean: LatticePrepro/Basic/FiniteField.lean, LatticePrepro.exists_zmod_of_pow_eq

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