An integer matrix with no rational kernel has no complex kernel, and if then
ProvedDiazModulus.intMatrix_ker_factsdiaz-modulus-leannumber-theorytranscendence
Let be finite and , and suppose the only with for all is . Then the only such is ; and if has for every , then .
Proof. The map from to is injective, so it has a rational left inverse , with ; the identity persists over . So for every complex : this gives when every is , and with when .
Novelty. Classical; routine formalisation. Linear algebra.
Preamble
import Definitions.Def_DiazModulus
Formal statement
open Complex ComplexConjugate
namespace DiazModulus
theorem intMatrix_ker_facts {ι : Type} [Fintype ι] {q : ℕ} (φ : Fin q → ι → ℤ)
(hφ : ∀ v : ι → ℚ, (∀ k, ∑ i, (φ k i : ℚ) * v i = 0) → v = 0) :
(∀ v : ι → ℂ, (∀ k, ∑ i, (φ k i : ℂ) * v i = 0) → v = 0) ∧
∀ z : ι → ℂ, (∀ k, ∃ e : ℤ, ∑ i, (φ k i : ℂ) * z i = 2 * Real.pi * Complex.I * e) →
∃ v : ι → ℚ, ∀ i, z i = 2 * Real.pi * Complex.I * v i := by
sorry
end DiazModulus
Source
Classical linear algebra. C1.4 of the Diaz modulus mission. Formal proof: Diaz modulus mission, 29 October 2026 (C. Perassi).