AFTD Auto-Formalizing Theoretical Domains

matrix_order_four_mem_spectrum_of_eigenpair

theoremverified

A nonzero complex eigenvector witnesses membership in the spectrum of an order-four real matrix.

Statement

theorem matrix_order_four_mem_spectrum_of_eigenpair
    (L : Matrix (Fin 4) (Fin 4) ℝ) (v : Fin 4 → ℂ) (hv0 : v ≠ 0) (z : ℂ)
    (hv : (L.map (algebraMap ℝ ℂ)).mulVec v = z • v) :
    z ∈ spectrum ℂ (L.map (algebraMap ℝ ℂ))
Source
Sector-bound formalization for IN-166; arXiv:math/0508176, Theorem 5.
Verified
27 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Used by 1

The proof, explained

The proof reduces membership in the matrix spectrum to showing that the scalar is an eigenvalue of the associated linear operator. By standard spectral theory, exhibiting an eigenvector suffices to certify an eigenvalue, which in turn lies in the spectrum. The given equation and nonzeroness condition directly confirm that the vector is an eigenvector.

  1. It suffices to show that v is an eigenvector of the linear map induced by the complexified matrix with eigenvalue z.

    The spectrum of the complexified matrix coincides with that of its associated linear endomorphism on ℂ⁴ by Matrix.spectrum_toLin'. Any eigenvalue of an endomorphism belongs to its spectrum (Module.End.HasEigenvalue.mem_spectrum), and exhibiting a nonzero vector satisfying the eigenvector condition suffices to show that z is an eigenvalue (Module.End.hasEigenvalue_of_hasEigenvector with witness v).

    lines 5–7

    uses Matrix.spectrum_toLin', Module.End.HasEigenvalue.mem_spectrum, Module.End.hasEigenvalue_of_hasEigenvector

      rw [← Matrix.spectrum_toLin']
      apply Module.End.HasEigenvalue.mem_spectrum
      apply Module.End.hasEigenvalue_of_hasEigenvector (x := v)
  2. v is an eigenvector of the induced linear endomorphism for the eigenvalue z.

    An eigenvector is defined as a nonzero vector in the eigenspace. Hypothesis hv asserts the linear equation L v = z • v, which places v in the eigenspace of z by Module.End.mem_eigenspace_iff.mpr, and hypothesis hv0 provides v ≠ 0. Pairing these two facts establishes that v is an eigenvector.

    line 8

    uses Module.End.mem_eigenspace_iff.mpr

      exact ⟨Module.End.mem_eigenspace_iff.mpr hv, hv0⟩
Matrix.spectrum_toLin'
The spectrum of a square matrix equals the spectrum of its induced linear map on coordinate space.
Module.End.HasEigenvalue.mem_spectrum
An eigenvalue of a linear endomorphism belongs to its spectrum.
Module.End.hasEigenvalue_of_hasEigenvector
A linear endomorphism has an eigenvalue whenever it has an eigenvector for that scalar.
Module.End.mem_eigenspace_iff.mpr
If an endomorphism maps a vector to a scalar multiple of itself, the vector belongs to the corresponding eigenspace.

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

theorem matrix_order_four_mem_spectrum_of_eigenpair    (L : Matrix (Fin 4) (Fin 4) ℝ) (v : Fin 4 → ℂ) (hv0 : v ≠ 0) (z : ℂ)    (hv : (L.map (algebraMap ℝ ℂ)).mulVec v = z • v) :    z ∈ spectrum ℂ (L.map (algebraMap ℝ ℂ)) := by  rw [← Matrix.spectrum_toLin']  apply Module.End.HasEigenvalue.mem_spectrum  apply Module.End.hasEigenvalue_of_hasEigenvector (x := v)  exact ⟨Module.End.mem_eigenspace_iff.mpr hv, hv0⟩
See it in the graphDiscuss this resultChallenge it