Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)
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 fermion-mode occupation basis

Statement

Assume Countable Choice. Let K be a finite-dimensional complex Hilbert space with a finite ordered orthonormal basis (ej)j∈J, and use the antisymmetric Fock construction and second-variable-linear convention of Schwartz/distribution spaces and Hilbert Fock conventions. Assume its fermionic operators satisfy the CAR of Bosonic and fermionic Fock operators with exact domains. For S={j1<⋯<jk}⊆J, set ξS=c†(ej1)⋯c†(ejk)Ω,ξ∅=Ω. Then (ξS)S⊆J is an orthonormal basis of Fa(K). For each j∈J, the bounded number operator Nj=c†(ej)c(ej) is an orthogonal projection and NjξS=1j∈SξS. Consequently, for any partition J=⨆x∈VJx into finite site-mode sets, nx=∑j∈JxNj is bounded self-adjoint and acts on ξS by the occupation count Nx(S)=∣S∩Jx∣∈{0,…,∣Jx∣}.

Facts & Assumptions

Given: Countable Choice, the finite-dimensional Hilbert space and ordered basis, the Fock construction, and the CAR operators above.

[A1]

Countable Choice is the principle that every countable family of nonempty sets has a choice function. The Axiom of Countable Choice (ACω)

[F1]

Schwartz/distribution spaces and Hilbert Fock conventions: the antisymmetric Fock space is the square-summable direct sum of the ranges of Pa,k and has vacuum Ω.

[F2]

Schwartz/distribution spaces and Hilbert Fock conventions: creation on sector k is ck†(h)Ψk=k+1Pa,k+1(h⊗Ψk).

[F3]

Bosonic and fermionic Fock operators with exact domains: under Countable Choice and separability, the fermionic creation and annihilation operators are bounded on the whole Fock space and satisfy the CAR there.

[F4]

Hilbert tensor construction: inner product, completion and product bases and Permutation sector projections on the n-fold tensor power: products of complete orthonormal bases form a complete orthonormal basis in the completed tensor product, and Pa,k is the orthogonal antisymmetrizing projection. The tensor supplier is stated with first-variable-linear pairings. On the tensor powers with the second-variable-linear convention of [F1], apply it to the conjugate first-variable-linear pairings (u,v)1:=⟨v,u⟩2; conjugation preserves norms, orthogonality and completeness, so the product-basis conclusion is unchanged.

Proof

Given: [A1], [F1]–[F4], and the finite ordered orthonormal basis of K.

1.1A1F1F2F4givenalgebra

For k=0, ξ∅=Ω is the unit vacuum. For k≥1, repeated application of the creation formula in [F2] gives ξS=k! Pa,k(ej1⊗⋯⊗ejk). The product-basis theorem in [F4], under [A1], makes elementary tensors of basis vectors a complete orthonormal basis of K⊗^k. If an index repeats, antisymmetrization is zero by pairing permutations that differ by swapping the equal factors. If all indices are distinct, their antisymmetrization is, up to the permutation sign, a scalar multiple of the vector displayed for the uniquely ordered subset S.

2.1A1F4step 1.1algebra

For k≥1 and distinct increasing indices, ∥Pa,k(ej1⊗⋯⊗ejk)∥2=⟨ej1⊗⋯⊗ejk,Pa,k(ej1⊗⋯⊗ejk)⟩2=1/k!, since only the identity permutation has nonzero inner product with that ordered elementary tensor. Distinct subsets have orthogonal permutation orbits in the tensor basis, so ⟨ξS,ξT⟩2=1S=T. The vacuum case has norm one by step 1.1.

3.1A1F1F3F4step 1.1step 2.1algebra

For each k≥1, the bounded projection Pa,k maps the complete basis of elementary tensors onto a dense subspace of its range. Step 1.1 shows this image is spanned by the ξS with ∣S∣=k; step 2.1 shows those vectors are orthonormal. Thus they form a basis of each antisymmetric sector. If k>∣J∣, every elementary basis tensor repeats an index and its projection vanishes, so that sector is zero. The direct-sum construction and completeness supplied by [A1], [F1] and [F3], together with the unit vacuum in step 1.1, now show that all ξS form an orthonormal basis of Fa(K).

4.1A1F1F3step 3.1algebra

Write cj=c(ej) and cj†=c†(ej). By [F3] both operators are bounded, so Nj=cj†cj is bounded. If j∉S, anticommute cj through the creation factors in ξS using the mixed CAR; it reaches Ω and annihilates it, so NjξS=0. If j=jℓ∈S, anticommuting it past the first ℓ−1 distinct creators gives cjξS=(−1)ℓ−1ξS∖{j}; creating j again and reordering it into its original position gives the same sign, so NjξS=ξS. Thus by the ONB in step 3.1, Nj is the diagonal multiplier 1j∈S; its diagonal values are real and idempotent, so it is a self-adjoint orthogonal projection.

5.1givenstep 3.1step 4.1algebra∎

On every basis vector ξS, the finite sum nx=∑j∈JxNj acts by ∣S∩Jx∣. These are real numbers between zero and ∣Jx∣, so the bounded diagonal operator nx is self-adjoint. If z∈C∖{0,…,∣Jx∣}, the diagonal operator with entries (∣S∩Jx∣−z)−1 is bounded by dist⁡(z,{0,…,∣Jx∣})−1 and is an inverse for nx−zI; hence z is outside its spectrum.

Depends on

Dependency tree · 2 levels

Sources