The lower side of the multiplicity estimate: for every
ProvedDiazModulus.hlow_le_boxHilbLet be finite types and the polynomial ring MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ in the variables (), and (), and its torus ideal (torusIdeal). Write (TorusGroup: pairs , in the additive group , , written multiplicatively), and say that a polynomial vanishes at when it vanishes at the point (torusPt g). For , (torusDeriv w) is the invariant derivation of (DALAG Lemma 8.11), and (torusDerivList l) for a list . For , (torusVanishing S) is the ideal of the polynomials vanishing at every point of ; for an ideal , (torusZero 𝔟) is the set of at which every element of vanishes. For , (, , finite) and , (hmePoint u a s). For an ideal and a subspace , vanishOrd J W t is the set of with for every list of elements of of length at most (vanishing to order along relative to ). for . For a subspace and integer rows , standardSet V ψ is , the subgroup . Let be a subgroup of . The cosets of are comaximal: whenever , where . has coordinate sections , : every agrees on with some element of the complex span of , and the only vanishing off with for every is . Let , , , , with , and ; let be a subspace and with ; let and an ideal with vanishOrd (I(Σ · Γ)) W M₀. Let and a finite set of with , pairwise incongruent modulo (, are congruent when and for every ). Then there is such that, with and = boxD A₀ A₁ D₀ D₁, for every . For , torusBox _ A₀ A₁ T is the span of the monomials of degree at most in and at most in the pair , and (boxHilb (torusBox ℂ A₀ A₁) I T) is the dimension of the image of that box in . The names TorusGroup, torusPt, torusDeriv, torusDerivList, torusTransl, torusVanishing, torusZero, torusStab, standardSet, sectionIdeal, vanishOrd, hmePoint and obstructionSpan come from the Definition DiazMultiplicity (module Definitions.Def_DiazMultiplicity), which builds on the published Definition DiazHilbertBox (torusIdeal, torusBox, boxHilb, boxD, torusCoeffPoly, torusReduced, torusPoint).
Proof. DiazModulus.exists_tangent_dual and DiazModulus.exists_tangent_dual_cosets give the dual pairs on , and DiazModulus.wustholz_le_boxHilb gives . Incongruent give distinct cosets , whose ideals (DiazModulus.torusTransl_algEquiv) are comaximal: DiazModulus.exists_card_mul_boxHilb_le_translates and DiazModulus.boxHilb_anti bound by . Finally DiazModulus.le_boxHilb_torusVanishing_subgroup and DiazModulus.box_ray_lower_bound bound below.
Novelty. None claimed: the lower bound of §8.4.1 of DALAG, Chapter 8 (by D. Roy), written at finite level and in coordinates; routine formalisation.
import Definitions.Def_DiazMultiplicity
namespace DiazModulus
theorem hlow_le_boxHilb {A₀ A₁ B₁ : Type*} [Fintype A₀] [Fintype A₁] [Fintype B₁] (Γ : Subgroup (TorusGroup ℂ A₀ A₁))
(hcop : ∀ g g' : TorusGroup ℂ A₀ A₁, g * g'⁻¹ ∉ Γ →
torusVanishing {z | z * g ∈ Γ} ⊔ torusVanishing {z | z * g' ∈ Γ} = ⊤)
(H : Finset A₀) (J : Finset A₁) (hH : ∀ x : A₀ → ℂ, ∃ v ∈ Submodule.span ℂ {v | ∃ g ∈ Γ, Multiplicative.toAdd g.1 = v}, ∀ h ∈ H, v h = x h)
(hJ : ∀ φ : A₁ → ℤ, (∀ i ∉ J, φ i = 0) → (∀ g ∈ Γ, ∏ i, g.2 i ^ φ i = 1) → φ = 0)
(ℓ : A₀ → A₀ → ℂ) (ψ : A₁ → A₁ → ℤ) (V : Submodule ℂ (A₀ → ℂ)) (L : Submodule ℂ (A₁ → ℂ))
(hV : ∀ v, v ∈ V ↔ ∀ h, ∑ h', ℓ h h' * v h' = 0) (hL : ∀ v, v ∈ L ↔ ∀ i, ∑ i', (ψ i i' : ℂ) * v i' = 0)
(hΓ : (Γ : Set (TorusGroup ℂ A₀ A₁)) ⊆ standardSet V ψ) (hVH : Module.finrank ℂ ↥V = H.card) (hLJ : Module.finrank ℂ ↥L = J.card)
(W : Submodule ℂ ((A₀ → ℂ) × (A₁ → ℂ))) (n : ℕ) (hn : n + Module.finrank ℂ ↥(W ⊓ V.prod L) = Module.finrank ℂ ↥W)
(u : B₁ → A₀ → ℂ) (a : B₁ → A₁ → ℂˣ) (M₀ M₁ : ℕ) (A : Ideal (MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ))
(hA : (A : Set (MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ)) ⊆ vanishOrd (torusVanishing {z | ∃ s : B₁ → ℤ, (∀ b, |s b| ≤ (M₁ : ℤ)) ∧ ∃ γ ∈ Γ, z = hmePoint u a s * γ}) W M₀) (D₀ D₁ : ℕ) (Rₑ : Finset (B₁ → ℤ))
(hR : ∀ s ∈ Rₑ, ∀ b, |s b| ≤ (M₁ : ℤ))
(hRinc : ∀ s ∈ Rₑ, ∀ s' ∈ Rₑ, ((∑ b, ((s b - s' b : ℤ) : ℂ) • u b) ∈ V ∧
∀ k, ∏ i, (∏ b, a b i ^ (s b - s' b)) ^ ψ k i = 1) → s = s') :
∃ C : A₀ ⊕ A₁ → ℕ, ∀ t : ℕ, 1 ≤ t →
(M₀ + n).choose n * Rₑ.card * D₀ ^ Module.finrank ℂ ↥V * D₁ ^ Module.finrank ℂ ↥L * t ^ ((Fintype.card A₀ + Fintype.card A₁) - ((Fintype.card A₀ + Fintype.card A₁) - (Module.finrank ℂ ↥V + Module.finrank ℂ ↥L)))
≤ boxHilb (torusBox ℂ A₀ A₁) A (t • boxD A₀ A₁ D₀ D₁ + C) := by
sorry
end DiazModulus