Lemma 8.15 at finite level: dual pairs on a subgroup with comaximal cosets extend to the finite union of cosets , inside a box
ProvedDiazModulus.exists_tangent_dual_cosetsLet 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 , 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 . Let be a subgroup of . The cosets of are comaximal: whenever , where . for . Let , and with . Then there are and with every in the box , and . 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. lies in finitely many cosets of , whose ideals are pairwise comaximal; the Chinese remainder theorem gives on the coset and on the others. Put ; Leibniz and DiazModulus.torusDeriv_torusTransl give the congruences, and DiazModulus.restrictSupport_block_filtration a box.
Novelty. None claimed: Lemma 8.15 of DALAG, Chapter 8 (by D. Roy), written at finite level and in coordinates; routine formalisation.
import Definitions.Def_DiazMultiplicity
namespace DiazModulus
theorem exists_tangent_dual_cosets {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' ∈ Γ} = ⊤)
(u : B₁ → A₀ → ℂ) (a : B₁ → A₁ → ℂˣ) (M₁ n : ℕ) (w : Fin n → (A₀ → ℂ) × (A₁ → ℂ)) (P : Fin n → (MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ))
(hP : ∀ j, P j ∈ torusVanishing (Γ : Set (TorusGroup ℂ A₀ A₁)))
(hwP : ∀ i j, torusDeriv (w i) (P j) - (if i = j then 1 else 0) ∈ torusVanishing (Γ : Set (TorusGroup ℂ A₀ A₁))) :
∃ (Q : Fin n → (MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ)) (CQ : A₀ ⊕ A₁ → ℕ), (∀ j, Q j ∈ torusBox ℂ A₀ A₁ CQ) ∧
(∀ j, Q j ∈ torusVanishing {z | ∃ s : B₁ → ℤ, (∀ b, |s b| ≤ (M₁ : ℤ)) ∧ ∃ γ ∈ Γ, z = hmePoint u a s * γ}) ∧
∀ i j, torusDeriv (w i) (Q j) - (if i = j then 1 else 0) ∈ torusVanishing {z | ∃ s : B₁ → ℤ, (∀ b, |s b| ≤ (M₁ : ℤ)) ∧ ∃ γ ∈ Γ, z = hmePoint u a s * γ} := by
sorry
end DiazModulus