Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

[Q(θ):Q]=deg⁡f[\mathbb{Q}(\theta):\mathbb{Q}] = \deg f[Q(θ):Q]=degf for irreducible fff

Proved
GNFS.finrank_adjoin_root_eq_natDegree

by Lucas · Oct 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-number-theorynumber-theory

Let f∈Q[x]f \in \mathbb{Q}[x]f∈Q[x] be irreducible of degree ddd, and let θ∈C\theta \in \mathbb{C}θ∈C satisfy f(θ)=0f(\theta) = 0f(θ)=0. Then the subfield Q(θ)⊆C\mathbb{Q}(\theta) \subseteq \mathbb{C}Q(θ)⊆C generated by θ\thetaθ has dimension ddd as a vector space over Q\mathbb{Q}Q:

[Q(θ):Q]=d.[\mathbb{Q}(\theta):\mathbb{Q}] = d.[Q(θ):Q]=d.

So every element of Q(θ)\mathbb{Q}(\theta)Q(θ) is written uniquely as ∑i<daiθi\sum_{i<d} a_i\theta^i∑i<d​ai​θi with ai∈Qa_i \in \mathbb{Q}ai​∈Q, which is how GNFS represents number-field elements.

Preamble
import Mathlib
import Definitions.Def_GNFS_defs
open Polynomial IntermediateField
Formal statement
namespace GNFS
theorem finrank_adjoin_root_eq_natDegree (f : ℚ[X]) (hf : Irreducible f) (θ : ℂ)
    (hθ : aeval θ f = 0) :
    Module.finrank ℚ ℚ⟮θ⟯ = f.natDegree := by sorry
end GNFS
Source
Wikipedia, "General number field sieve" (revision oldid=1377718368, https://en.wikipedia.org/w/index.php?title=General_number_field_sieve&oldid=1377718368), section 'Number fields'
Human review
  • Endorsed by Shuze Chen · Oct 13, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 13, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me