Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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-Mode Complex CAR Algebra

Definition

Fix an integer n≥0. Let Fn be the complex vector space with basis all finite words in the symbols a1,…,an,a1†,…,an†, including the empty word 1. Give Fn concatenation as multiplication and the conjugate-linear involution that reverses each word and exchanges aj with aj†. Thus Fn is the free unital complex ∗-algebra on a1,…,an.

For x,y in an algebra write {x,y}=xy+yx. Let Jn be the smallest two-sided ∗-ideal in Fn containing

{ai,aj},{ai†,aj†},{ai,aj†}−δij1(1≤i,j≤n).

Here a two-sided ∗-ideal is a complex linear subspace closed under left and right multiplication and under ∗. It exists as the intersection of all such ideals containing these relations; the collection is nonempty because it contains Fn. The relations are ∗-stable, since taking adjoints exchanges the first two families and changes the third relation with indices i,j to the same relation with indices j,i. Define the algebraic finite-mode CAR ∗-algebra by CARnalg=Fn/Jn, with generators denoted by the same symbols. Its quotient map gives the universal property: every tuple in a unital complex ∗-algebra satisfying these relations induces a unique unital ∗-homomorphism from CARnalg. For n=0 there are no generators or relations and CAR0alg=C.

This definition is algebraic; the finite-mode universal C*-completion is identified in The Finite-Mode CAR Algebra Is a Full Matrix Algebra.

Used by

Dependency tree · 0 levels

Nothing. This result depends on no other item in the library.

Sources