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 be a field, let , and let be the recurrence quantum characteristic of from Temperley–Lieb quantum integers and quantum characteristic. Put when , and put when . In this definition is Spencer's recurrence parameter; it is not the complex order .
Suppose first that . Set and for each with . If , set and omit all for . Every has a unique expansion where and for when . When , write with and ; if , take . The highest digit is nonzero unless , for which take and .
For a label , let be the digits of , so . Define the Spencer support set If , define .
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
- The Spencer support set for rank label eleven in characteristic three Example
- Signed forest candidates, wall homomorphisms, and their composition Lemma
- Spencer support signs, wall reflections, and nonzero composition scalars Lemma
- Support-character carry recursion has only simple extra standards Lemma
- Spencer decomposition numbers over arbitrary fields Theorem
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
- Robert A. Spencer, The Modular Temperley-Lieb Algebra (standard reference, not scraped)
- David Ridout and Yvan Saint-Aubin, Standard Modules, Induction and the Structure of the Temperley-Lieb Algebra (standard reference, not scraped)