Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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.

Finite-dimensional matrix exponential

Definition

Let d≥1. Regard Cd as column vectors with the standard complex inner product ⟨x,y⟩:=∑j=1dxjyj‾, linear in the first argument, and induced norm ∥x∥=(∑j=1d∣xj∣2)1/2. A matrix A=(aij)∈Md(C) acts by (Ax)i=∑j=1daijxj, and its adjoint for this inner product is A∗=A‾T.

For A∈Md(C) and z∈C, define the finite-dimensional matrix exponential by ezA:=∑k=0∞zkAkk!,A0=Id. The scalar exponential convention is exp⁡w=∑k≥0wk/k!.

Every matrix B=(bij)∈Md(C) is bounded on Cd: since ∣xj∣≤∥x∥, one has ∥Bx∥2≤∑i=1d(∑j=1d∣bij∣)2∥x∥2. Thus its operator norm is defined by the unit-ball supremum in the operator-norm definition listed in Definition references. For B,C∈Md(C) and ∥x∥≤1, the operator-norm bound gives ∥BCx∥≤∥B∥∥Cx∥≤∥B∥∥C∥; taking the supremum proves ∥BC∥≤∥B∥∥C∥. Since d≥1, the coordinate vector e1 with first entry 1 and other entries 0 is a unit vector, so ∥Id∥=1. Homogeneity and the triangle inequality follow from the unit-ball supremum, and ∥B∥=0 forces Bej=0 for each coordinate vector ej (with entry 1 at j and 0 elsewhere), hence B=0. Therefore Md(C) with this operator norm is a normed C-vector space; the matrices Eij with entry 1 at (i,j) and 0 elsewhere form a basis of size d2.

Completeness of the complex plane and finite-dimensional norm equivalence (the two theorems in Definition references) make Md(C) complete in this operator norm. By induction and submultiplicativity, ∥Ak∥≤∥A∥k for every k≥1, while ∥A0∥=1. The scalar series ∑k≥0(∣z∣∥A∥)k/k! converges by the scalar exponential convergence lemma in Definition references. Hence for m>n, ∥∑k=n+1mzkAkk!∥≤∑k=n+1m(∣z∣∥A∥)kk!⟶0(n→∞). The partial sums are Cauchy, so completeness gives their operator-norm limit; the same estimate proves absolute convergence in operator norm.

Depends on

Dependency tree · 2 levels

Sources