Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Exponential dichotomy for a hyperbolic endomorphism: invariant stable and unstable subspaces with exponential estimates

Statement

Let V be a real vector space of finite dimension n≥1, equipped with a symmetric positive-definite bilinear form ⟨⋅,⋅⟩:V×V→R, and set ∥v∥2:=⟨v,v⟩. Let T:V→V be linear, let VC:=C⊗RV with canonical embedding ιv:=1⊗v and complex-linear extension TC:=id⁡C⊗T (Complexification as C⊗RV with its canonical real-linear embedding, Complexification of a real-linear map), and use the exponential series etT and etTC of these bounded operators (The exponential series of a bounded operator; boundedness is justified in [F1]). Suppose that no eigenvalue of TC in the sense of Eigenvalues, eigenvectors, eigenspaces Eλ(T)=ker⁡(T−λI), and the spectrum σF(T) of an endomorphism has real part 0.

Then there exist T-invariant linear subspaces Es,Eu⊆V and real constants C≥1, c>0 such that V=Es⊕Eu and, for every t∈R:

  1. ∥etTv∥2≤Ce−ct∥v∥2 for v∈Es and t≥0;
  2. ∥etTv∥2≤Cect∥v∥2 for v∈Eu and t≤0;
  3. ∥etTv∥2≥C−1ect∥v∥2 for v∈Eu and t≥0;
  4. Es={v∈V:etTv→0 (t→+∞)} and Eu={v∈V:etTv→0 (t→−∞)}.

Facts & Assumptions

Given: The finite-dimensional real vector space V with its symmetric positive-definite bilinear form, the linear map T, its complexification TC, and the assumption that no complex eigenvalue of TC is purely imaginary.

[F1]

The real spectral theorem applied to id⁡V supplies a real orthonormal basis of V (Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis). In that basis every element of VC has a unique form x+iy:=ιx+iιy, with x,y∈V. Define ⟨x+iy,x′+iy′⟩C:=⟨x,x′⟩+⟨y,y′⟩+i(⟨y,x′⟩−⟨x,y′⟩) and ∥x+iy∥2,C:=(∥x∥22+∥y∥22)1/2; this is the induced Hermitian inner product and norm, and ι is isometric. These coordinates identify V with Rn and VC with R2n, so both spaces are complete (R and Rn for n≥1 with the Euclidean metric are complete, componentwise from the Cauchy criterion in R, C is the real coordinate plane, with coordinate arithmetic). If a linear map has coordinate matrix L=(Lij), Cauchy--Schwarz row by row gives ∥Lz∥22≤(∑i,j∣Lij∣2)∥z∥22 in the corresponding real coordinates (Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation); hence T and TC are bounded. Thus the exponential-series lemma applies to both; it gives absolute operator-norm convergence, E(0)=id⁡, E(s+t)=E(s)E(t), E(t)−1=E(−t) and E′(t)=TCE(t)=E(t)TC. Termwise application of TCmι=ιTm gives E(t)ι=ιetT (The exponential series of a bounded operator, Complexification as C⊗RV with its canonical real-linear embedding, Complexification of a real-linear map).

[F2]

The minimal polynomial μT∈R[x] annihilates T, the characteristic polynomial satisfies χTC=χT, and μT and χT have the same irreducible factors over C; every nonconstant complex polynomial splits into linear factors, so the eigenvalues of TC are exactly the complex roots of μT, each with a positive multiplicity eλ equal to its multiplicity as a root of μT (The annihilator set Ann⁡(T)={p∈F[x]:p(T)=0}; once existence is proved, its unique monic generator μT is the minimal polynomial, Complexification preserves the characteristic and minimal polynomials of a finite-dimensional real operator, The minimal and characteristic polynomials have exactly the same monic irreducible factors, Fundamental theorem of algebra: every nonconstant complex polynomial has a complex root, Eigenvalues, eigenvectors, eigenspaces Eλ(T)=ker⁡(T−λI), and the spectrum σF(T) of an endomorphism).

[F3]

Since μTC=μT splits over C, the generalised eigenspaces Gλ=ker⁡(TC−λ) eλ over the distinct eigenvalues λ of TC form a direct sum decomposition VC=⨁λGλ, each Gλ being TC-invariant (If the minimal polynomial splits, V is the direct sum of the stabilised generalised eigenspaces). On each Gλ the operator admits a Jordan basis, so TC∣Gλ=λI+Nλ with Nλ nilpotent of index at most eλ (Jordan canonical form from the elementary divisors of VT).

[F4]

Coprime polynomials satisfy a Bézout identity: if p,q∈F[x] have no common root, there are a,b∈F[x] with ap+bq=1 (Bézout identity and the Euclidean algorithm for polynomials over a field).

[F5]

The Hermitian norm ∥⋅∥2,C is the norm defined in [F1]. Any two norms on the finite-dimensional complex vector space VC are equivalent (All norms on a finite-dimensional complex normed space are equivalent, Equivalent norms, and the dictionary with equivalent metrics): there is K≥1 such that K−1∥z∥∞≤∥z∥2,C≤K∥z∥∞ for every z∈VC, where ∥⋅∥∞ is the maximum norm of the basis fixed in step 2.3. In particular, ∥ιv∥2,C=∥v∥2.

Proof

technique · direct; split the spectrum into left and right half-planes, build the corresponding real invariant subspaces from coprime factors of the minimal polynomial, and estimate each Jordan block by its exponential series
1.1givenF2F4

Let Λ be the set of eigenvalues of TC and, for λ∈Λ, let eλ≥1 be its multiplicity as a root of the real polynomial μT; by [F2] all elements of Λ have nonzero real part, and Λ is stable under conjugation with eλˉ=eλ: conjugating μT=(x−λ)eλq with q(λ)≠0 gives μT=(x−λˉ)eλqˉ with qˉ(λˉ)≠0. Define ps:=∏Re⁡λ<0(x−λ)eλ,pu:=∏Re⁡λ>0(x−λ)eλ. Conjugation invariance of Λ with equal multiplicities shows ps,pu∈R[x]; by construction μT=pspu, and ps,pu have no common complex root, hence are coprime with a Bézout identity aps+bpu=1 over R[x] [F4].

1.2F1F3algebra

Exponential on a generalised eigenspace: fix λ∈Λ and put Aλ:=λI+Nλ on Gλ with Nλ eλ=0 as in [F3]. For the partial sum through m=M, the binomial expansion and nilpotence of Nλ give the finite rearrangement ∑m=0Mtmm!Aλm=∑k=0eλ−1tkk!Nλ k∑j=0M−k(tλ)jj!, with an empty inner sum when M<k. As M→∞, the left side converges to etAλ by [F1], and each of the finitely many inner sums converges to etλ by exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0. Thus etAλ=∑k=0eλ−1tkk!Nλ k etλ.

2.1step 1.1F2F4algebra

Define Es:=ker⁡ps(T) and Eu:=ker⁡pu(T). Both are T-invariant because T commutes with ps(T) and pu(T). Every v∈V satisfies v=(aps+bpu)(T)v=a(T)ps(T)v+b(T)pu(T)v∈Eu+Es, the membership following from pu(T)a(T)ps(T)=a(T)μT(T)=0 on the first summand and ps(T)b(T)pu(T)=b(T)μT(T)=0 on the second, where μT(T)=0 (The annihilator set Ann⁡(T)={p∈F[x]:p(T)=0}; once existence is proved, its unique monic generator μT is the minimal polynomial). If v∈Es∩Eu, the same identity gives v=a(T)ps(T)v+b(T)pu(T)v=0. Hence V=Es⊕Eu.

2.2step 1.1F3F4algebra

Complexified description: (Es)C=ker⁡ps(TC)=⨁Re⁡λ<0Gλ and (Eu)C=ker⁡pu(TC)=⨁Re⁡λ>0Gλ. Writing z=ιx+iιy with x,y∈V, one has ps(TC)z=ι(ps(T)x)+iι(ps(T)y), so ker⁡ps(TC)=(ker⁡ps(T))C; the same holds for pu. Indeed, on a summand Gλ with Re⁡λ<0, the factor (x−λ)eλ divides ps, so ps(TC) vanishes on Gλ; on a summand with Re⁡λ>0, ps and (x−λ)eλ are coprime, and evaluating a Bézout identity on Gλ (where (TC−λ)eλ=0) shows ps(TC) is invertible there, so its kernel meets Gλ trivially. Summing over [F3] gives the claim; the same argument with pu gives the second identity.

2.3step 1.2F1algebra

Estimates on one generalised eigenspace: fix a basis of VC adapted to the decomposition VC=⨁λGλ (for instance the union of Jordan bases of the summands, whose existence is [F3]), and let ∥⋅∥∞ be the corresponding maximum norm; then every z=∑λzλ has its coordinate block in Gλ equal to the coordinate block of zλ, so ∥zλ∥∞≤∥z∥∞ for every λ. On each block use the induced operator norm ∥Nλ∥∞:=sup⁡{∥Nλz∥∞:z∈Gλ, ∥z∥∞≤1}; this is finite for a finite matrix. Put Pλ(t):=∑k=0eλ−1∣t∣kk!∥Nλ∥∞ k, so that ∥etAλz∥∞≤e(Re⁡λ)tPλ(t)∥z∥∞ for z∈Gλ and all real t by step 1.2. Choose c:=12min⁡λ∈Λ∣Re⁡λ∣>0. For u≥0 and a>0, the nonnegative exponential series gives eau≥(au)k/k!, hence uke−au≤k!a−k for every integer k≥0. Applying this to each term of Pλ(±u), with a=−Re⁡λ−c>0 on stable blocks and a=Re⁡λ−c>0 on unstable blocks, proves that the following suprema are finite: for Re⁡λ<0, Cλs:=sup⁡t≥0Pλ(t)e(Re⁡λ+c)t<+∞, and for Re⁡λ>0, Cλu:=sup⁡t≤0Pλ(t)e(Re⁡λ−c)t<+∞.

3.1step 2.22.3F1F5algebra

Constants for the two invariant subspaces. By steps 2.2 and 2.3, for z∈(Es)C and t≥0 the decomposition z=∑Re⁡λ<0zλ yields ∥etTCz∥∞≤∑Re⁡λ<0e(Re⁡λ)tPλ(t)∥zλ∥∞≤e−ct(∑Re⁡λ<0Cλs)∥z∥∞, since, in the adapted basis of step 2.3, ∥zλ∥∞≤∥z∥∞, and Re⁡λ+c≤−c for every Re⁡λ<0 (as c=12min⁡∣Re⁡λ∣). Similarly, for z∈(Eu)C and t≤0, ∥etTCz∥∞≤ect(∑Re⁡λ>0Cλu)∥z∥∞. Set C:=max⁡(1, K2∑Re⁡λ<0Cλs, K2∑Re⁡λ>0Cλu) with K as in [F5]. For v∈Es and t≥0, applying the first estimate to z=ιv and using [F5] in both directions, ∥etTv∥2=∥etTCιv∥2,C≤K∥etTCιv∥∞≤Ke−ct(∑Re⁡λ<0Cλs)∥ιv∥∞≤K2(∑Re⁡λ<0Cλs)e−ct∥v∥2≤Ce−ct∥v∥2, which is clause 1; the same computation with the second estimate gives clause 2 for v∈Eu, t≤0.

4.1step 3.1F1algebra

Clause 3: let u∈Eu and t≥0. By [F1] etT is invertible with inverse e−tT, and e−tTu∈Eu because Eu is T-invariant. Applying clause 2 with the time −t≤0 to the vector etTu gives ∥u∥2=∥e−tTetTu∥2≤Ce−ct∥etTu∥2, hence ∥etTu∥2≥C−1ect∥u∥2.

5.1step 3.14.1F1algebra∎

Clause 4: by clauses 1 and 3, every v∈Es satisfies etTv→0 as t→+∞, and by clause 2 every v∈Eu satisfies etTv→0 as t→−∞. Conversely, let v∈V satisfy etTv→0 as t→+∞ and write v=u+s with u∈Eu, s∈Es; by clauses 3 and 1, ∥etTv∥2≥∥etTu∥2−∥etTs∥2≥C−1ect∥u∥2−Ce−ct∥s∥2→+∞ unless u=0. So convergence to 0 forces u=0, that is v∈Es. The characterisation of Eu follows by the same argument with t→−∞: clause 2 gives ∥etTu∥2≤Cect∥u∥2→0 for u∈Eu, while for s≠0 the growth estimate ∥etTs∥2≥C−1e−ct∥s∥2 for t≤0, obtained from clause 1 at time −t≥0 and invertibility of etT, forces divergence.

Remarks

Depends on

Dependency tree · 2 levels

Sources