DALAG Th. 11.21 (d₀ ≤ n) from the elementary multiplicity estimate: some (V′, φ) has ℓ₀′ < d′ and (λ′ + d₁′)(d − n) ≤ d₁(d′ − ℓ₀′)
ProvedDiazModulus.linear_subgroup_transcendencePoints 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 let be a subspace of dimension with and . Let () and (), and suppose the coordinates of the and of the are algebraic and every lies in . Assume hME. Then there are a subspace , with common complex kernel , and with , the span of the , such that and . Here , , , , and is the dimension of the -span of the set of with and for every .
This is DALAG Th. 11.21 in the case , with the span of algebraic vectors and the obstruction subgroup recorded as .
Proof. DiazModulus.interp_kernel gives a constant . Fix and the curve of DiazModulus.params_1122_eventually: , , . For all large , DiazModulus.params_1122_eventually gives and the constraint of DiazModulus.interp_kernel at , so DiazModulus.interp_kernel yields whose vanishing covers the premise of DiazModulus.obstruction_1123 at . DiazModulus.obstruction_1123 returns with ; cancelling gives (11.23) with exponents , and . These four numbers range over a finite set, so one tuple occurs for infinitely many , and DiazModulus.params_exponents applied to it gives and .
Novelty. Classical; routine formalisation. DALAG Th. 11.21 (case ), from the multiplicity estimate carried as the hypothesis hME. The obstruction is recorded as , without connectedness or a field of definition, and the are not assumed -independent; the consumers do not need either.
import Definitions.Def_DiazModulus import Definitions.Def_MultiplicityEstimateElem
open Complex ComplexConjugate
namespace DiazModulus
theorem linear_subgroup_transcendence (hME : MultiplicityEstimateElem)
{ι₀ ι₁ κ₀ κ₁ : Type} [Fintype ι₀] [Fintype ι₁] [Fintype κ₀] [Fintype κ₁]
[DecidableEq ι₀] [DecidableEq ι₁]
(V : Submodule ℂ ((ι₀ → ℂ) × (ι₁ → ℂ))) (hV1 : 1 ≤ Module.finrank ℂ ↥V)
(hVd : Module.finrank ℂ ↥V < Fintype.card ι₀ + Fintype.card ι₁)
(hd0 : Fintype.card ι₀ ≤ Module.finrank ℂ ↥V)
(w : κ₀ → (ι₀ → ℂ) × (ι₁ → ℂ)) (hwV : ∀ k, w k ∈ V) (hwalg : ∀ k, (∀ h, (w k).1 h ∈ Qbar) ∧ ∀ i, (w k).2 i ∈ Qbar)
(η : κ₁ → (ι₀ → ℂ) × (ι₁ → ℂ)) (hηV : ∀ j, η j ∈ V) (hηalg : ∀ j, (∀ h, (η j).1 h ∈ Qbar) ∧ ∀ i, (η j).2 i ∈ LogAlg) :
∃ (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)) ∧
ℓ < (Fintype.card ι₀ - Module.finrank ℂ ↥V' + (Fintype.card ι₁ - Module.finrank ℂ ↥L₁)) ∧
(Fintype.card κ₁ - Module.finrank ℚ ↥(Submodule.span ℚ ((fun s : κ₁ → ℤ => fun j => (s j : ℚ)) ''
{s : κ₁ → ℤ | (∑ j, (s j : ℂ) • (η j).1) ∈ V' ∧
∀ k, ∏ i, (∏ j, Complex.exp ((η j).2 i) ^ s j) ^ φ k i = 1}))
+ (Fintype.card ι₁ - Module.finrank ℂ ↥L₁)) * (Fintype.card ι₀ + Fintype.card ι₁ - Module.finrank ℂ ↥V)
≤ Fintype.card ι₁ * ((Fintype.card ι₀ - Module.finrank ℂ ↥V' + (Fintype.card ι₁ - Module.finrank ℂ ↥L₁)) - ℓ) := by
sorry
end DiazModulus