Simultaneous rank-one canonical form and converse
OpenQAlgorithms.Papers.Independent.Intakenext100.P41.rationalCanonicalFormLet . Suppose that has simple spectrum and , with , is in general position with : annihilates no eigenvector, and its range has a nonzero component along every eigenline. There is an invertible change of basis in which is the companion matrix with superdiagonal ones and last row , has only its last row nonzero, and is the companion matrix with last row . Moreover . Writing
we have and . Conversely, for matrices in this displayed form, if and has simple spectrum,
This is a simultaneous algebraic normal form; no ODE nonresonance is assumed. The plus sign in the characteristic polynomial corrects the printed minus sign, as forced by the displayed matrix subtraction.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P41
noncomputable section
open scoped BigOperators
open MeasureTheory Set
namespace QAlgorithms.Papers.Independent.Intakenext100.P41
/-- §20 rational canonical form, PDF pp.26–27: simultaneous forms and both
converse equivalences. The displayed matrix c_i=a_i−b_i forces
char(P−Q)=a(t)+b(t); the printed c(t)=a(t)−b(t) has the opposite sign.
No ODE nonresonance is assumed in this purely algebraic result. -/
theorem rationalCanonicalForm (d : ℕ) (hd : 0 < d) :
(∀ (P Q : Matrix (Fin d) (Fin d) ℂ),
(∃ (v : Fin d → ℂ) (phi : (Fin d → ℂ) →ₗ[ℂ] ℂ),
phi v ≠ 0 ∧ Q = linearRankOneMatrix v phi) →
RankOneGeneralPosition P Q →
∃ (C : Matrix (Fin d) (Fin d) ℂ) (a b : Fin d → ℂ),
C.det ≠ 0 ∧ C⁻¹ * P * C = companionMatrix a ∧
C⁻¹ * Q * C = lastRowMatrix b ∧
C⁻¹ * (P - Q) * C = companionMatrix (fun i => a i - b i) ∧
b ⟨d - 1, by omega⟩ = Matrix.trace Q ∧ b ⟨d - 1, by omega⟩ ≠ 0 ∧
P.charpoly = companionPolynomial a ∧
(P - Q).charpoly = companionPolynomial a + rowPolynomial b) ∧
(∀ (a b : Fin d → ℂ), b ⟨d - 1, by omega⟩ ≠ 0 →
HasSimpleSpectrum (companionMatrix a) →
(RankOneGeneralPosition (companionMatrix a) (lastRowMatrix b) ↔
NoCommonRoot (companionPolynomial a) (rowPolynomial b)) ∧
(NoCommonRoot (companionPolynomial a) (rowPolynomial b) ↔
NoCommonRoot (companionPolynomial a) (companionPolynomial a + rowPolynomial b)) ∧
(companionMatrix a - lastRowMatrix b).charpoly =
companionPolynomial a + rowPolynomial b) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P41
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number satisfying , define , for , to have last row , entries in positions for , and zero entries elsewhere; define to have last row and zero entries elsewhere; and put and . For matrices , let mean that there exist a complex basis of and pairwise distinct complex numbers such that, for every , , , and there exists whose image has nonzero -th coordinate in the basis . The theorem asserts both of the following universally quantified claims. First, for every , if there exist and a complex-linear functional such that and for every , where is the -th standard basis vector, and if holds, then there exist and satisfying
where and denotes the characteristic polynomial of . Second, for every , if and there exist a complex basis of and pairwise distinct complex numbers with for every , then all three assertions
hold. The positive-dimension hypothesis excludes and makes the index valid.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.