Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 matrix algebras with the operator norm are C star algebras

Statement

Let n≥1, let Hn=Cn with inner product ⟨x,y⟩=∑j=1nxjyj‾ and induced Euclidean norm, and let Mn(C) act on Hn by matrix multiplication. Give it the conjugate-transpose involution a∗=a‾T and the operator norm ∥a∥=sup⁡{∥ax∥2:x∈Hn, ∥x∥2≤1}. Then Mn(C)=B(Hn) is a unital complex C*-algebra.

Facts & Assumptions

Given: An integer n≥1, the standard basis of Hn=Cn, and the stated inner product, matrix operations, involution, and operator norm.

[F1]

Real and complex inner-product spaces and their induced length: a complex inner product is linear in its first variable and conjugate-linear in its second; its induced norm is ∥x∥=⟨x,x⟩.

[F2]

The operator norm as the least bound and as the unit-sphere or unit-ball supremum: for a bounded linear map, the operator norm is the supremum on the unit ball; rescaling gives the bound ∥Tx∥≤∥T∥ ∥x∥.

[F3]

Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs: ∣⟨x,y⟩∣≤∥x∥ ∥y∥ for vectors in a real or complex inner-product space.

[F4]

Every finite-dimensional normed space is Banach: a normed complex vector space with a finite ordered basis is complete.

[F5]

C star algebra: a complex C*-algebra is a complete complex normed associative algebra with submultiplicative norm and a conjugate-linear involution satisfying (ab)∗=b∗a∗ and ∥a∗a∥=∥a∥2.

[F6]

C=R[x]/(x2+1) is a field, every element is uniquely a+bi, and every nonzero element has inverse (a−bi)/(a2+b2) and Real and imaginary parts, complex conjugation, and modulus: z=a+bi has conjugate a−bi and modulus a2+b2; the displayed coordinate addition and multiplication laws give the conjugation identities used below.

[F7]

The induced length is a norm: the length induced by an inner product is a norm, so it satisfies absolute homogeneity and the triangle inequality; these properties are used for the Euclidean vector norm below.

Proof

Given: The data above, with n≥1.

1.1givenF1F3F6constructalgebra

By distributing finite sums the displayed form is linear in its first variable, and conjugating the sum gives ⟨x,y⟩=⟨y,x⟩‾. Also ⟨x,x⟩=∑j∣xj∣2 is nonnegative and zero only for x=0, by [F6]. Thus it satisfies the complex inner-product conditions [F1]. The matrix units Eij form a basis of the complex vector space Mn(C). Matrix multiplication is bilinear by its coordinate formula, has unit In, and is associative because both (a(bc))ij and ((ab)c)ij equal ∑k,laikbklclj. Entrywise conjugation and transposition make a↦a∗ conjugate-linear and give (a∗)∗=a and (ab)∗=b∗a∗: the (i,j) entry of (ab)∗ is ∑kajkbki‾=∑kbki‾ ajk‾, which is the (i,j) entry of b∗a∗ by [F6]. Also ⟨ax,y⟩=⟨x,a∗y⟩ by expanding the finite coordinate sums using [F1] and [F6]. The coordinate formula makes x↦ax complex-linear. For each row i, apply [F3] to (ai1,…,ain) and (x1‾,…,xn‾) to get ∣∑jaijxj∣2≤(∑j∣aij∣2)∥x∥22, so ∥ax∥22≤(∑i,j∣aij∣2)∥x∥22 and every matrix action is bounded. Conversely, every linear map on Hn is represented by its columns in this basis. Hence Mn(C)=B(Hn).

2.1F1F2F3F7step 1.1algebra

For a,b∈Mn(C) and ∥x∥2≤1, rescaling the unit-ball definition [F2] gives ∥abx∥2≤∥a∥ ∥bx∥2≤∥a∥ ∥b∥, so taking the supremum yields ∥ab∥≤∥a∥ ∥b∥. For any matrix a, [F3] and the adjoint identity in step 1.1 show sup⁡∥x∥2,∥y∥2≤1∣⟨ax,y⟩∣=∥a∥=∥a∗∥: the inner supremum over y equals ∥ax∥2 (choose y=ax/∥ax∥2 if ax≠0, which has unit norm by [F7]), and the adjoint identity swaps the two unit-ball suprema. Therefore ∥a∗a∥≤∥a∗∥ ∥a∥=∥a∥2. For every unit vector x, ∥ax∥22=⟨ax,ax⟩=⟨x,a∗ax⟩≤∥a∗ax∥2≤∥a∗a∥ by [F1] and [F3]; taking the supremum over the nonempty unit sphere gives the reverse inequality ∥a∥2≤∥a∗a∥. Thus the C*-identity holds.

3.1F2F4F5F7step 1.1step 2.1algebra∎

The operator norm is nonnegative by [F2]. The vector norm is absolutely homogeneous by [F7], so the unit-ball formula gives ∥λa∥=∣λ∣∥a∥; its triangle inequality [F7] gives ∥(a+b)x∥2≤∥ax∥2+∥bx∥2 for every unit-ball vector x, hence ∥a+b∥≤∥a∥+∥b∥. If ∥a∥=0, then each basis vector ej has ∥aej∥2=0, so aej=0 by [F7]; all columns vanish and a=0. Conversely, a=0 has norm zero by the definition. Thus the operator norm is a norm. The basis (Eij)1≤i,j≤n is finite, so [F4] makes Mn(C) complete for this norm. Steps 1.1 and 2.1 supply associativity, the unit, the involution, submultiplicativity, and the C*-identity; these are exactly the clauses in [F5]. Since n≥1, In≠0, so the algebra is unital under the library's convention.

Remarks

No choice principle is used. The matrix units, the coordinate estimates, and the finite-dimensional completeness result are all explicit.

Depends on

Used by

Dependency tree · two levels

35 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources