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.

Spencer quantum-characteristic digits and support set

Definition

Let K be a field, let δ∈K, and let ℓ be the recurrence quantum characteristic of (K,δ) from Temperley–Lieb quantum integers and quantum characteristic. Put P=char⁡K when char⁡K>0, and put P=∞ when char⁡K=0. In this definition ℓ is Spencer's recurrence parameter; it is not the complex order κ=ord⁡(q2).

Suppose first that ℓ<∞. Set s0=1 and si=ℓPi−1 for each i≥1 with P<∞. If P=∞, set s1=ℓ and omit all si for i≥2. Every M∈N has a unique expansion M=∑i=0rmisi, where 0≤m0<ℓ and 0≤mi<P for i≥1 when P<∞. When P=∞, write M=m0+m1ℓ with 0≤m0<ℓ and m1≥0; if m1=0, take r=0. The highest digit mr is nonzero unless M=0, for which take r=0 and m0=0.

For a label N≥0, let ni be the digits of N+1, so N+1=∑i=0rnisi. Define the Spencer support set Supp⁡ℓ,P(N)={∑i=0rεinisi−1:εi∈{−1,1}, εr=1, ∑i=0rεinisi−1≥0}. If ℓ=∞, define Supp⁡ℓ,P(N)={N}.

This item defines the digit expansion and a finite set only. Spencer's theorem identifying these sets with decomposition multiplicities, and the separate Jones–Wenzl existence criterion, are not asserted here; both require the full field hypotheses and their own proofs.

Depends on

Used by

Dependency tree · one level

1 result within one dependency step 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