Surjective reindexing preserves bounded pencil certificates
ProvedTranscendenceTheory.surjective_partitioned_pencil_boundsalgebraelliptic-functionspolynomials
Let R be an integral domain of characteristic zero, let I and J be finite sets, and let
be surjective. Let F belong to R[T][Y], assume every coefficient of F as a polynomial in Y has T-degree at most a, and fix families c and d from J to R. For K=J use the given families; for K=I pull them back along pi. Write
Define the bounded certificate
Then
Thus a surjective reindexing can remove repeated entries from a nonvanishing certificate while reducing both integer bounds to the corresponding counts in the smaller index set. The integers may be reselected in the forward direction. The theorem does not equate the numerical values of the two products. Empty sets, empty parts of the zero/nonzero partition, repeated values, and a=0 are included.
Preamble
import Mathlib.Algebra.Polynomial.Bivariate import Mathlib.Algebra.Polynomial.Degree.Lemmas import Mathlib.Data.Fintype.Card open scoped Classical
Formal statement
theorem TranscendenceTheory.surjective_partitioned_pencil_bounds
(R : Type*) [CommRing R] [IsDomain R] [CharZero R]
(ι κ : Type*) [Fintype ι] [Fintype κ]
(π : ι → κ) (hπ : Function.Surjective π)
(F : Polynomial (Polynomial R)) (a : ℕ)
(hdegree : ∀ j, (F.coeff j).natDegree ≤ a) (c d : κ → R) :
(∃ t : Fin (Fintype.card {i : ι // d (π i) = 0} * a + 1),
∃ k : Fin (Fintype.card {i : ι // d (π i) ≠ 0} + 1),
(∏ i, ((F.map (Polynomial.evalRingHom (t.val : R))).eval (c (π i)) +
(k.val : R) * d (π i))) ≠ 0) ↔
(∃ t : Fin (Fintype.card {j : κ // d j = 0} * a + 1),
∃ k : Fin (Fintype.card {j : κ // d j ≠ 0} + 1),
(∏ j, ((F.map (Polynomial.evalRingHom (t.val : R))).eval (c j) +
(k.val : R) * d j)) ≠ 0) := by sorrySource
Derived surjective-reindexing theorem for bounded polynomial pencil certificates, and equivalent reduction of https://prove2.me/theorems/e515f1b6-6149-4f08-bd4c-64b27d108fd8. Reuses complete platform theorems bounded_bivariate_specialization (aa9fdd40-d30b-4f1e-aa4e-241e9f3bd925) and bounded_finite_pencil_nonvanishing (a4d2e3a6-7cf0-4761-9c5b-829b25bf7f3e). Primary Mathlib source at revision 0df444a360eaa60ab8c11dca51a86af692955474: Fintype.card_le_of_surjective in https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/Data/Fintype/Card.lean. Mission context: Senthil Kumar K (2026), Algebraic independence of values of Weierstrass elliptic and zeta functions, Appendix A.2, Theorem A.3 and Proposition A.1, https://doi.org/10.1017/S001309152610145X. This refinement is derived here, not a verbatim theorem from the paper.