From the vanishing premise: an obstruction subgroup with sections , , and an ideal satisfying the box and height conditions and Wüstholz's vanishing
ProvedDiazModulus.exists_obstructionLet 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 , (torusTransl g) is the algebra map , , , so that takes at the value of at . 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 , a subspace , and , obstructionSpan P W u a m n S is the span of the with , and a list of elements of of length at most . Put . 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 , a subspace, , , and assume that vanishes at for every list of elements of of length at most and every with . Let , in the box boxD A₀ A₁ D₀ D₁ and . Then there are , an ideal , a subgroup of , , , , and subspaces , such that: the cosets of are comaximal ( when ); , are coordinate sections of (as in DiazModulus.linearIndependent_on_subgroup); and ; ; , and ; and, with and as follows, For an ideal , = obstructionSpan P W u a (r M₁) (r M₀) (torusZero 𝔭) and . lies in the box boxD A₀ A₁ D₀ D₁, every prime has , and vanishOrd (I(Σ · Γ)) W M₀. 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_chain_prime gives and ; is the stabiliser (DiazModulus.torusStab_subgroup), and DiazModulus.exists_coordinate_section_add and DiazModulus.exists_coordinate_section_mul give and with . The section ideal vanishes on , so DiazModulus.le_height_obstruction gives the heights and DiazModulus.obstructionSpan_vanishOrd the box and the vanishing. Properness: if and were everything, the reduced form of (, non-empty by DiazModulus.torusVanishing_torusZero; DiazModulus.torus_reduce_mem_restrictSupport, DiazModulus.torusTransl_algEquiv) would vanish on , hence be by DiazModulus.linearIndependent_on_subgroup, forcing .
Novelty. None claimed: the obstruction subgroup 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 exists_obstruction {A₀ A₁ B₁ : Type*} [Fintype A₀] [Fintype A₁] [Fintype B₁] (D₀ D₁ : ℕ) (P : MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ)
(hPbox : P ∈ torusBox ℂ A₀ A₁ (boxD A₀ A₁ D₀ D₁)) (hP0 : P ∉ torusIdeal ℂ A₀ A₁) (W : Submodule ℂ ((A₀ → ℂ) × (A₁ → ℂ)))
(u : B₁ → A₀ → ℂ) (a : B₁ → A₁ → ℂˣ) (M₀ M₁ : ℕ)
(hvan : ∀ l : List ((A₀ → ℂ) × (A₁ → ℂ)), l.length ≤ (Fintype.card A₀ + Fintype.card A₁) * M₀ → (∀ w ∈ l, w ∈ W) →
∀ s : B₁ → ℤ, (∀ b, |s b| ≤ (((Fintype.card A₀ + Fintype.card A₁) * M₁ : ℕ) : ℤ)) →
MvPolynomial.eval (torusPt (hmePoint u a s)) (torusDerivList l P) = 0) :
∃ (r : ℕ) (𝔭 : Ideal (MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ)) (Γ : Subgroup (TorusGroup ℂ A₀ A₁)) (H : Finset A₀) (J : Finset A₁) (ℓ : A₀ → A₀ → ℂ)
(ψ : A₁ → A₁ → ℤ) (V : Submodule ℂ (A₀ → ℂ)) (L : Submodule ℂ (A₁ → ℂ)),
(∀ g g' : TorusGroup ℂ A₀ A₁, g * g'⁻¹ ∉ Γ →
torusVanishing {z | z * g ∈ Γ} ⊔ torusVanishing {z | z * g' ∈ Γ} = ⊤) ∧
(∀ x : A₀ → ℂ, ∃ v ∈ Submodule.span ℂ {v | ∃ g ∈ Γ, Multiplicative.toAdd g.1 = v}, ∀ h ∈ H, v h = x h) ∧ (∀ φ : A₁ → ℤ, (∀ i ∉ J, φ i = 0) → (∀ g ∈ Γ, ∏ i, g.2 i ^ φ i = 1) → φ = 0) ∧
(∀ v, v ∈ V ↔ ∀ h, ∑ h', ℓ h h' * v h' = 0) ∧ (∀ v, v ∈ L ↔ ∀ i, ∑ i', (ψ i i' : ℂ) * v i' = 0) ∧ (Γ : Set (TorusGroup ℂ A₀ A₁)) ⊆ standardSet V ψ ∧
Module.finrank ℂ ↥V = H.card ∧ Module.finrank ℂ ↥L = J.card ∧ Module.finrank ℂ ↥V + Module.finrank ℂ ↥L < (Fintype.card A₀ + Fintype.card A₁) ∧
obstructionSpan P W u a (r * M₁) (r * M₀) (torusZero 𝔭) ≤ torusBox ℂ A₀ A₁ (boxD A₀ A₁ D₀ D₁) ∧
(∀ p : Ideal (MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ), p.IsPrime → torusIdeal ℂ A₀ A₁ ⊔ Ideal.span (obstructionSpan P W u a (r * M₁) (r * M₀) (torusZero 𝔭) : Set (MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ)) ≤ p →
((Fintype.card A₁ + ((Fintype.card A₀ + Fintype.card A₁) - (Module.finrank ℂ ↥V + Module.finrank ℂ ↥L)) : ℕ) : ℕ∞) ≤ p.height) ∧
((torusIdeal ℂ A₀ A₁ ⊔ Ideal.span (obstructionSpan P W u a (r * M₁) (r * M₀) (torusZero 𝔭) : Set (MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ)) : Ideal (MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ)) : Set (MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ)) ⊆ vanishOrd (torusVanishing {z | ∃ s : B₁ → ℤ, (∀ b, |s b| ≤ (M₁ : ℤ)) ∧ ∃ γ ∈ Γ, z = hmePoint u a s * γ}) W M₀ := by
sorry
end DiazModulus