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 decomposition numbers over arbitrary fields
Statement
Let be any field, let , and let be its recurrence quantum characteristic. Put when the characteristic is positive and otherwise. Let , let have parity , and let be nonzero. Then Here the support is formed from the digits of as in Spencer quantum-characteristic digits and support set. In particular, every composition multiplicity is zero or one. This includes , finite in characteristic zero, arbitrary positive characteristic, , and characteristic two. When is even and , the label has zero form quotient and is excluded by the nonzero-simple hypothesis; its standard module remains among the modules classified by the formula. At , .
Facts & Assumptions
Given: The field, loop parameter, rank, labels, right standard modules and nonzero simple quotients in the Statement.
The diagram basis is cellular, its cell form acts by the coefficient-of-identity rank-one rule, and its nonzero form quotients give all absolutely simple modules with pairwise distinct labels (The Temperley–Lieb link-state diagram basis is cellular, Nonzero Temperley–Lieb cell forms give all simple heads).
Restriction of to rank has factors and (Restriction of a link-state module has a two-step filtration). Exact truncation gives whenever , and is the trivial diagram module (Exact Temperley–Lieb truncation reduces decomposition to trivial factors).
Support signs give a Boolean cube on nonzero lower digits, full-prefix sign changes give reflections in place-value walls, and candidate-composition binomials on comparable cube elements are nonzero (Spencer support signs, wall reflections, and nonzero composition scalars).
The signed forest candidates have chain coefficient , compose by the stated quantum binomials, and give genuine homomorphisms under the strict wall inequalities (Signed forest candidates, wall homomorphisms, and their composition).
The support-character carry coefficients are nonnegative, have , satisfy the scalar restriction identity, and every extra positive coefficient belongs to a simple standard. In the zero-loop, positive even-rank case (Support-character carry recursion has only simple extra standards).
Proof
Given: The data and hypotheses in the Statement.
We first record the triangular facts used below. Let be the ideal spanned by diagrams of propagation at most , with . The action on kills , because propagation cannot increase. On a nonzero , the ideal acts nontrivially: the cellular rule gives a nonzero operator since the form is nonzero. Thus a composition factor of cannot have label . If , the same rank-one rule shows that kills the form radical, while modulo this radical is . Therefore this label has multiplicity exactly one; every other factor has larger label. If , the form is identically zero, so this label contributes no simple quotient. These are all cases because a link state has nonzero form whenever or : at nonzero loop use its self-pairing, and at positive use the two shifted adjacent-cup states whose gluing has no loop.
Write when and otherwise. We prove the lower bound for the trivial-factor multiplicity . Call embodied if there are a submodule containing it and a module map with . This implies . If the support is a singleton, its only label is and the assertion is immediate. Otherwise write with and let . The pair is a reflection about the -wall below , with and . Thus [F4] gives a nonzero homomorphism carrying its basis vector to . Its image is an actual trivial submodule, so this vector is embodied.
We propagate this property across the cube. Consider any subcube with higher signs fixed and all lower nonzero digits up to index variable. Let be its maximal label, with all variable signs positive, and its minimal label, with all variable signs negative; suppose is embodied. We show all its labels are embodied by induction on the number of variable digits. If there are none, this is the assumption. Otherwise split at its largest variable index . The minus-half has minimum . The plus-half has minimum , obtained by retaining the positive sign at and making every smaller variable sign negative. Full-prefix reflections give genuine homomorphisms and by [F4], using the identity map for if . All three labels are comparable cube elements, so [F3]–[F4] give with , where is the linear candidate map. This makes a module map on : for any algebra element and any preimage in , the equality with the genuine map verifies intertwining, and is surjective onto . Moreover is a nonzero multiple of and is a nonzero multiple of , again because their candidate-composition scalars are nonzero. If embody , the submodule and the functional therefore embody . Apply induction to both smaller halves. The whole support cube starts with its embodied minimum from step 2.1, proving for every field and every support label.
We now prove equality by induction on , the case being the one-dimensional algebra. Suppose the full decomposition formula holds at smaller ranks. For each label put and let be the multiplicity of the rank- trivial module in the restriction of . By [F2] and induction, For each nonzero simple let be the multiplicity of that trivial module in its restriction; these are nonnegative integers, and . For , [F2] and induction already give . It remains only to determine the .
Treat labels in decreasing order, assuming and at all larger labels. If , step 1.1 and restriction of a composition series give The carry identity [F5] gives Subtracting and using the descending assumption yields . If , the lower bound of step 3.1 and force and . If , [F5] makes simple. Since , its simple label is different from , so ; step 3.1 then forces , and the same equality gives . This completes the descending step whenever the diagonal simple exists.
The only missing diagonal is even. Here by step 1.1, so restriction of a composition series gives with no term. By [F5], , and all larger already equal their carry values. The carry identity consequently gives directly. Thus the exceptional zero-form standard is classified too, and no nonexistent simple has been inserted. The case is covered by the initial top label and needs no descending step.
We have proved at rank , completing the induction by steps 4.1–6.1. Finally, for any nonzero , exact truncation [F2] identifies its desired multiplicity with , which is precisely the formula in the Statement. All arguments were over the given field or polynomial identities valid after its extension, and the zero-loop, zero-defect exception was explicitly handled. Hence the formula has every asserted field, characteristic and quantum-characteristic branch.
Depends on
- Spencer quantum-characteristic digits and support set
- The Temperley–Lieb link-state diagram basis is cellular
- Nonzero Temperley–Lieb cell forms give all simple heads
- Restriction of a link-state module has a two-step filtration
- Exact Temperley–Lieb truncation reduces decomposition to trivial factors
- Spencer support signs, wall reflections, and nonzero composition scalars
- Signed forest candidates, wall homomorphisms, and their composition
- Support-character carry recursion has only simple extra standards
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
23 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)
- Anton Cox, John Graham and Paul Martin, The blob algebra in positive characteristic (standard reference, not scraped)