Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A maximal prime-fiber count forces unit ramification and residue degrees

Proved
TauCeti.RamificationInertia.ramificationIdx_eq_one_and_inertiaDeg_eq_one_of_ncard_primesOver_eq_finrank

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

number-theorytauceti-chebotarev

Let RRR be a commutative integral domain and let SSS be a commutative RRR-algebra that is finite and flat as an RRR-module. Let P⊆RP\subseteq RP⊆R be prime and let Q⊆SQ\subseteq SQ⊆S be prime above PPP. If the number of primes of SSS above PPP equals the module rank n=rank⁡RSn=\operatorname{rank}_R Sn=rankR​S, then

e(Q/P)=1andf(Q/P)=1.e(Q/P)=1\qquad\text{and}\qquad f(Q/P)=1.e(Q/P)=1andf(Q/P)=1.

Here eee is the ideal ramification index and fff the residue-field degree.

This extracts the local indices from complete splitting expressed solely as a maximal number of prime ideals.

Source: the Tau Ceti contributors (Apache-2.0, commit 948fe4751b1fe528b6d580c522ca5d743d47f185).

Preamble
/- 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.NumberTheory.RamificationInertia.Inertia
import Mathlib.RingTheory.Ideal.GoingUp
import Mathlib.RingTheory.RamificationInertia.Basic

section
set_option autoImplicit true
namespace TauCeti.RamificationInertia
end TauCeti.RamificationInertia
/-
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
-/
/-!
# Complete splitting is trivial ramification and inertia

This file records the non-Galois counting criterion for primes in finite flat extensions of
domains: a prime has as many primes above it as the degree allows exactly when every one of them
is unramified with trivial residue extension.

The Galois form, where the count is compared with the order of the Galois group, is in
`TauCeti/NumberTheory/RamificationInertia/Galois.lean`. No Galois hypothesis is needed here:
the fundamental identity alone forces each summand `e * f` down to `1`.

## Main results

* `ramificationIdx_eq_one_and_inertiaDeg_eq_one_of_ncard_primesOver_eq_finrank` — a maximal count
  of primes above `P` makes `e = f = 1` at each of them.
* `Ideal.ncard_primesOver_eq_finrank_iff_forall_ramificationIdx_eq_one_and_inertiaDeg_eq_one` —
  conversely, `e = f = 1` at every prime above `P` makes the count maximal.
* `bijective_algebraMap_quotient_of_ncard_primesOver_eq_finrank` — for `P` maximal, the same count
  makes the residue map `R ⧸ P → S ⧸ Q` bijective.

## Provenance

Built directly on Mathlib's fundamental identity for finite flat extensions of domains
(`Ideal.sum_ramification_inertia_eq_finrank`). The residue-field consequence additionally uses
Mathlib's identification of the inertia degree with the rank of the residue extension
(`Ideal.inertiaDeg'_algebraMap`) and its characterisation of rank-one algebras over a field
(`Algebra.finrank_eq_one_iff_bijective_algebraMap`).
-/

 section

open Ideal Module

namespace TauCeti.RamificationInertia
end TauCeti.RamificationInertia
section TauCeti.RamificationInertia
open TauCeti TauCeti.RamificationInertia


Formal statement
theorem TauCeti.RamificationInertia.ramificationIdx_eq_one_and_inertiaDeg_eq_one_of_ncard_primesOver_eq_finrank
    {R S : Type*} [_root_.CommRing R] [_root_.IsDomain R] [_root_.CommRing S] [_root_.Algebra R S] [_root_.Module.Finite R S]
    [_root_.Module.Flat R S] (P : _root_.Ideal R) [P.IsPrime] (Q : _root_.Ideal S)
    [Q.IsPrime] [Q.LiesOver P] (hsplit : (P.primesOver S).ncard = _root_.Module.finrank R S) :
    Q.ramificationIdx R = 1 ∧ Q.inertiaDeg R = 1 := by sorry
Source
https://github.com/TauCetiProject/TauCeti/blob/948fe4751b1fe528b6d580c522ca5d743d47f185/TauCeti/NumberTheory/RamificationInertia/Splitting.lean#L47-L73

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