Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-22
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.

Minimal C star unitization

Statement

Assume AC (The Axiom of Choice). Let A be a nonzero C*-algebra (C star algebra) that is genuinely nonunital, that is, not unital. With A+=A⊕C the algebraic unitization (Algebraic unitization of a star algebra), define for (a,λ)∈A+ the operator La+λI∈B(A), where La(b):=ab, and put

∥(a,λ)∥A+  :=  ∥La+λI∥B(A).

Then:

  1. this is a C*-algebra norm on A+ extending the norm of A, and A+ becomes a unital C*-algebra in which A is a closed two-sided ∗-ideal of codimension one;
  2. uniqueness over A: if ∥⋅∥′ is any C*-algebra norm on the same algebra A+ with the same involution whose restriction to A is the given norm of A, then ∥⋅∥′=∥⋅∥A+;
  3. if A={0} is the zero algebra then A+=C with its usual structure and norm.

Facts & Assumptions

Given: AC and a nonzero genuinely nonunital C*-algebra A, its algebraic unitization A+, the left-multiplication operators La on A, and the operator norm on B(A).

[L1]

∥x∗x∥=∥x∥2, ∥x∗∥=∥x∥, and the norm is submultiplicative; multiplication is associative and bilinear (C star algebra).

[L2]

A+=A⊕C with product (a,λ)(b,μ)=(ab+λb+μa,λμ) and involution (a,λ)∗=(a∗,λ‾), and 1=(0,1) is the identity (Algebraic unitization of a star algebra).

[L3]

The bounded operators on a Banach space form a Banach space under the operator norm (If (Y) is Banach then (\mathcal B(X,Y)) is Banach). Composition is submultiplicative: ∥STb∥≤∥S∥∥T∥∥b∥ for each b, and taking the unit-ball supremum gives ∥ST∥≤∥S∥∥T∥. The required normalization for a nonzero unital Banach algebra is ∥1∥=1 (Unital Banach algebra).

[L4]

Under AC, in a unital C*-algebra, r(y)=∥y∥ for every normal y; the spectrum of an element of a unital algebra is determined by the algebra structure, since invertibility is an algebraic condition (C star spectral radius equals norm for normal elements, Spectrum and resolvent set in a Banach algebra, Spectral radius).

[A1]

Assume AC (The Axiom of Choice), used for the spectral-radius interfaces and, when passing from closure to sequential approximation, countable choices.

Proof

technique · direct
1.1L1L3A1algebra

For a∈A one has ∥La∥=∥a∥: the inequality ∥Lab∥≤∥a∥ ∥b∥ gives ∥La∥≤∥a∥, while ∥Laa∗∥=∥aa∗∥=∥a∥2 gives ∥La∥≥∥a∥2/∥a∗∥=∥a∥ when a≠0, and the case a=0 is trivial; in particular L is an injective linear isometry, so L(A) is a closed subspace of B(A): a point in its closure admits approximants Lan at distance less than 1/(n+1) by AC, the isometry makes (an) Cauchy, and completeness gives a limit in A with that operator image.

1.2

The map φ:A+→B(A), φ(a,λ):=La+λI, is complex-linear and multiplicative with φ((a,λ)(b,μ))=φ(a,λ)φ(b,μ) for all (a,λ),(b,μ)∈A+, and φ(0,1)=I, where the multiplicativity is the computation φ(a,λ)φ(b,μ)(c)=a(bc+μc)+λ(bc+μc)=(ab+λb+μa)c+λμc=φ((a,λ)(b,μ))(c) [L2, algebra].

2.1step 1.1step 1.2L1L2algebra

The map φ of [step 1.2] is injective when A is genuinely nonunital: if La+λI=0 with λ≠0 then ab=−λb for all b, so e:=−a/λ satisfies eb=b for all b, that is, e is a left identity. Taking adjoints in eb=b gives b∗e∗=b∗ for every b, and every element of A is of the form b∗, so e∗ is a right identity. Applying the left identity to b=e∗ gives ee∗=e∗, and applying the right identity to b=e gives ee∗=e; hence e=e∗ is a two-sided identity of A, a contradiction, and if λ=0 then La=0 forces a=0 by [step 1.1].

3.1step 1.1step 2.1L3L5A1algebra

Put d=inf⁡S∈L(A)∥I−S∥. By step 2.1, I∉L(A), and by step 1.1 this subspace is closed, so some open ball about I is disjoint from it and d>0. For T=La+λI one has ∣λ∣d≤∥T∥: this is immediate for λ=0, and otherwise divide by λ and use −La/λ∈L(A). If Tn=Lan+λnI converges in B(A), applying this bound to differences makes (λn) Cauchy in C, with limit λ by [L5]. Then Lan=Tn−λnI converges into the closed subspace L(A). Its limit is La for some a, and the limit of Tn is La+λI. Thus M=L(A)+CI is sequentially closed, hence closed: under AC any point in its closure has a sequence at distances less than 1/(n+1). No compact-subsequence argument is needed.

3.2step 1.2step 2.1L1L2algebra

On M, the map σ(T):=La∗+λ‾I for T=La+λI is well defined (by injectivity from [step 2.1]) and involutive with σ(σ(T))=T; and for every T∈M one has ∥T∥2≤∥σ(T)T∥ and σ(T)T=φ(x∗x) if T=φ(x): for b∈A, ∥Tb∥2=∥(Tb)∗(Tb)∥=∥b∗σ(T)Tb∥≤∥b∥2∥σ(T)T∥ using [L1], and the identity σ(T)T=φ(x∗x) is multiplicativity of φ from [step 1.2] combined with the involution of [L2].

3.3step 1.2step 2.1L1L2algebra

The involution σ is contractive for the operator norm. Write T=φ(x) and let b∈A; put y:=σ(T)b=x∗b. Then ∥y∥2=∥y∗y∥=∥b∗xx∗b∥=∥b∗Ty∥≤∥b∥ ∥T∥ ∥y∥ by [L1]. If y≠0, cancellation gives ∥σ(T)b∥≤∥T∥ ∥b∥, while the same inequality is trivial for y=0. Taking the supremum over the unit ball gives ∥σ(T)∥≤∥T∥.

4.1step 2.1step 3.1step 3.2step 3.3L1L3algebra

The norm ∥(a,λ)∥A+:=∥φ(a,λ)∥ makes φ an isometry onto the closed subspace M of the Banach space B(A), so A+ is a Banach space with a submultiplicative norm (both transported along the isometric algebra isomorphism φ); and the C*-identity holds: for x=(a,λ), ∥x∥2=∥φ(x)∥2=∥σ(φ(x))φ(x)∥=∥φ(x∗x)∥=∥x∗x∥. Indeed, [step 3.2] supplies the first inequality ∥φ(x)∥2≤∥σ(φ(x))φ(x)∥, while submultiplicativity and [step 3.3] supply the reverse inequality ∥σ(φ(x))φ(x)∥≤∥σ(φ(x))∥ ∥φ(x)∥≤∥φ(x)∥2.

5.1step 1.1step 4.1L2algebra

The norm of [step 4.1] extends the norm of A: ∥(a,0)∥A+=∥La∥=∥a∥ by [step 1.1]; the element (0,1) is a unit of norm one, since φ(0,1)=I has operator norm one; and A⊕{0} is a closed two-sided ∗-ideal of codimension one by the algebra identities of [L2] and the isometry of [step 1.1].

5.2step 4.1L4algebra

Uniqueness of the norm: let ∥⋅∥′ be a C*-norm on A+ extending the norm of A. The algebraic unit is self-adjoint, so its positive primed norm satisfies ∥1∥′2=∥1∗1∥′=∥1∥′ and hence equals one. Thus the normalized unital hypothesis of [L4] holds for both norms. For x=(a,λ) the element y:=x∗x=(c,∣λ∣2) with c:=a∗a+λ‾a+λa∗ is self-adjoint, hence normal, in the unital C*-algebra (A+,∥⋅∥′), so ∥y∥′=r′(y) by [L4]; and the spectrum of y in the unital algebra A+ is independent of the norm, so r′(y)=r(y), where r is computed with the norm of [step 4.1]; applying the same identity with the operator norm gives ∥x∥2=∥y∥=r(y)=r′(y)=∥y∥′=∥x∥′2, hence ∥⋅∥′=∥⋅∥A+.

6.1step 4.1step 5.1step 5.2L2L5∎

Claims 1, 2 and 3 are proved: [step 4.1] and [step 5.1] give the C*-algebra structure with A as a closed ideal of codimension one, [step 5.2] gives uniqueness of the norm among C*-norms extending the norm of A, and the zero algebra case is separate: [L2] identifies A+ with C, whose modulus is complete and satisfies the C*-identity by [L5]. The operator norm on B({0}) is not used. If a C*-norm on this scalar algebra is required, complex homogeneity and the unit C*-identity force ∥λ∥=∣λ∣∥1∥=∣λ∣, so its usual norm is unique.

Remarks

  • Genuine nonunitality is exactly what makes φ injective. If A were unital with unit 1A, then L1A−I=0 and the representation would identify (1A,−1) with 0.
  • The norm is minimal, not merely canonical. Any other C*-norm extending the norm of A has the same values, by [step 5.2]; the two ingredients are the algebraic invariance of the spectrum and the equality r=∥⋅∥ for normal elements.

Depends on

Dependency tree · 2 levels

Sources