A subspace has a coordinate set with bijective, and is cut out by normalised linear forms ,
ProvedDiazModulus.exists_coordinate_section_addcommutative-algebradiaz-modulus-leanmultiplicity-estimatetranscendence
Let be a field, a finite type and a subspace of . Then there are and vectors () with for , normalised off ( and for , ), such that , every agrees on with some element of , and .
Proof. Take of largest size with onto; maximality makes it injective. With the lift of the indicator of , put for .
Novelty. Classical; routine formalisation.
Preamble
import Mathlib
Formal statement
namespace DiazModulus
theorem exists_coordinate_section_add {K A₀ : Type*} [Field K] [Fintype A₀] (V : Submodule K (A₀ → K)) :
∃ (H : Finset A₀) (ℓ : A₀ → A₀ → K), (∀ h ∈ H, ℓ h = 0) ∧ (∀ h ∉ H, ℓ h h = 1 ∧ ∀ h' ∉ H, h' ≠ h → ℓ h h' = 0) ∧
(∀ v, v ∈ V ↔ ∀ h, ∑ h', ℓ h h' * v h' = 0) ∧ (∀ x : A₀ → K, ∃ v ∈ V, ∀ h ∈ H, v h = x h) ∧
Module.finrank K ↥V = H.card := by
sorry
end DiazModulus
Source
Classical linear algebra: a subspace as a graph over a coordinate subspace (reduced row echelon form). C1.3 of the Diaz modulus mission. Formal proof: Diaz modulus mission, 30 October 2026 (C. Perassi).