introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
10.3 kB
import OAI.AlgebraicGeometry.ComplexGroups.HolomorphicAlgebraicity.PolynomialGrowth
import OAI.AlgebraicGeometry.ComplexGroups.HolomorphicAlgebraicity.HomogeneousExtension
import Mathlib.Analysis.Analytic.IsolatedZeros
import Mathlib.Topology.Compactness.Lindelof
import Mathlib.Analysis.Calculus.Deriv.Polynomial
/-! # Branch Extension -/
namespace OAI.AlgebraicGeometry.ComplexGroups.HolomorphicAlgebraicity.BranchExtension.Constructions.Growth
noncomputable section
/-!
# Polynomial extension across exceptional sets of projection coefficients
Continuity and polynomial growth let interpolation extend from a dense family
of holomorphic affine lines to all lines. Countable exceptional sets on each
line are removable by the Cauchy integral theorem.
-/
open Set Filter _root_.Metric
open scoped _root_.Topology BigOperators
/-- Countably many exceptional points are removable for a continuous complex
function which is holomorphic at every other point. -/
theorem differentiable_of_continuous_off_countable {f : β„‚ β†’ β„‚} {S : Set β„‚}
(hf : Continuous f) (hS : S.Countable)
(hd : βˆ€ z, z βˆ‰ S β†’ DifferentiableAt β„‚ f z) : Differentiable β„‚ f := by
intro z
exact (Complex.hasFPowerSeriesOnBall_of_differentiable_off_countable (R := 1)
hS hf.continuousOn (fun w hw => hd w hw.2) zero_lt_one).analyticAt.differentiableAt
/-- Polynomial growth is preserved on every affine complex line. -/
theorem growth_affineLine {n d : β„•} {f : (Fin n β†’ β„‚) β†’ β„‚} {C : ℝ}
(hC : 0 ≀ C) (hbound : βˆ€ z, β€–f zβ€– ≀ C * (max 1 β€–zβ€–) ^ d)
(x v : Fin n β†’ β„‚) (c : β„‚) :
β€–f (x + c β€’ v)β€– ≀
(C * (max 1 β€–xβ€– + max 1 β€–vβ€–) ^ d) * (max 1 β€–cβ€–) ^ d := by
have hx : 0 ≀ max 1 β€–xβ€– := le_trans zero_le_one (le_max_left _ _)
have hv : 0 ≀ max 1 β€–vβ€– := le_trans zero_le_one (le_max_left _ _)
have hc : 1 ≀ max 1 β€–cβ€– := le_max_left _ _
have hnorm : β€–x + c β€’ vβ€– ≀ (max 1 β€–xβ€– + max 1 β€–vβ€–) * max 1 β€–cβ€– := by
calc
_ ≀ β€–xβ€– + β€–cβ€– * β€–vβ€– := by simpa only [norm_smul] using norm_add_le x (c β€’ v)
_ ≀ max 1 β€–xβ€– + max 1 β€–cβ€– * max 1 β€–vβ€– := by gcongr <;> exact le_max_right _ _
_ ≀ _ := by nlinarith
have hmax : max 1 β€–x + c β€’ vβ€– ≀ (max 1 β€–xβ€– + max 1 β€–vβ€–) * max 1 β€–cβ€– := by
apply max_le _ hnorm
have hx1 : 1 ≀ max 1 β€–xβ€– := le_max_left _ _
nlinarith
calc
_ ≀ C * max 1 β€–x + c β€’ vβ€– ^ d := hbound _
_ ≀ C * ((max 1 β€–xβ€– + max 1 β€–vβ€–) * max 1 β€–cβ€–) ^ d := by gcongr
_ = _ := by rw [mul_pow, mul_assoc]
/-- With a common polynomial-growth bound, interpolation and continuity
extend holomorphy from dense translates of each line to every translate. -/
theorem line_differentiable_of_dense_lines {n d : β„•} {f : (Fin n β†’ β„‚) β†’ β„‚} {C : ℝ}
(hf : Continuous f) (hbound : βˆ€ z, β€–f zβ€– ≀ C * (max 1 β€–zβ€–) ^ d)
(hdense : βˆ€ v : Fin n β†’ β„‚,
Dense {x | Differentiable β„‚ (fun c : β„‚ => f (x + c β€’ v))})
(x v : Fin n β†’ β„‚) : Differentiable β„‚ (fun c : β„‚ => f (x + c β€’ v)) := by
have hC : 0 ≀ C := by
have h := hbound 0
simp only [norm_zero, max_eq_left zero_le_one, one_pow, mul_one] at h
exact (norm_nonneg _).trans h
have hinterp (c : β„‚) : f (x + c β€’ v) =
βˆ‘ i : Fin (d + 1), f (x + PolynomialGrowth.Constructions.Growth.node d i β€’ v) * (PolynomialGrowth.Constructions.Growth.cardinalBasis d i).eval c := by
apply (hdense v).induction (P := fun y => f (y + c β€’ v) =
βˆ‘ i : Fin (d + 1), f (y + PolynomialGrowth.Constructions.Growth.node d i β€’ v) * (PolynomialGrowth.Constructions.Growth.cardinalBasis d i).eval c) ?_ ?_ x
Β· intro y hy
obtain ⟨p, hpdeg, hp⟩ := PolynomialGrowth.Constructions.Growth.exists_polynomial_of_growth hy
(growth_affineLine hC hbound y v)
simpa only [hp] using PolynomialGrowth.Constructions.Growth.interpolation_formula p hpdeg c
Β· apply isClosed_eq (hf.comp (continuous_id.add continuous_const))
apply continuous_finsetSum
intro i _
exact (hf.comp (continuous_id.add continuous_const)).mul continuous_const
have heq : (fun c : β„‚ => f (x + c β€’ v)) =
(fun c => βˆ‘ i : Fin (d + 1), f (x + PolynomialGrowth.Constructions.Growth.node d i β€’ v) * (PolynomialGrowth.Constructions.Growth.cardinalBasis d i).eval c) :=
funext hinterp
rw [heq]
apply Differentiable.fun_sum
intro i _
exact (PolynomialGrowth.Constructions.Growth.cardinalBasis d i).differentiable.const_mul _
/-- A continuous function of polynomial growth which is holomorphic on a
dense family of translates of every line is an actual polynomial. -/
theorem exists_polynomial_of_dense_lines {n d : β„•} {f : (Fin n β†’ β„‚) β†’ β„‚} {C : ℝ}
(hf : Continuous f) (hbound : βˆ€ z, β€–f zβ€– ≀ C * (max 1 β€–zβ€–) ^ d)
(hdense : βˆ€ v : Fin n β†’ β„‚,
Dense {x | Differentiable β„‚ (fun c : β„‚ => f (x + c β€’ v))}) :
βˆƒ P : MvPolynomial (Fin n) β„‚, βˆ€ x, MvPolynomial.eval x P = f x :=
PolynomialGrowth.Constructions.Growth.exists_mvPolynomial_of_line_growth n
(line_differentiable_of_dense_lines hf hbound hdense) hbound
/-- A nonzero entire function of one complex variable has only countably
many zeros. -/
theorem countable_zeroSet_of_entire {g : β„‚ β†’ β„‚}
(hg : Differentiable β„‚ g) (hne : βˆƒ z, g z β‰  0) : {z | g z = 0}.Countable := by
apply (HereditarilyLindelofSpace.isLindelof _).countable_of_isDiscrete
apply isDiscrete_iff_nhdsNE.mpr
intro x _
by_contra hbot
have hfreq : βˆƒαΆ  z in 𝓝[β‰ ] x, g z = 0 := frequently_iff_neBot.mpr ⟨hbot⟩
have hga : AnalyticOnNhd β„‚ g univ := fun z _ => hg.analyticAt z
have heq := hga.eqOn_zero_of_preconnected_of_frequently_eq_zero
isPreconnected_univ (mem_univ x) hfreq
obtain ⟨z, hz⟩ := hne
exact hz (heq (mem_univ z))
/-- Continuous polynomial-growth functions extend across a zero set whose
defining function is holomorphic on every affine line and nonzero densely. -/
theorem exists_polynomial_off_zeroSet {n d : β„•} {f g : (Fin n β†’ β„‚) β†’ β„‚} {C : ℝ}
(hf : Continuous f) (hbound : βˆ€ z, β€–f zβ€– ≀ C * (max 1 β€–zβ€–) ^ d)
(hg : βˆ€ x v, Differentiable β„‚ (fun c : β„‚ => g (x + c β€’ v)))
(hdense : Dense {x | g x β‰  0})
(hd : βˆ€ x, g x β‰  0 β†’ DifferentiableAt β„‚ f x) :
βˆƒ P : MvPolynomial (Fin n) β„‚, βˆ€ x, MvPolynomial.eval x P = f x := by
apply exists_polynomial_of_dense_lines hf hbound
intro v
apply hdense.mono
intro x hx
change g x β‰  0 at hx
have hline : Differentiable β„‚ (fun c : β„‚ => x + c β€’ v) :=
(differentiable_const x).add (differentiable_id.smul_const v)
apply differentiable_of_continuous_off_countable (hf.comp hline.continuous)
(countable_zeroSet_of_entire (hg x v) ⟨0, by simpa only [zero_smul, add_zero] using hx⟩)
intro c hc
exact (hd (x + c β€’ v) hc).comp c (hline c)
/-- A function holomorphic on every affine line and nonzero somewhere is
nonzero on a dense set. -/
theorem dense_nonzero_of_line_holomorphic {n : β„•} {g : (Fin n β†’ β„‚) β†’ β„‚}
(hg : βˆ€ x v, Differentiable β„‚ (fun c : β„‚ => g (x + c β€’ v)))
(hne : βˆƒ z, g z β‰  0) : Dense {x | g x β‰  0} := by
apply dense_iff_inter_open.mpr
intro U hU hUne
obtain ⟨x, hx⟩ := hUne
obtain ⟨z, hz⟩ := hne
by_contra hno
have hzeroU : βˆ€ y ∈ U, g y = 0 := by
intro y hy
by_contra hgy
exact hno ⟨y, hy, hgy⟩
have hline : Differentiable β„‚ (fun c : β„‚ => x + c β€’ (z - x)) :=
(differentiable_const x).add (differentiable_id.smul_const (z - x))
have hUline : (fun c : β„‚ => x + c β€’ (z - x)) ⁻¹' U ∈ 𝓝 0 :=
(hU.preimage hline.continuous).mem_nhds (by
simpa only [mem_preimage, zero_smul, add_zero] using hx)
have hzero : βˆ€αΆ  c : β„‚ in 𝓝 0, g (x + c β€’ (z - x)) = 0 := by
filter_upwards [hUline] with c hc
exact hzeroU _ hc
have hga : AnalyticOnNhd β„‚ (fun c : β„‚ => g (x + c β€’ (z - x))) univ :=
fun c _ => (hg x (z - x)).analyticAt c
have heq := hga.eqOn_zero_of_preconnected_of_frequently_eq_zero
isPreconnected_univ (mem_univ 0) (hzero.filter_mono nhdsWithin_le_nhds).frequently
apply hz
have hxz : x + (z - x) = z := by abel
simpa only [one_smul, hxz, Pi.zero_apply] using heq (mem_univ (1 : β„‚))
/-- A continuous polynomial-growth function holomorphic off the zero locus
of a nonzero entire function is polynomial, including across that zero locus. -/
theorem exists_polynomial_off_entire_zeroSet {n d : β„•}
{f g : (Fin n β†’ β„‚) β†’ β„‚} {C : ℝ}
(hf : Continuous f) (hbound : βˆ€ z, β€–f zβ€– ≀ C * (max 1 β€–zβ€–) ^ d)
(hg : Differentiable β„‚ g) (hne : βˆƒ z, g z β‰  0)
(hd : βˆ€ x, g x β‰  0 β†’ DifferentiableAt β„‚ f x) :
βˆƒ P : MvPolynomial (Fin n) β„‚, βˆ€ x, MvPolynomial.eval x P = f x := by
have hline (x v : Fin n β†’ β„‚) : Differentiable β„‚ (fun c : β„‚ => g (x + c β€’ v)) :=
hg.comp ((differentiable_const x).add (differentiable_id.smul_const v))
exact exists_polynomial_off_zeroSet hf hbound hline
(dense_nonzero_of_line_holomorphic hline hne) hd
/-- Homogeneous continuous coefficients which are holomorphic away from an
entire branch equation extend as homogeneous polynomials of the same degree. -/
theorem exists_homogeneousPolynomial_off_entire_zeroSet {n d : β„•}
{f g : (Fin n β†’ β„‚) β†’ β„‚} (hd : 0 < d)
(hf : Continuous f) (hhom : βˆ€ (c : β„‚) x, f (c β€’ x) = c ^ d * f x)
(hg : Differentiable β„‚ g) (hne : βˆƒ z, g z β‰  0)
(hfdiff : βˆ€ x, g x β‰  0 β†’ DifferentiableAt β„‚ f x) :
βˆƒ P : MvPolynomial (Fin n) β„‚,
P.IsHomogeneous d ∧ βˆ€ x, MvPolynomial.eval x P = f x := by
obtain ⟨C, _, hbound⟩ := HomogeneousExtension.Constructions.Growth.polynomial_growth_of_homogeneous hd hf.continuousOn hhom
obtain ⟨P, hP⟩ := exists_polynomial_off_entire_zeroSet hf hbound hg hne hfdiff
have heq := HomogeneousExtension.Constructions.Growth.homogeneousComponent_eq_of_eval_smul P (by simpa only [hP] using hhom)
refine ⟨P, ?_, hP⟩
rw [← heq]
exact MvPolynomial.homogeneousComponent_isHomogeneous d P
end
end OAI.AlgebraicGeometry.ComplexGroups.HolomorphicAlgebraicity.BranchExtension.Constructions.Growth