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-Dimensional CAR Algebra over an Inner-Product Space

Definition

Let F be a finite-dimensional complex inner-product space, with the pairing linear in its first variable and conjugate-linear in its second. The algebraic CAR ∗-algebra over F, denoted CARalg(F), is generated by symbols c(f), one for each f∈F, subject to complex linearity in f and the relations

{c(f),c(g)}=0,{c(f)∗,c(g)∗}=0,{c(f)∗,c(g)}=⟨g,f⟩1(f,g∈F),

where {x,y}=xy+yx. Precisely, take the free unital complex ∗-algebra on symbols c(f), with formal adjoints, and quotient by the two-sided ∗-ideal generated by these relations and the linearity relations. The quotient has the universal property that every complex-linear family C(f) in a unital complex ∗-algebra satisfying the displayed relations induces a unique unital ∗-homomorphism from CARalg(F).

If e1,…,en is an orthonormal basis of F, the elements aj:=c(ej)∗ and aj†:=c(ej) satisfy the finite-mode relations of Finite-Mode Complex CAR Algebra. The algebraic definition does not choose a basis; its finite-dimensional matrix realization is established in Finite-Dimensional CAR over an Inner-Product Space Is a Matrix Algebra.

Depends on

Used by

Dependency tree · two levels

5 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