A subgroup has a coordinate set with and triangular rows , ; their common kernel has dimension
ProvedDiazModulus.exists_coordinate_section_mulcommutative-algebradiaz-modulus-leanmultiplicity-estimatetranscendence
Let be a finite type and a subgroup of . Then there are and () such that the only element of vanishing off is , for , and for , , and every complex subspace with has .
Proof. Take of largest size with . For maximality gives a non-zero supported on , with . The system is triangular off , so restriction to is a linear bijection from onto .
Novelty. Classical; routine formalisation.
Preamble
import Mathlib
Formal statement
namespace DiazModulus
theorem exists_coordinate_section_mul {A₁ : Type*} [Fintype A₁] (Φ : AddSubgroup (A₁ → ℤ)) :
∃ (J : Finset A₁) (ψ : A₁ → A₁ → ℤ), (∀ φ ∈ Φ, (∀ i ∉ J, φ i = 0) → φ = 0) ∧ (∀ i, ψ i ∈ Φ) ∧
(∀ i ∈ J, ψ i = 0) ∧ (∀ i ∉ J, ψ i i ≠ 0 ∧ ∀ i' ∉ J, i' ≠ i → ψ i i' = 0) ∧
∀ L : Submodule ℂ (A₁ → ℂ), (∀ v, v ∈ L ↔ ∀ i, ∑ i', (ψ i i' : ℂ) * v i' = 0) → Module.finrank ℂ ↥L = J.card := by
sorry
end DiazModulus
Source
Classical: a maximal coordinate set avoiding a lattice, and the triangular system it gives. C1.3 of the Diaz modulus mission. Formal proof: Diaz modulus mission, 30 October 2026 (C. Perassi).