Alphabeta Math
DefinitionDefinition: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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 level-one partition Fock space and node residues

Definition

Let F:=⨁λQ(q)∣λ⟩ be the charge-0 part of the Fock space of Semi-infinite wedges are indexed by partitions and the action gives the node formulas, with basis indexed by all partitions and with the node operators Fi,Ei defined by the stable finite-prefix action. Assign to ∣λ⟩ the level-one weight

wt(∣λ⟩):=Λ0−∑i∈Imi(λ) αi,mi(λ):=#{cells of λ of residue i},

where the residue of a cell in row r and column c is c−r mod e, and the size ∣λ∣ is the separate grading. The vacuum is the empty partition ∅; Fi adds and Ei removes a node by the explicit finite node formulas of the same item. The toral action is Ki∣λ⟩=qNi(λ)∣λ⟩ with Ni the addable-minus-removable count, proved to be the Cartan pairing in The addable-minus-removable node count is the level-one Cartan pairing, and Kd∣λ⟩=q−m0(λ)∣λ⟩.

A partition is e-regular if each positive part occurs with multiplicity <e, and e-restricted if λr−λr+1<e for every r≥1 (with λr=0 beyond the length). These operators are declared linear endomorphisms here; the affine relations proved later establish the actual module structure, so nothing about F is silently assumed in this Definition.

Facts & Assumptions

Given: The charge-0 Fock space with its partition basis, the node formulas and the toral and loop actions, and the residue convention c−r mod e.

[F1]

Normal wedges are bijective with partitions through ik=λk−k+1, and the stable finite-prefix action gives the finite node formulas for Fi,Ei,Ki,Kd (Semi-infinite wedges are indexed by partitions and the action gives the node formulas).

[F2]

A removable node of λ is a cell (r,λr) with λr>λr+1, and an addable node is (r,λr+1) with r=1 or λr−1>λr; the conjugate partition λ′ has λj′=#{r:λr≥j} (Removable and addable nodes, Partitions, English diagrams, and conjugation).

Verification

technique · transport the wedge basis to partitions, read the residues off the corners, and compare the multiplicity and difference conditions through conjugation
1.1F1givenalgebra

The partition basis and the declared operators. By [F1] the map λ↦∣λ⟩ is a bijection from partitions to normal semi-infinite words and the stable prefix action gives well-defined linear Fi,Ei,Ki,Kd; the weights, residues and size grading are read off literally from ik=λk−k+1, so the Definition introduces no new structure beyond the wedge construction.

1.2F2givenalgebra

The regular/restricted equivalence. For each r≥1, the number of columns of λ of height exactly r is λr−λr+1: such a column has index c with λr+1<c≤λr. These column heights are the parts of λ′. Thus λ is e-restricted exactly when every part of λ′ has multiplicity less than e, equivalently when λ′ is e-regular. Column height itself is unrestricted; for example (1e) has one column of height e and its only nonzero adjacent row difference is 1<e.

2.1step 1.2givenalgebra

The boundary example. For e≥2 the partition (1e) has parts of multiplicity exactly e, so it is not e-regular, while its adjacent differences are 0 except for the final difference 1<e, so it is e-restricted; this shows the two conditions are genuinely different and that the full Fock space contains non-regular labels. All partitions are vertices of the full Fock module; the regular ones will be the labels of the empty component.

3.1step 1.1step 1.2step 2.1∎

Conclusion. The level-one partition Fock space is the charge-0 Fock space with weight Λ0−∑imiαi and residues c−r mod e, its operators are the stable finite-prefix node operators, and the e-regular and e-restricted conventions are conjugate to each other with the column-height dictionary.

Depends on

Used by

Dependency tree · two levels

7 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