matrix3_saturated_invertible_length_eq_25
For a cyclic trace decomposition over a field with every first factor nonzero and the sum of their matrix ranks equal to 27, the existence of an invertible first factor forces the decomposition length to be 25.
Statement
theorem matrix3_saturated_invertible_length_eq_25 {K : Type*} [Field K] {r : ℕ} (a b c : Fin r → Matrix (Fin 3) (Fin 3) K) (hn : ∀ s, a s ≠ 0) (hc : ∀ i j j' k k' i' : Fin 3, ∑ s, a s i j * b s j' k * c s k' i' = if j = j' ∧ k = k' ∧ i = i' then 1 else 0) (hd : ∑ s, (a s).rank = 27) (t : Fin r) (ht : (a t).det ≠ 0) : r = 25
- Formalizes
- arXiv:2610.11823v3, Lemma 4.3. This formalization works over every field, with the paper's nonzero-factor assumption made explicit; the paper states the two-element-field case.
- Verified
- 25 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- matrix3_trace_saturationIf a cyclic trace decomposition over a field has first-factor matrix ranks summing to 27, then a_t * b_s * c_t * a_s equals a_s for t=s…
The proof, explained
Proof summary.
A nonzero 3x3 matrix has positive rank
If rank were 0, the linear map would be zero, so the matrix would be zero.
uses
Submodule.finrank_eq_zero.mp,LinearMap.range_eq_bot.mp,congrArgby_contra hn have hz : A.rank = 0 := by omega have hr : LinearMap.range A.mulVecLin = ⊥ := Submodule.finrank_eq_zero.mp hz have hf : A.mulVecLin = 0 := LinearMap.range_eq_bot.mp hr apply hA ext i j have he := congrArg (fun f : (Fin 3 → K) →ₗ[K] (Fin 3 → K) => f (Pi.single j 1) i) hf simpa using he
Saturation gives diagonal relations
Apply trace saturation.
uses
matrix3_trace_saturationhave h := matrix3_trace_saturation a b c hc hd have hdiag (s : Fin r) : a s * b s * c s * a s = a s := by simpa using h s s
c_t is invertible
Determinant is nonzero.
uses
congrArg,Matrix.det,Matrix.det_mul,mul_zero,zero_mulhave hct : (c t).det ≠ 0 := by intro hz have he := congrArg Matrix.det (hdiag t) simp only [Matrix.det_mul, hz, mul_zero, zero_mul] at he exact ht he.symm
b_s c_t a_s = 0
Multiply by inverse of a_t.
uses
Ne.symm,congrArg,Matrix.mul_assoc,Matrix.nonsing_inv_mul,isUnit_iff_ne_zero.mpr,Matrix.one_mul,Matrix.mul_zerohave hsmall (s : Fin r) (hst : s ≠ t) : (a s).rank = 1 := by have hoff : a t * b s * c t * a s = 0 := by simpa [Ne.symm hst] using h t s have hz : (b s * c t) * a s = 0 := by have he := congrArg (fun M => (a t)⁻¹ * M) hoff simpa only [← Matrix.mul_assoc, Matrix.nonsing_inv_mul _ (isUnit_iff_ne_zero.mpr ht), Matrix.one_mul, Matrix.mul_zero] using he
rank b_s + rank a_s <= 3
Sylvester inequality.
uses
Matrix.rank_add_rank_le_card_of_mul_eq_zero,Matrix.rank_mul_eq_left_of_det_ne_zero,Fintype.card_finhave hsum := Matrix.rank_add_rank_le_card_of_mul_eq_zero hz rw [Matrix.rank_mul_eq_left_of_det_ne_zero (c t) (b s) hct, Fintype.card_fin] at hsum
rank a_s <= rank b_s
Rank inequality from factorization.
uses
congrArg,Matrix.rank,Matrix.rank_mul_le_left,Matrix.rank_mul_le_righthave hle : (a s).rank ≤ (b s).rank := by calc (a s).rank = (a s * b s * c s * a s).rank := congrArg Matrix.rank (hdiag s).symm _ ≤ (a s * b s * c s).rank := Matrix.rank_mul_le_left _ _ _ ≤ (a s * b s).rank := Matrix.rank_mul_le_left _ _ _ ≤ (b s).rank := Matrix.rank_mul_le_right _ _
rank a_s = 1 automation
Omega solves it.
uses
matrix3_saturated_factor_rank_poshave hp := matrix3_saturated_factor_rank_pos (hn s) omega
rank a_t = 3
Invertible matrix has rank 3.
uses
Matrix.rank_of_det_ne_zerohave ht3 : (a t).rank = 3 := by simpa using Matrix.rank_of_det_ne_zero ht
Sum rewritten termwise
Case split on s = t.
uses
Finset.sum_congrhave he : (∑ s, (a s).rank) = ∑ s : Fin r, (1 + if s = t then 2 else 0) := by apply Finset.sum_congr rfl intro s _ by_cases hst : s = t · subst s; simp [ht3] · simp [hst, hsmall s hst]
r = 25 automation
Sum simplifies to r + 2 = 27.
uses
Finset.sum_add_distrib,Finset.sum_const,Finset.card_univ,Fintype.card_fin,smul_eq_mul,mul_one,Finset.sum_ite_eq',Finset.mem_univ,ite_truesimp only [Finset.sum_add_distrib, Finset.sum_const, Finset.card_univ, Fintype.card_fin, smul_eq_mul, mul_one, Finset.sum_ite_eq', Finset.mem_univ, ite_true] at he omega
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
open Matrix Finsetnoncomputable sectionvariable {K : Type*} [Field K] {r : ℕ}private theorem matrix3_saturated_factor_rank_pos {A : Matrix (Fin 3) (Fin 3) K} (hA : A ≠ 0) : 0 < A.rank := by by_contra hn have hz : A.rank = 0 := by omega have hr : LinearMap.range A.mulVecLin = ⊥ := Submodule.finrank_eq_zero.mp hz have hf : A.mulVecLin = 0 := LinearMap.range_eq_bot.mp hr apply hA ext i j have he := congrArg (fun f : (Fin 3 → K) →ₗ[K] (Fin 3 → K) => f (Pi.single j 1) i) hf simpa using heendtheorem matrix3_saturated_invertible_length_eq_25 {K : Type*} [Field K] {r : ℕ} (a b c : Fin r → Matrix (Fin 3) (Fin 3) K) (hn : ∀ s, a s ≠ 0) (hc : ∀ i j j' k k' i' : Fin 3, ∑ s, a s i j * b s j' k * c s k' i' = if j = j' ∧ k = k' ∧ i = i' then 1 else 0) (hd : ∑ s, (a s).rank = 27) (t : Fin r) (ht : (a t).det ≠ 0) : r = 25 := by have h := matrix3_trace_saturation a b c hc hd have hdiag (s : Fin r) : a s * b s * c s * a s = a s := by simpa using h s s have hct : (c t).det ≠ 0 := by intro hz have he := congrArg Matrix.det (hdiag t) simp only [Matrix.det_mul, hz, mul_zero, zero_mul] at he exact ht he.symm have hsmall (s : Fin r) (hst : s ≠ t) : (a s).rank = 1 := by have hoff : a t * b s * c t * a s = 0 := by simpa [Ne.symm hst] using h t s have hz : (b s * c t) * a s = 0 := by have he := congrArg (fun M => (a t)⁻¹ * M) hoff simpa only [← Matrix.mul_assoc, Matrix.nonsing_inv_mul _ (isUnit_iff_ne_zero.mpr ht), Matrix.one_mul, Matrix.mul_zero] using he have hsum := Matrix.rank_add_rank_le_card_of_mul_eq_zero hz rw [Matrix.rank_mul_eq_left_of_det_ne_zero (c t) (b s) hct, Fintype.card_fin] at hsum have hle : (a s).rank ≤ (b s).rank := by calc (a s).rank = (a s * b s * c s * a s).rank := congrArg Matrix.rank (hdiag s).symm _ ≤ (a s * b s * c s).rank := Matrix.rank_mul_le_left _ _ _ ≤ (a s * b s).rank := Matrix.rank_mul_le_left _ _ _ ≤ (b s).rank := Matrix.rank_mul_le_right _ _ have hp := matrix3_saturated_factor_rank_pos (hn s) omega have ht3 : (a t).rank = 3 := by simpa using Matrix.rank_of_det_ne_zero ht have he : (∑ s, (a s).rank) = ∑ s : Fin r, (1 + if s = t then 2 else 0) := by apply Finset.sum_congr rfl intro s _ by_cases hst : s = t · subst s; simp [ht3] · simp [hst, hsmall s hst] simp only [Finset.sum_add_distrib, Finset.sum_const, Finset.card_univ, Fintype.card_fin, smul_eq_mul, mul_one, Finset.sum_ite_eq', Finset.mem_univ, ite_true] at he omega