Integral-closure certificates, powered systems and algebraic branches
DefinitionAPSCounting893_Main_Supplement_CertificatesFor a field , a tuple and a target in , introduce an independent variable and set . A certificate satisfies
The first equality is a polynomial identity in ; the second is a polynomial identity in all . The complex annihilator is the published substitution kernel with its outputs reindexed. Put and , where is the transcendence degree of the generated fraction field. Define . Zero polynomials have total degree zero and .
For the boundedness criterion, algebraic branches of are realized inside the published Puiseux ambient field: a branch is a Puiseux series satisfying a nonzero polynomial in . This is the algebraic part of the Puiseux closure, with unrestricted ramification. Its valuation is the series order, including . These constructions define the actual polynomial objects used by the certificate and reduction theorems.
import Definitions.Def_APSCounting893_Main_Supplement_Integrality
set_option autoImplicit false
namespace APSCounting893.Main.Supplement
/-- Output variables are Y indexed by Fin m, followed by U and V indexed by Fin 2. -/
abbrev Certificate (K : Type) [CommSemiring K] (m : ℕ) :=
MvPolynomial (Fin m ⊕ Fin 2) K
noncomputable def phiSystem {K : Type} [Field K] {n m : ℕ}
(F : PolynomialMap K n m) (f : Polynomials K n) : PolynomialMap K (n + 1) (m + 2) :=
Fin.addCases (fun i => extendPolynomial (F i))
(fun j : Fin 2 => if j = 0 then freshVariable n
else 1 - freshVariable n * extendPolynomial f)
/-- Substitution in the full polynomial ring, with u independent of x. -/
noncomputable def certificateSubstitute {K : Type} [Field K] {n m : ℕ}
(F : PolynomialMap K n m) (f : Polynomials K n) :
Certificate K m →+* Polynomials K (n + 1) :=
MvPolynomial.eval₂Hom MvPolynomial.C
(Sum.elim (fun i => extendPolynomial (F i))
(fun j : Fin 2 => if j = 0 then freshVariable n
else 1 - freshVariable n * extendPolynomial f))
/-- Restriction to U=V=0 is a polynomial in every Y coordinate. -/
noncomputable def certificateSlice {K : Type} [Field K] {m : ℕ} :
Certificate K m →+* Polynomials K m :=
MvPolynomial.eval₂Hom MvPolynomial.C (Sum.elim MvPolynomial.X (fun _ => 0))
noncomputable def certificateAt {K : Type} [Field K] {m : ℕ}
(c : Affine K m) (Q : Certificate K m) : K :=
MvPolynomial.eval (Sum.elim c (fun _ => 0)) Q
/-- Reuse the published complex annihilator through the canonical output reindexing. -/
noncomputable def certificateAnnihilates {n m : ℕ} (F : PolynomialMap ℂ n m)
(f : Polynomials ℂ n) (Q : Certificate ℂ m) : Prop :=
MvPolynomial.rename (Sum.elim (fun i : Fin m => i.castAdd 2)
(fun j : Fin 2 => j.natAdd m)) Q ∈ annihilator (phiSystem F f)
def GlobalCertificate {K : Type} [Field K] {n m : ℕ}
(F : PolynomialMap K n m) (f : Polynomials K n) (Q : Certificate K m) : Prop :=
certificateSubstitute F f Q = 0 ∧ certificateSlice Q = 1
noncomputable def certificateDelta {K : Type} [Field K] {n m : ℕ}
(F : PolynomialMap K n m) (f : Polynomials K n) : ℕ :=
max (Finset.univ.sup (fun i => (F i).totalDegree)) (f.totalDegree + 1)
noncomputable def certificateBound {K : Type} [Field K] {n m : ℕ}
(F : PolynomialMap K n m) (f : Polynomials K n) : ℕ :=
(generatorRank F + 2) * certificateDelta F f ^ (generatorRank F + 1)
/-- The power is on each generator, before multiplication by u. -/
noncomputable def poweredSystem {K : Type} [Field K] {n m : ℕ}
(F : PolynomialMap K n m) (f : Polynomials K n) (M : ℕ) :
PolynomialMap K (n + 1) (m + 2) :=
Fin.addCases (fun i => freshVariable n * extendPolynomial (F i) ^ M)
(fun j : Fin 2 => if j = 0 then freshVariable n
else 1 - freshVariable n * extendPolynomial f)
/-- Algebraic branches of C(t) in a fixed Puiseux algebraic closure. The polynomial relation
has coefficients in C[t] and is nonzero as a polynomial before specialization. Clearing
rational-function denominators loses no algebraic branch. -/
def IsAlgebraicBranch (s : PuiseuxAmbient) : Prop :=
IsPuiseux s ∧ ∃ p : Polynomial (Polynomial ℂ), p ≠ 0 ∧
Polynomial.eval₂
(Polynomial.eval₂RingHom HahnSeries.C (HahnSeries.single (1 : ℚ) (1 : ℂ))) s p = 0
end APSCounting893.Main.Supplement