Sharp lower bounds on selected fibres force a bijection and exact fibre sizes
ProvedFunction.bijective_of_fiber_card_boundsmazur-n25
Let be finite, let be a finite indexing set, let be surjective, and let be injective. Suppose nonnegative integers satisfy and for every . Then
This converts fibrewise lower bounds and a total-cardinality identity into exact point counts.
Preamble
import Mathlib set_option autoImplicit false open Function
Formal statement
theorem Function.bijective_of_fiber_card_bounds
{A B I : Type*} [Finite A] [Fintype I]
(f : A → B) (hf : Surjective f) (p : I → B) (hp : Injective p)
(w : I → ℕ) (hw : ∑ i, w i = Nat.card A)
(hbound : ∀ i, w i ≤ Nat.card {a : A // f a = p i}) :
Bijective p ∧ ∀ i, Nat.card {a : A // f a = p i} = w i := by sorrySource
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.