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 support signs, wall reflections, and nonzero composition scalars
Statement
When , use the digits and place values in Spencer quantum-characteristic digits and support set, and write with . When , each signed expression with lies in , has parity , and determines its signs at every nonzero digit uniquely. Thus the support has elements, where is the number of nonzero digits below .
For , the specialized quantum binomial is nonzero exactly when each mixed-radix digit of is at most the corresponding digit of . In characteristic zero this uses the two digits with places ; if , every such binomial is nonzero.
For and any , changing all signs at indices less than reflects the corresponding support element about the wall , where is a positive multiple of . In particular, writing gives the pair and .
For , let belong to this support, and suppose their sets of negative nonzero digits satisfy . Then and the specialized quantum binomial is nonzero. Here denotes the polynomial quantum binomial of Nonvanishing of an entire quantum-binomial row and the characteristic digits. If , the same last assertion holds for the only triple .
Facts & Assumptions
Given: A field, its loop parameter, recurrence quantum characteristic, and the digit data in the Statement.
The support uses digits of , with highest sign fixed positive and the place values and digit bounds stated in Spencer quantum-characteristic digits and support set.
The polynomials satisfy , where is the binary-word inversion polynomial (Nonvanishing of an entire quantum-binomial row and the characteristic digits).
The binomial theorem and the vanishing of intermediate prime binomial coefficients hold over a field of prime characteristic (The binomial theorem over an arbitrary commutative ring, A prime divides for ).
An irreducible polynomial has a root in its quotient field extension ( for monic irreducible is a field extension containing the root with unique reduced representatives).
Proof
Given: The data and hypotheses in the Statement.
Suppose for the digit and reflection arguments. The digit bounds give for every available : for this is , and adjoining a digit at place increases the maximum from to . In characteristic zero there is only the first such bound to check. Therefore the signed sum with positive highest digit is at least and at most . Flipping signs changes by an even integer. For , the only support element is , so the same assertions hold.
We prove the quantum-binomial zero test needed below, retaining scalar units. Using [F4] when necessary, adjoin a root of if necessary and put . If , the recurrence gives , so finite is the exact order of . If , the recurrence gives , so finite equals the field characteristic. The extension does not change which elements of the original field vanish. Expanding by subsets gives . In the first case, the length- factor is by the distinct roots of ; in the second it has this same value by [F3].
If two sign choices differ at a nonzero digit, let be their largest differing index. Their signed sums differ by a term of absolute value , whereas all smaller terms have combined absolute value at most by step 1.1. Thus their sums differ. Each of the nonzero lower digits consequently gives an independent choice, proving the count.
If , every quantum factorial is nonzero and [F2] proves the asserted nonvanishing directly. Suppose and write and with remainders in . Step 1.2 factors its product into . Comparing the coefficient of , and using [F2], shows precisely when and in the field: the omitted factors are powers of and , and is nonzero because every quantum factorial index is less than . In positive characteristic, expand using [F3]. The coefficient at is nonzero exactly when its base- digits are at most the corresponding digits of , since then it is a product of nonzero binomials with factorial indices less than . In characteristic zero is nonzero whenever . Consequently the quantum binomial is nonzero exactly when every mixed-radix digit of is at most that of .
For and a fixed split index , the higher contribution is divisible by and satisfies by the same place-value bound. Step 1.1 gives . Negating exactly the lower signs replaces by , retains the highest positive sign, and hence stays in the support. This proves the reflection assertion, including the case .
For the nested sets in the Statement, subtracting the signed sums gives and . These are their actual mixed-radix expansions, because each digit is either or the original allowed digit and no position is added twice. Since , the second expansion is digitwise bounded by the first. Step 2.2 proves the nonzero scalar, including repeated labels and zero digits. If then the singleton support gives directly from [F2].
Remarks
This is a combinatorial supplier. It neither constructs the candidate module maps nor asserts that support labels are composition factors. Those require separate proofs.
Depends on
- Spencer quantum-characteristic digits and support set
- Nonvanishing of an entire quantum-binomial row and the characteristic digits
- The binomial theorem over an arbitrary commutative ring
- A prime $p$ divides $\binom pk$ for $0<k<p$
- $F[x]/(p)$ for monic irreducible $p$ is a field extension containing the root $x+(p)$ with unique reduced representatives
Used by
Dependency tree · two levels
18 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
- Robert A. Spencer, The Modular Temperley–Lieb Algebra (standard reference, not scraped)