Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Field extensions generated by a set

Definition
TauCeti_FieldTheory_IntermediateField_Adjoin_EqTop

by riccardo.brasca · Sep 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theorytauceti-chebotarev

In a tower K⊆L⊆MK\subseteq L\subseteq MK⊆L⊆M, if a set t⊆Mt\subseteq Mt⊆M generates MMM over LLL, then

L K(t)=M.L\,K(t)=M.LK(t)=M.

This compositum identity is used when adjoining roots of unity over different base fields.

Formalization Note. These foundational declarations are transplanted from the Tau Ceti contributors' original source (Apache-2.0, commit 948fe4751b1fe528b6d580c522ca5d743d47f185), with compatibility adaptations for Lean 4.33.1. Mathematical proofs requiring separate theorem nodes are published separately.

Definition code
/- Transplanted from https://github.com/TauCetiProject/TauCeti at 948fe4751b1fe528b6d580c522ca5d743d47f185.
Original source copyright/license notices are retained below.
Generated exclusively from compiler declaration, command, and reference facts. -/
import Mathlib.FieldTheory.IntermediateField.Adjoin.Basic
import Mathlib.RingTheory.Localization.FractionRing

section
set_option autoImplicit true
/-
Copyright (c) 2026 The Tau Ceti contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: The Tau Ceti contributors, Chris Birkbeck
-/
/-!
# Field extensions generated by a set

Complements on `IntermediateField.adjoin F s = ⊤`, the statement that a set `s` generates a field
extension `E / F`: three independent consequences of it, and one criterion for it.

*Extensionality.* An `F`-algebra automorphism of `E` fixing every element of `s` is the
identity. This is the whole-field counterpart of Mathlib's
`IntermediateField.algHom_ext_of_eq_adjoin` (which compares homomorphisms out of the *subfield*
`adjoin F s`), obtained from it by transporting along `adjoin F s ≃ₐ[F] E` rather than repeating
the adjoin induction. It is the extensionality step shared by the multiquadratic arguments:
the splitting law shows a decomposition-group element fixes every generator `√dᵢ` and concludes
it is trivial, and the Frobenius computation concludes the same when every Legendre symbol
is `1`.

*Changing the base of a generated extension.* For a tower `K ⊆ L ⊆ M` in which a set `t`
generates `M` over `L`, the compositum of `K(t)` — generated over the *bottom* of the
tower — with the image of `L` is already all of `M`. That is the shape every compositum argument
over the base `K` needs, because Mathlib's engines (`IntermediateField.fixingSubgroup_sup`,
`IntermediateField.normal_sup`, and the linear-disjointness API) all take two intermediate
fields of a *single* extension `M / K` together with a hypothesis that their join is `⊤`.
Dually, if `s` generates `L` over `K` and `ι : L →ₐ[K] M` lands in a tower `K ⊆ F ⊆ M`, then
over `F` the image of `ι` and the image of `s` generate the same field; this is how a primitive
element of `L / K` becomes one of a base change of `L`.

*Generation from an algebra generator.* If a ring `S` is generated as an `R`-algebra by a single
element `β`, then the fraction field `L` of `S` is generated by the image of `β` over any field
`K` between `R` and `L`, because every element of `L` is a ratio of two elements of `R[β]`. This
is how a generator of an extension of integer rings becomes a primitive element of the extension
of fraction fields.

## Main results

* `TauCeti.IntermediateField.algHom_ext_of_adjoin_eq_top`: algebra homomorphisms into any
  semiring are determined by their values on a generating set.
* `TauCeti.IntermediateField.algEquiv_ext_of_adjoin_eq_top`: two automorphisms agreeing on a
  generating set are equal.
* `TauCeti.IntermediateField.algEquiv_eq_one_of_adjoin_eq_top`: an automorphism fixing each
  element of a generating set is `1`.
* `TauCeti.IntermediateField.adjoin_adjoinSimpleGen_eq_top`: the distinguished generator of a
  simple adjoin generates that field.
* `TauCeti.IntermediateField.adjoin_sup_fieldRange_eq_top`: for a tower `K ⊆ L ⊆ M` in which
  `t` generates `M` over `L`, the compositum `K(t) ⊔ L` is `⊤` inside `M`.
* `TauCeti.IntermediateField.adjoin_range_eq_adjoin_image`: over any intermediate base, the image
  of a `K`-embedding of `L` generates the same field as the image of a generating set of `L/K`.
* `TauCeti.IntermediateField.adjoin_eq_top_of_algebra_adjoin_eq_top`: an algebra generator of a
  domain also generates its fraction field over any intermediate base field.

## Generating sets

The compositum criterion allows an arbitrary set of field generators, so it applies to extensions
that need several generators or contain transcendental elements. It expresses generation over a
larger base as generation by the same set together with that base inside a single extension.
For a cyclotomic extension, the singleton consisting of a primitive root suffices; its algebra
generation hypothesis implies field generation by `IntermediateField.adjoin_eq_top_of_algebra`.

`adjoin_sup_fieldRange_eq_top` is adapted from the Birkbeck–Brasca Chebotarev density project,
where the step is inlined into a larger `adjoin_induction`.
-/

 section

namespace TauCeti.IntermediateField

variable {F E : Type*} [Field F] [Field E] [Algebra F E] {s : Set E}









/-- **The compositum step.** If a set `t` generates `M` over `L`, then inside `M` the
compositum of `K(t)` with the image of `L` is all of `M`, for any base field `K` of the
tower. This is the input to Mathlib's compositum engines
(`IntermediateField.fixingSubgroup_sup`, `IntermediateField.normal_sup`). The single-generator
case `t = {ζ}` is the one the cyclotomic compositum uses; it is obtained by specialisation. -/
theorem adjoin_sup_fieldRange_eq_top (K L M : Type*) [Field K] [Field L] [Field M]
    [Algebra K L] [Algebra K M] [Algebra L M] [IsScalarTower K L M] {t : Set M}
    (hadj : IntermediateField.adjoin L t = ⊤) :
    IntermediateField.adjoin K t ⊔ (IsScalarTower.toAlgHom K L M).fieldRange = ⊤ := by
  refine top_le_iff.mp fun x _ ↦ ?_
  have hx : x ∈ IntermediateField.adjoin L t := hadj ▸ IntermediateField.mem_top
  refine IntermediateField.adjoin_induction L (fun y hy ↦ ?_) (fun r ↦ ?_)
    (fun a b _ _ ha hb ↦ add_mem ha hb) (fun a _ ha ↦ inv_mem ha)
    (fun a b _ _ ha hb ↦ mul_mem ha hb) hx
  · exact le_sup_left (α := IntermediateField K M) (IntermediateField.subset_adjoin K t hy)
  · exact le_sup_right (α := IntermediateField K M) ⟨r, rfl⟩



variable {R S K L : Type*} [CommSemiring R] [CommRing S] [Field K] [Field L] [Algebra R S]
  [Algebra R K] [Algebra R L] [Algebra S L] [Algebra K L] [IsScalarTower R S L]
  [IsScalarTower R K L] [IsFractionRing S L]



end TauCeti.IntermediateField

end
end
Source
https://github.com/TauCetiProject/TauCeti/blob/948fe4751b1fe528b6d580c522ca5d743d47f185/TauCeti/FieldTheory/IntermediateField/Adjoin/EqTop.lean

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