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

Fermionic Fock Space over a Complex Hilbert Space

Definition

Assume Countable Choice (The Axiom of Countable Choice (ACω)), and let H be a complex Hilbert space. For each k≥0, let ΛkH be the Hilbert exterior power with the Gram-determinant inner product and wedge convention of Hilbert exterior powers and induced operators, with Λ0H=C. The algebraic direct sum X0=⨁k≥0algΛkH, where distinct particle-number summands are orthogonal and the inner product on a finite sum is the sum of the component inner products, is an inner-product space. Its norm completion exists under Countable Choice by Every metric space has a completion, constructed as the equivalence classes of its Cauchy sequences and has its compatible Banach-space and Hilbert-space structures by The metric completion of a normed space carries a unique compatible Banach-space structure and The norm completion of an inner-product space is a Hilbert space. The fermionic Fock space over H is this Hilbert completion. The vacuum vector Ω is the image of 1∈Λ0H in the completion.

On finite sums of decomposable wedges define the creation rule C(f)ξ=f∧ξ for f∈H. This rule is initially defined on a dense subspace. Its bounded extension and the CAR relations for C(f) and its Hilbert-space adjoint are proved in Fock Creation and Annihilation Operators Satisfy the CAR.

Depends on

Used by

Dependency tree · two levels

56 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