Th. 11.21 Step 6: the multiplicity estimate gives with
ProvedDiazModulus.obstruction_1123Points are for finite index sets . For and a weight vector on , is the operator on polynomials in the (), and for vectors () and , (the factors commute). For the columns are the with and ; there are of them. Given and (, ), the entry at a row datum (, , ) and a column is .
The hypothesis hME : MultiplicityEstimateElem is the published definition MultiplicityEstimateElem (DiazModulus.MultiplicityEstimateElem, module Definitions.Def_MultiplicityEstimateElem), a proposition that is assumed here, not proved. It is an elementary form of Philippon's multiplicity estimate: the case , of DALAG Th. 8.1 (§8.1) for , written in coordinates. It says: let be finite, , (), and non-zero (, ), , , and a vector on the box of the with and . If for every , every and every with (the entries are those defined above, with for and for ), then there are a subspace , integer vectors with common complex kernel , and with , the span of the , such that and every set of vectors with , pairwise incongruent modulo , has , with ; two vectors are congruent modulo when and for every .
Let (), and non-zero () be given, , , , and a vector on the columns with for every , every and every with . Assume hME. Then there are , with common complex kernel , and with ( the span of the ) and , such that , where , the relation rank is the dimension of the -span of the set of congruent to modulo , two vectors are congruent modulo when and for every , and is as in hME with , .
Proof. Apply hME to at ; its premise is the hypothesis on . It gives and a bound for every set of pairwise incongruent vectors in the box . By DiazModulus.exists_coord_complement the -span of the vectors congruent to has a coordinate complement with . Take for the box on (zero off ): it has points, and two of its points that are congruent differ by a vector of that span supported on , hence are equal. Finally , and multiplying the bound by concludes.
Novelty. Classical; routine formalisation. Step 6 of the proof of DALAG Th. 11.21, which obtains (11.23) from the multiplicity estimate; here the multiplicity estimate is the hypothesis hME.
import Definitions.Def_DiazModulus import Definitions.Def_MultiplicityEstimateElem
open Complex ComplexConjugate
namespace DiazModulus
theorem obstruction_1123 (hME : MultiplicityEstimateElem)
{ι₀ ι₁ κ₀ κ₁ : Type} [Fintype ι₀] [Fintype ι₁] [Fintype κ₀] [Fintype κ₁]
[DecidableEq ι₀] [DecidableEq ι₁]
(w : κ₀ → (ι₀ → ℂ) × (ι₁ → ℂ)) (u : κ₁ → ι₀ → ℂ) (a : κ₁ → ι₁ → ℂ) (T₀ T₁ S₀ S₁ : ℕ)
(c : (ι₀ → Fin (T₀ + 1)) × (ι₁ → Fin (2 * T₁ + 1)) → ℂ) (hT₀ : 1 ≤ T₀) (hT₁ : 1 ≤ T₁) (ha : ∀ j i, a j i ≠ 0) (hc : c ≠ 0)
(hvan : ∀ (rₑ : ℕ) (kₑ : Fin rₑ → κ₀) (sₑ : κ₁ → ℤ), rₑ ≤ (Fintype.card ι₀ + Fintype.card ι₁) * S₀ → (∀ j, |sₑ j| ≤ (((Fintype.card ι₀ + Fintype.card ι₁) * S₁ : ℕ) : ℤ)) →
∑ l, c l * (MvPolynomial.eval (∑ j, ((sₑ j : ℤ) : ℂ) • u j)
((List.ofFn fun k : Fin rₑ =>
((∑ h, (w (kₑ k)).1 h • (MvPolynomial.pderiv h).toLinearMap
+ (∑ i, (w (kₑ k)).2 i * (((l.2 i : ℕ) : ℂ) - T₁)) • LinearMap.id :
Module.End ℂ (MvPolynomial ι₀ ℂ)))).prod
(∏ h, MvPolynomial.X h ^ (l.1 h : ℕ)))
* ∏ i, (∏ j, a j i ^ sₑ j) ^ (((l.2 i : ℕ) : ℤ) - T₁)) = 0) :
∃ (V : Submodule ℂ (ι₀ → ℂ)) (q : ℕ) (φ : Fin q → ι₁ → ℤ) (L₁ : Submodule ℂ (ι₁ → ℂ)) (ℓ : ℕ),
(∀ v, v ∈ L₁ ↔ ∀ k, ∑ i, (φ k i : ℂ) * v i = 0) ∧
ℓ + Module.finrank ℂ ↥(Submodule.span ℂ (Set.range w) ⊓ V.prod L₁)
= Module.finrank ℂ ↥(Submodule.span ℂ (Set.range w)) ∧
Module.finrank ℂ ↥V + Module.finrank ℂ ↥L₁ < Fintype.card ι₀ + Fintype.card ι₁ ∧
(S₀ + 1) ^ ℓ * (2 * S₁ + 1) ^ (Fintype.card κ₁ - Module.finrank ℚ ↥(Submodule.span ℚ ((fun s : κ₁ → ℤ => fun j => (s j : ℚ)) ''
{s : κ₁ → ℤ | (∑ j, (s j : ℂ) • u j) ∈ V ∧
∀ k, ∏ i, (∏ j, a j i ^ s j) ^ φ k i = 1})))
* T₀ ^ Module.finrank ℂ ↥V * T₁ ^ Module.finrank ℂ ↥L₁
≤ ℓ.factorial * (2 ^ ((Fintype.card ι₀ + Fintype.card ι₁) * (Fintype.card ι₀ + Fintype.card ι₁ + 1) / 2)
* (Fintype.card ι₀ + Fintype.card ι₁).factorial * 2 ^ Fintype.card ι₁
* Fintype.card ι₀ ^ Fintype.card ι₀) * T₀ ^ Fintype.card ι₀ * T₁ ^ Fintype.card ι₁ := by
sorry
end DiazModulus