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

The semi-infinite q-wedge Fock space and its q-adic topology

Definition

Fix a charge M∈Z and let WN be the finite q-wedge spaces of The finite q-wedge space and the normal-ordering relations. For r≤s define the connecting map φr,s(ui1∧⋯∧uir)=ui1∧⋯∧uir∧uM−r∧uM−r−1∧⋯∧uM−s+1, so that new entries are the consecutive ground tail uM−N,uM−N−1,… appended to a prefix of length N. The charge-M Fock space is the algebraic direct limit F(M):=lim→⁡NWN of the finite wedge spaces along these maps; equivalently it is the quotient of the eventually-vacuum tensor space by the local wedge kernels. Write ∣λ;M⟩ for the image of the normally ordered semi-infinite word with entries ik=M+λk−k+1 indexed by the positive parts of the partition λ, so that the vacuum ∅ corresponds to uM∧uM−1∧uM−2∧⋯.

The Laurent, positive and integral charts of F(M) are

FA:=⨁λA ∣λ;M⟩,F0:=⨁λA0 ∣λ;M⟩,FZ0:=⨁λZ[q] ∣λ;M⟩,A=Z[q,q−1], A0=Q[q](q).

The separated q-adic topology on the full field space is the one induced by the filtration qnF0, never by qnFA=FA; a finite A0-label component completes to a Q[ ⁣[q] ⁣]-lattice, and the full-field component completes to Q((q))⊗Q(q)Fμ(M) for the label-weight pieces. Separately, the integral Z[q]-chart completes to a Z[ ⁣[q] ⁣]-lattice; this completion is not identified with Q((q)) and is not asserted to carry a Q-vector-space topology.

Vacuum weights. For M=j−ae with j∈{1,…,e} and a∈Z the vacuum P-weight ΩM is normalised by Ω0=Λ0 and ΩM−ΩM−1=wt(uM); explicitly, if M=te+r with 0≤r<e, then

ΩM=Λr−(e t(t−1)2+tr)δ.

The weight of the partition λ is ΩM−∑cellsαc−r+M, its size ∣λ∣ is a separate grading, and the d-eigenvalue is ΩM(d) minus the number of residue-0 cells; no periodicity ΩM=ΩM−e+δ is asserted.

Facts & Assumptions

Given: The charge M, the finite wedge spaces WN, the connecting maps φr,s, the direct limit F(M), the three charts, the filtration qnF0, and the normalisation of ΩM.

[F1]

The normally ordered wedges with strictly decreasing indices are a field basis and a Laurent basis in every WN, and the straightening stays inside the index interval (Normally ordered q-wedges form a basis for every finite wedge length).

[F2]

Yjum=um−e inside the j-th slot is the loop operator; the residue of um is m mod e and wt(um)=Λj−Λj−1+aδ for m=j−ae (The level-zero vector representation, its affinization and the level-one crystal energy).

[F3]

The loop operator Y=z itself shifts a slot by −e, so its e-th power shifts it by −e2; simultaneous translations preserve local index differences and hence the finite wedge relations. The levels of the vector-weight differences and δ are 0 (The level-zero vector representation, its affinization and the level-one crystal energy, The cyclic affine type A Cartan datum and its residues).

Verification

technique · show the semi-infinite words stabilise and agree with the partition indexing, then compute the vacuum weights by summing the loop exponents
1.1F1givenalgebra

Finite-stage spanning and ordered-tail stabilization. Start with a finite word of length r and choose S≥r so that the last appended ground index L=M−S+1 is below all its original indices. Its image at stage S has S entries, all at least L. By [F1], its finite straightening is a finite sum of normal tuples n1>⋯>nS≥L. For each resulting tuple put λj=nj−(M−j+1). Then λS≥0 and λj≥λj+1, so extending by zeros gives a partition. Every subsequent connecting map appends ground indices M−S,M−S−1,…, strictly below the normal tuple's last entry; that image is already normal and is the longer prefix of the same partition word. Thus every direct-limit element is a finite combination of partition words with a stable representative under these ordered-tail extensions. Maps with different finite codomains are not equated.

1.2F2F3givenalgebra

Direct verification of the vacuum weights. Let M=te+r with t∈Z and 0≤r<e, and put ΩM=Λr−[et(t−1)/2+tr]δ. It gives Ω0=Λ0. If r>0, subtraction of the formula for M−1=te+(r−1) gives ΩM−ΩM−1=Λr−Λr−1−tδ=λr−tδ. Here uM=z−tvr, so this is exactly wt(uM) by [F2]. If r=0, use M−1=(t−1)e+(e−1): subtraction gives ΩM−ΩM−1=Λ0−Λe−1+(1−t)δ=λe+(1−t)δ, and uM=z1−tve has precisely this weight. These integer identities also hold for negative t. The base value and this recurrence uniquely determine the weights for all integer charges. The partition label is consequently the stipulated ΩM−∑cellsαc−r+M, whose d-evaluation is ΩM(d)−m0 by the explicit datum; size remains the separate grading. No fractional change of an integer loop exponent or infinite unregularized weight sum is used.

2.1step 1.1F1givenalgebra

Partition indexing and direct-limit independence. An eventually-ground normal word has ik=M+λk−k+1 with λk weakly decreasing and eventually zero; hence the λk are nonnegative and form a partition, and every partition gives such a word. For finitely many distinct partitions choose a common prefix length N containing all their nonzero rows and every position where two words differ. Each partition prefix is normal and has last index iN≥M−N+1. Its next appended index is M−N, strictly smaller, so every later image remains a normal basis word, and the distinct partition images remain distinct. If a finite linear combination vanished in the algebraic direct limit, it would vanish at some common later finite stage: a colimit relation uses finitely many connecting-map relations, which can all be moved to that common stage. Independence of the finite normal basis in [F1] then forces every coefficient to vanish. Together with step 1.1, this proves the partition basis without assuming that arbitrary finite words survive tail attachment.

3.1step 2.1givenalgebra

The charts and the topology. Each displayed chart is free on the partition basis over its own ring. Both FA and F0 contain FZ0, and FA∩F0=FZ0 coefficientwise: an integral Laurent polynomial is regular at zero exactly when it has no negative powers. Neither chart is identified with the other. A nonzero vector of the local A0-chart has finitely many nonzero coefficients, each of finite q-valuation, so ⋂n≥0qnF0=0. On each finite label component the completion of A0=Q[q](q) is Q[ ⁣[q] ⁣], and inverting q gives the field completion Q((q)); the corresponding full-field component is Q((q))⊗Q(q)Fμ(M). Separately the completion of the integral Z[q]-chart is Z[ ⁣[q] ⁣]. The Laurent lattice has qFA=FA and therefore supplies no separated q-adic filtration. These statements concern the componentwise completions stipulated in the Definition; no full infinite direct sum is identified with a finite-rank completed lattice.

4.1step 1.1step 2.1step 3.1step 1.2∎

Conclusion. The charge-M Fock space is the algebraic direct limit of the finite wedge spaces along the ground tails, with a basis indexed by all partitions, the three charts FA,F0,FZ0 are distinct free lattices, the separated topology is induced by qnF0 (never by qnFA), and the vacuum weights are ΩM=Λr−(et(t−1)2+tr)δ for M=te+r.

Depends on

Used by

Dependency tree · two levels

16 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