Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

Self-adjoint positive unitary and normal elements

Definition

Let A be a complex C*-algebra (C star algebra) and let aA.

  • a is self-adjoint when a=a;
  • a is normal when aa=aa;
  • a is positive when a=bb for some bA. (At this stage positivity is a purely algebraic condition; its pointwise description as nonnegativity of the transformed function is proved later, from Nonunital commutative Gelfand Naimark.)

If in addition A is unital, with unit 1 (Unital Banach algebra), then:

  • a is unitary when aa=aa=1.

No unitary notion is claimed here for a genuinely nonunital C*-algebra, where the equation uu=uu=1 has no solution since a noninvertible element cannot satisfy it and a left identity in a C*-algebra is an identity, forcing unitality.

Remarks

  • Self-adjoint elements are normal, since aa=aa=a2=aa when a=a; and bb is self-adjoint for every b, because (bb)=bb.
  • The real and imaginary parts. Every a can be written a=s+it with s:=12(a+a) and t:=12i(aa) self-adjoint; both identities are algebraic, and they are the decomposition used in Characters on a unital commutative C star algebra preserve star.
  • Positivity is preserved by star-homomorphisms, since φ(bb)=φ(b)φ(b); no positivity notion outside the given algebra is imported.

Depends on

Used by

Dependency tree · two levels

7 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