zonotope_polygon_subset_standardized_laplacian_spectra
For any integer n ≥ 2, the zonotope polygon S_n, defined as the set of linear combinations ∑_{m=1}^{n-1} t_m g_m with t_m ∈ [0, 1] and g_m = (1/n)(1 - exp(-2πi m/n)), is a subset of the standardized Laplacian spectrum Lambda_n.
Statement
theorem zonotope_polygon_subset_standardized_laplacian_spectra (n : ℕ) (hn : 2 ≤ n) :
{ z : ℂ | ∃ t : ℕ → ℝ, (∀ m ∈ Finset.Ico 1 n, 0 ≤ t m ∧ t m ≤ 1) ∧
z = ∑ m ∈ Finset.Ico 1 n, (t m : ℂ) * ((1 / (n : ℂ)) * (1 - Complex.exp (-2 * Real.pi * Complex.I * (m : ℂ) / (n : ℂ)))) } ⊆
standardized_laplacian_spectra n- Formalizes
- arXiv:2610.14100 Corollary 2
- Verified
- 23 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- standardized_laplacian_spectraThe set Lambda_n of all complex eigenvalues of standardized Laplacian matrices of order n.
- is_standardized_laplacianA standardized Laplacian matrix of order n is a real n x n matrix with zero row sums and off-diagonal entries in [-1/n, 0].
- circulant_laplacian_is_standardizedFor n ≥ 2 and coefficients t_m ∈ [0, 1] for m = 1, ..., n-1, the matrix (1/n) ∑_{m=1}^{n-1} t_m (I - Q^m), where Q is the cyclic…
Read back from the Lean
For every natural number $n$ such that $2 \le n$, the set of complex numbers $z$ of the form
$$z = \sum_{m=1}^{n-1} t(m) \cdot \frac{1}{n} \left(1 - \exp\left(-\frac{2\pi i m}{n}\right)\right)$$
for some function $t : \mathbb{N} \to \mathbb{R}$ satisfying $0 \le t(m) \le 1$ for all $m \in \{1, \dots, n-1\}$ is a subset of standardized_laplacian_spectra n. That is, any such $z$ is an eigenvalue (in $\mathbb{C}$) of some $n \times n$ real matrix $L$ satisfying the standardized Laplacian conditions.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
The theorem states that every point z in the zonotope polygon S_n is contained in the standardized Laplacian spectrum Lambda_n. The proof achieves this by constructing an explicit circulant Laplacian matrix L = (1/n) ∑_{m=1}^{n-1} t_m (I - P_m), where P_m are the cyclic shift matrices, and invoking a helper lemma to guarantee that L is standardized. To show that z is an eigenvalue of L over ℂ, it considers the discrete Fourier vector v = (1, μ, μ^2, ..., μ^{n-1})^T with μ = exp(-2πi / n), which simultaneously diagonalizes all shift matrices with P_m v = μ^m v. By linearity, A v = z v; assuming for contradiction that z I - A is invertible implies its action on vectors is injective, forcing the non-zero eigenvector v to be zero.
To show z ∈ standardized_laplacian_spectra(n), it suffices to show that z is in the spectrum of the complex circulant matrix A.
Unpack the assumption that z is a convex combination ∑_{m=1}^{n-1} t_m g_m with weights t_m ∈ [0, 1]. We define the candidate real Laplacian matrix L = (1/n) ∑_{m=1}^{n-1} t_m (I - P_m), where P_m is the cyclic shift permutation matrix mapping i ↦ (i + m) mod n. By circulant_laplacian_is_standardized, L is a standardized Laplacian matrix. Hence, by definition of standardized_laplacian_spectra, it remains to verify that z belongs to the spectrum of L over ℂ, or equivalently, of the complex matrix A.
uses
circulant_laplacian_is_standardized,Nat.pos_iff_ne_zero.mprintro z ⟨t, ht, hz⟩ rw [hz] set Z : ℂ := ∑ m ∈ Finset.Ico 1 n, (t m : ℂ) * ((1 / (n : ℂ)) * (1 - Complex.exp (-2 * Real.pi * Complex.I * (m : ℂ) / (n : ℂ)))) with hZdef have hnpos : 0 < n := by omega have hnc : (n : ℂ) ≠ 0 := by exact_mod_cast (Nat.pos_iff_ne_zero.mp hnpos) set μ : ℂ := Complex.exp (-(2 * Real.pi * Complex.I) / (n : ℂ)) with hμdef set L : Matrix (Fin n) (Fin n) ℝ := (1 / (n : ℝ)) • ∑ m ∈ Finset.Ico 1 n, t m • ((1 : Matrix (Fin n) (Fin n) ℝ) - Matrix.of (fun i j : Fin n => if (j : ℕ) = ((i : ℕ) + m) % n then (1:ℝ) else 0)) with hL set A : Matrix (Fin n) (Fin n) ℂ := (1 / (n : ℂ)) • ∑ m ∈ Finset.Ico 1 n, (t m : ℂ) • ((1 : Matrix (Fin n) (Fin n) ℂ) - Matrix.of (fun i j : Fin n => if (j : ℕ) = ((i : ℕ) + m) % n then (1:ℂ) else 0)) with hA refine ⟨L, circulant_laplacian_is_standardized n hn t ht, ?_⟩
The complexification of the real matrix L equals A, so the goal reduces to showing Z ∈ spectrum(ℂ, A).
We verify entry by entry that mapping the real entries of L to ℂ produces the complex matrix A. Expanding the definitions and distributing the real-to-complex coercion across matrix sums, scaling, and differences confirms L.map Complex.ofReal = A. Rewriting with this equality leaves Z ∈ spectrum ℂ A.
uses
Matrix.map_apply,Matrix.smul_apply,Matrix.sum_apply,Matrix.sub_apply,Matrix.one_apply,Matrix.of_apply,smul_eq_mul,Complex.ofReal_sum,Complex.ofReal_mul,Complex.ofReal_one,Complex.ofReal_zero,Complex.ofReal_sub,apply_ite,Finset.mul_sum,Finset.sum_congrhave hmap : L.map Complex.ofReal = A := by rw [hL, hA] ext i j simp only [Matrix.map_apply, Matrix.smul_apply, Matrix.sum_apply, Matrix.sub_apply, Matrix.one_apply, Matrix.of_apply, smul_eq_mul, Complex.ofReal_sum, Complex.ofReal_mul, Complex.ofReal_one, Complex.ofReal_zero, Complex.ofReal_sub, apply_ite Complex.ofReal, Finset.mul_sum] apply Finset.sum_congr rfl intro x hx rw [show ((1 / (n:ℝ) : ℝ) : ℂ) = 1 / (n:ℂ) from by push_cast; ring] rw [hmap]
Assume for contradiction that Z • 1 - A is an invertible matrix.
By spectrum.mem_iff, a complex number Z is in the spectrum of A if and only if Z • 1 - A is not a unit. To reach a contradiction, we assume that Z • 1 - A is invertible (a unit in the matrix ring).
uses
spectrum.mem_iffrw [spectrum.mem_iff] intro hunit
The root of unity μ = exp(-2πi / n) satisfies μ^n = 1, powers of μ are periodic modulo n (μ^(k mod n) = μ^k), and exp(-2πi m / n) = μ^m.
Multiplying the exponent of μ by n gives -2πi, and the complex exponential of any integer multiple of 2πi is 1, so μ^n = 1. By the Euclidean division theorem k = (k mod n) + n * (k / n), we have μ^k = μ^(k mod n) * (μ^n)^(k / n) = μ^(k mod n). Furthermore, using the exponential power law, exp(-2πi m / n) = (exp(-2πi / n))^m = μ^m.
uses
Complex.exp_nat_mul,Complex.exp_int_mul_two_pi_mul_I,Nat.mod_add_div,pow_add,pow_mul,one_pow,mul_onehave hμn : μ ^ n = 1 := by rw [hμdef, ← Complex.exp_nat_mul] have harg : (n : ℂ) * (-(2 * Real.pi * Complex.I) / (n : ℂ)) = (-1 : ℤ) * (2 * Real.pi * Complex.I) := by push_cast field_simp rw [harg, Complex.exp_int_mul_two_pi_mul_I] have hμmod : ∀ k : ℕ, μ ^ (k % n) = μ ^ k := by intro k conv_rhs => rw [← Nat.mod_add_div k n] rw [pow_add, pow_mul, hμn, one_pow, mul_one] have hbase : ∀ m : ℕ, Complex.exp (-2 * Real.pi * Complex.I * (m : ℂ) / (n : ℂ)) = μ ^ m := by intro m rw [hμdef, ← Complex.exp_nat_mul] congr 1 field_simp
The Fourier vector v ∈ ℂ^n defined by v_i = μ^i is non-zero.
Define the vector v by v_i = μ^i for i ∈ Fin n. If v were the zero vector, evaluating at coordinate 0 would give v_0 = μ^0 = 1 = 0, a contradiction.
uses
congrFunset v : Fin n → ℂ := fun i => μ ^ (i : ℕ) with hv have hvne : v ≠ 0 := by intro h have h0 := congrFun h ⟨0, hnpos⟩ simp [hv] at h0
Each cyclic shift matrix P_m has v as an eigenvector with eigenvalue μ^m: P_m v = μ^m v.
For each coordinate i, the matrix-vector product (P_m v)_i sums over all columns j, where the entry is non-zero only when j = (i + m) mod n. Isolating this single non-zero summand with Finset.sum_eq_single, the entry evaluates to v_{(i + m) mod n} = μ^((i + m) mod n). By the periodicity of μ modulo n, this equals μ^(i + m) = μ^m * μ^i = (μ^m • v)_i.
uses
Matrix.of_apply,Pi.smul_apply,smul_eq_mul,Finset.sum_eq_single,Nat.mod_lt,if_true,one_mul,pow_add,if_neg,Fin.ext,zero_mul,Finset.mem_univhave hM : ∀ m, (Matrix.of (fun i j : Fin n => if (j:ℕ) = ((i:ℕ)+m)%n then (1:ℂ) else 0)).mulVec v = μ^m • v := by intro m ext i simp only [hv, Matrix.mulVec, dotProduct, Matrix.of_apply, Pi.smul_apply, smul_eq_mul] rw [Finset.sum_eq_single (⟨((i:ℕ)+m)%n, Nat.mod_lt _ hnpos⟩ : Fin n)] · simp only [if_true, one_mul] rw [hμmod, pow_add] ring · intro b _ hb rw [if_neg (fun h => hb (Fin.ext h)), zero_mul] · intro h exact absurd (Finset.mem_univ _) h
The matrix A has v as an eigenvector with eigenvalue Z: A v = Z v.
The matrix A is defined as (1/n) ∑_{m=1}^{n-1} t_m (I - P_m). Applying A to v distributes across the sum and scalar multiplications. For each term, (I - P_m) v = v - μ^m v = (1 - μ^m) v. Factoring out v and using exp(-2πi m / n) = μ^m converts the sum of coefficients directly into the scalar Z, proving A v = Z v.
uses
Matrix.smul_mulVec,Matrix.sum_mulVec,Matrix.sub_mulVec,Matrix.one_mulVec,Pi.sub_apply,Pi.smul_apply,smul_eq_mul,Finset.sum_congr,Finset.sum_smul,smul_smul,Finset.mul_sumhave hAv : A.mulVec v = Z • v := by rw [hZdef, hA] rw [Matrix.smul_mulVec, Matrix.sum_mulVec] have hper : ∀ m, ((t m : ℂ) • ((1 : Matrix (Fin n) (Fin n) ℂ) - Matrix.of (fun i j : Fin n => if (j:ℕ) = ((i:ℕ)+m)%n then (1:ℂ) else 0))).mulVec v = ((t m : ℂ) * (1 - μ^m)) • v := by intro m rw [Matrix.smul_mulVec, Matrix.sub_mulVec, Matrix.one_mulVec, hM m] ext i simp only [Pi.sub_apply, Pi.smul_apply, smul_eq_mul] ring rw [Finset.sum_congr rfl (fun m _ => hper m)] rw [← Finset.sum_smul] rw [smul_smul, Finset.mul_sum] congr 1 apply Finset.sum_congr rfl intro m _ rw [hbase m] ring
An invertible matrix has a trivial kernel, which forces v = 0, contradicting v ≠ 0.
Since A v = Z v, we have (Z • 1 - A) v = Z v - A v = 0. But Z • 1 - A was assumed to be invertible, so multiplication by it is an injective map (Matrix.mulVec_injective_of_isUnit). Because (Z • 1 - A) v = 0 = (Z • 1 - A) 0, injectivity implies v = 0, which contradicts that v is non-zero.
uses
Algebra.algebraMap_eq_smul_one,Matrix.mulVec_injective_of_isUnit,Matrix.sub_mulVec,Matrix.smul_mulVec,Matrix.one_mulVec,Matrix.mulVec_zerorw [Algebra.algebraMap_eq_smul_one] at hunit have hinj := Matrix.mulVec_injective_of_isUnit hunit have hz1 : (Z • (1 : Matrix (Fin n) (Fin n) ℂ) - A).mulVec v = 0 := by rw [Matrix.sub_mulVec, Matrix.smul_mulVec, Matrix.one_mulVec, hAv] simp have h0 : (Z • (1 : Matrix (Fin n) (Fin n) ℂ) - A).mulVec v = (Z • (1 : Matrix (Fin n) (Fin n) ℂ) - A).mulVec 0 := by rw [Matrix.mulVec_zero] exact hz1 exact hvne (hinj h0)
circulant_laplacian_is_standardized- A convex-like combination (1/n) ∑_{m=1}^{n-1} t_m (I - P_m) of elementary directed cycle Laplacians with weights t_m ∈ [0, 1] satisfies the row-sum and off-diagonal bounds of a standardized Laplacian matrix.
Nat.pos_iff_ne_zero.mp- A strictly positive natural number is non-zero.
Matrix.map_apply- The (i, j)-th entry of the matrix obtained by applying a function f entrywise to M is f(M i j).
Matrix.smul_apply- Scalar multiplication of a matrix acts entrywise: (r • A) i j = r • A i j.
Matrix.sum_apply- The (i, j)-th entry of a finite sum of matrices is the sum of their (i, j)-th entries.
Matrix.sub_apply- The (i, j)-th entry of a difference of matrices is the difference of their (i, j)-th entries.
Matrix.one_apply- The (i, j)-th entry of the identity matrix is 1 if i = j and 0 otherwise.
Matrix.of_apply- Evaluating a matrix defined by a coordinate function at (i, j) yields the function value at (i, j).
smul_eq_mul- Scalar action in a ring or algebra is equivalent to multiplication.
Complex.ofReal_sum- The canonical coercion from ℝ to ℂ commutes with finite sums.
Complex.ofReal_mul- The canonical coercion from ℝ to ℂ preserves multiplication: ↑(r * s) = ↑r * ↑s.
Complex.ofReal_one- The real number 1 coerces to the complex number 1.
Complex.ofReal_zero- The real number 0 coerces to the complex number 0.
Complex.ofReal_sub- The canonical coercion from ℝ to ℂ preserves subtraction: ↑(r - s) = ↑r - ↑s.
apply_ite- Applying a function f to an if-then-else evaluates the branches under f: f (if P then x else y) = if P then f x else f y.
Finset.mul_sum- Left multiplication distributes over a finite sum: a * ∑ i ∈ s, f i = ∑ i ∈ s, a * f i.
Finset.sum_congr- Two finite sums are equal if their index sets are identical and their summands agree at every index.
spectrum.mem_iff- A scalar r belongs to the spectrum of an algebra element a if and only if r • 1 - a is not invertible (not a unit).
Complex.exp_nat_mul- The complex exponential of an integer multiple n * x equals (exp x)^n.
Complex.exp_int_mul_two_pi_mul_I- The complex exponential of an integer multiple of 2πi equals 1: exp(n * 2πi) = 1.
Nat.mod_add_div- Euclidean division identity for natural numbers: m % k + k * (m / k) = m.
pow_add- Powers satisfy the exponent addition law: a ^ (m + n) = a ^ m * a ^ n.
pow_mul- Powers satisfy the exponent multiplication law: a ^ (m * n) = (a ^ m) ^ n.
one_pow- 1 raised to any natural power equals 1.
mul_one- Multiplying by 1 on the right leaves an element unchanged: a * 1 = a.
congrFun- Equal functions take equal values at any argument: if f = g then f a = g a.
Finset.sum_eq_single- If every term in a finite sum vanishes except possibly at a single index a, the sum evaluates to f(a).
Nat.mod_lt- For y > 0, the remainder x % y is strictly less than y.
if_true- An if-then-else whose condition is True reduces to the 'then' branch.
one_mul- Multiplying by 1 on the left leaves an element unchanged: 1 * a = a.
if_neg- An if-then-else whose condition is False reduces to the 'else' branch.
Fin.ext- Two elements of Fin n are equal if and only if their underlying natural numbers are equal.
zero_mul- Multiplying zero by any element yields zero: 0 * a = 0.
Finset.mem_univ- Every element of a finite type belongs to its universal finset.
Matrix.smul_mulVec- Scalar multiplication of a matrix commutes with matrix-vector multiplication: (b • M) v = b • (M v).
Matrix.sum_mulVec- Matrix-vector multiplication distributes over a finite sum of matrices: (∑ i, M i) v = ∑ i, (M i) v.
Matrix.sub_mulVec- Matrix-vector multiplication distributes over matrix subtraction: (A - B) v = A v - B v.
Matrix.one_mulVec- The identity matrix acts as the identity on vectors: Matrix.mulVec 1 v = v.
Pi.sub_apply- Function subtraction evaluates pointwise: (f - g) i = f i - g i.
Pi.smul_apply- Pointwise scalar multiplication of functions satisfies (a • f) i = a • f i.
Finset.sum_smul- Scalar multiplication on the right distributes over finite sums of scalars: (∑ i, f i) • x = ∑ i, f i • x.
smul_smul- Successive scalar multiplication is associative: a₁ • a₂ • b = (a₁ * a₂) • b.
Algebra.algebraMap_eq_smul_one- The canonical algebra map from scalars to an algebra sends r to r • 1.
Matrix.mulVec_injective_of_isUnit- Matrix-vector multiplication by an invertible matrix (a unit in the matrix ring) is an injective function.
Matrix.mulVec_zero- Multiplying any matrix by the zero vector yields the zero vector: A 0 = 0.
- The definition of the spectrum in Mathlib is purely ring-theoretic: a scalar z is in the spectrum of A if and only if z • 1 - A is not a unit (not invertible). Consequently, the proof proceeds by contradiction: having established that the Fourier vector v satisfies (Z • 1 - A) v = 0, it applies the injectivity of multiplication by an invertible matrix to force v = 0, contradicting that the first component of v is 1.
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.
/-- The zonotope polygon S_n is contained in the standardized Laplacian spectrum Lambda_n (PR-360). -/theorem zonotope_polygon_subset_standardized_laplacian_spectra (n : ℕ) (hn : 2 ≤ n) : { z : ℂ | ∃ t : ℕ → ℝ, (∀ m ∈ Finset.Ico 1 n, 0 ≤ t m ∧ t m ≤ 1) ∧ z = ∑ m ∈ Finset.Ico 1 n, (t m : ℂ) * ((1 / (n : ℂ)) * (1 - Complex.exp (-2 * Real.pi * Complex.I * (m : ℂ) / (n : ℂ)))) } ⊆ standardized_laplacian_spectra n := by rintro z ⟨t, ht, hz⟩ rw [hz] set Z : ℂ := ∑ m ∈ Finset.Ico 1 n, (t m : ℂ) * ((1 / (n : ℂ)) * (1 - Complex.exp (-2 * Real.pi * Complex.I * (m : ℂ) / (n : ℂ)))) with hZdef have hnpos : 0 < n := by omega have hnc : (n : ℂ) ≠ 0 := by exact_mod_cast (Nat.pos_iff_ne_zero.mp hnpos) set μ : ℂ := Complex.exp (-(2 * Real.pi * Complex.I) / (n : ℂ)) with hμdef set L : Matrix (Fin n) (Fin n) ℝ := (1 / (n : ℝ)) • ∑ m ∈ Finset.Ico 1 n, t m • ((1 : Matrix (Fin n) (Fin n) ℝ) - Matrix.of (fun i j : Fin n => if (j : ℕ) = ((i : ℕ) + m) % n then (1:ℝ) else 0)) with hL set A : Matrix (Fin n) (Fin n) ℂ := (1 / (n : ℂ)) • ∑ m ∈ Finset.Ico 1 n, (t m : ℂ) • ((1 : Matrix (Fin n) (Fin n) ℂ) - Matrix.of (fun i j : Fin n => if (j : ℕ) = ((i : ℕ) + m) % n then (1:ℂ) else 0)) with hA refine ⟨L, circulant_laplacian_is_standardized n hn t ht, ?_⟩ have hmap : L.map Complex.ofReal = A := by rw [hL, hA] ext i j simp only [Matrix.map_apply, Matrix.smul_apply, Matrix.sum_apply, Matrix.sub_apply, Matrix.one_apply, Matrix.of_apply, smul_eq_mul, Complex.ofReal_sum, Complex.ofReal_mul, Complex.ofReal_one, Complex.ofReal_zero, Complex.ofReal_sub, apply_ite Complex.ofReal, Finset.mul_sum] apply Finset.sum_congr rfl intro x hx rw [show ((1 / (n:ℝ) : ℝ) : ℂ) = 1 / (n:ℂ) from by push_cast; ring] rw [hmap] rw [spectrum.mem_iff] intro hunit have hμn : μ ^ n = 1 := by rw [hμdef, ← Complex.exp_nat_mul] have harg : (n : ℂ) * (-(2 * Real.pi * Complex.I) / (n : ℂ)) = (-1 : ℤ) * (2 * Real.pi * Complex.I) := by push_cast field_simp rw [harg, Complex.exp_int_mul_two_pi_mul_I] have hμmod : ∀ k : ℕ, μ ^ (k % n) = μ ^ k := by intro k conv_rhs => rw [← Nat.mod_add_div k n] rw [pow_add, pow_mul, hμn, one_pow, mul_one] have hbase : ∀ m : ℕ, Complex.exp (-2 * Real.pi * Complex.I * (m : ℂ) / (n : ℂ)) = μ ^ m := by intro m rw [hμdef, ← Complex.exp_nat_mul] congr 1 field_simp set v : Fin n → ℂ := fun i => μ ^ (i : ℕ) with hv have hvne : v ≠ 0 := by intro h have h0 := congrFun h ⟨0, hnpos⟩ simp [hv] at h0 have hM : ∀ m, (Matrix.of (fun i j : Fin n => if (j:ℕ) = ((i:ℕ)+m)%n then (1:ℂ) else 0)).mulVec v = μ^m • v := by intro m ext i simp only [hv, Matrix.mulVec, dotProduct, Matrix.of_apply, Pi.smul_apply, smul_eq_mul] rw [Finset.sum_eq_single (⟨((i:ℕ)+m)%n, Nat.mod_lt _ hnpos⟩ : Fin n)] · simp only [if_true, one_mul] rw [hμmod, pow_add] ring · intro b _ hb rw [if_neg (fun h => hb (Fin.ext h)), zero_mul] · intro h exact absurd (Finset.mem_univ _) h have hAv : A.mulVec v = Z • v := by rw [hZdef, hA] rw [Matrix.smul_mulVec, Matrix.sum_mulVec] have hper : ∀ m, ((t m : ℂ) • ((1 : Matrix (Fin n) (Fin n) ℂ) - Matrix.of (fun i j : Fin n => if (j:ℕ) = ((i:ℕ)+m)%n then (1:ℂ) else 0))).mulVec v = ((t m : ℂ) * (1 - μ^m)) • v := by intro m rw [Matrix.smul_mulVec, Matrix.sub_mulVec, Matrix.one_mulVec, hM m] ext i simp only [Pi.sub_apply, Pi.smul_apply, smul_eq_mul] ring rw [Finset.sum_congr rfl (fun m _ => hper m)] rw [← Finset.sum_smul] rw [smul_smul, Finset.mul_sum] congr 1 apply Finset.sum_congr rfl intro m _ rw [hbase m] ring rw [Algebra.algebraMap_eq_smul_one] at hunit have hinj := Matrix.mulVec_injective_of_isUnit hunit have hz1 : (Z • (1 : Matrix (Fin n) (Fin n) ℂ) - A).mulVec v = 0 := by rw [Matrix.sub_mulVec, Matrix.smul_mulVec, Matrix.one_mulVec, hAv] simp have h0 : (Z • (1 : Matrix (Fin n) (Fin n) ℂ) - A).mulVec v = (Z • (1 : Matrix (Fin n) (Fin n) ℂ) - A).mulVec 0 := by rw [Matrix.mulVec_zero] exact hz1 exact hvne (hinj h0)