Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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 K be any field, let δ∈K, and let ℓ be its recurrence quantum characteristic. Put P=char⁡K when the characteristic is positive and P=∞ otherwise. Let n≥0, let m,r∈{0,1,…,n} have parity n, and let Dn,r=Wn,r/rad⁡ϕn,r be nonzero. Then [Wn,m:Dn,r]={1,m∈Supp⁡ℓ,P(r),0,m∉Supp⁡ℓ,P(r). Here the support is formed from the digits of r+1 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, δ=±2, and characteristic two. When n>0 is even and δ=0, the label r=0 has zero form quotient and is excluded by the nonzero-simple hypothesis; its standard module Wn,0 remains among the modules classified by the formula. At n=0, D0,0=W0,0=K.

Facts & Assumptions

Given: The field, loop parameter, rank, labels, right standard modules and nonzero simple quotients in the Statement.

[F1]

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).

[F2]

Restriction of Wn,m to rank n−1 has factors Wn−1,m−1 and Wn−1,m+1 (Restriction of a link-state module has a two-step filtration). Exact truncation gives [Wn,m:Dn,r]=[Wr,m:Dr,r] whenever Dn,r≠0, and Dr,r is the trivial diagram module (Exact Temperley–Lieb truncation reduces decomposition to trivial factors).

[F3]

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).

[F4]

The signed forest candidates va,b have chain coefficient 1, compose by the stated quantum binomials, and give genuine homomorphisms under the strict wall inequalities (Signed forest candidates, wall homomorphisms, and their composition).

[F5]

The support-character carry coefficients βn,r are nonnegative, have βn,n=1, satisfy the scalar restriction identity, and every extra positive coefficient belongs to a simple standard. In the zero-loop, positive even-rank case βn,0=0 (Support-character carry recursion has only simple extra standards).

Proof

Given: The data and hypotheses in the Statement.

1.1F1F2givenalgebra

We first record the triangular facts used below. Let It be the ideal spanned by diagrams of propagation at most t, with I−1=I−2=0. The action on Wn,m kills Im−2, because propagation cannot increase. On a nonzero Dn,r, the ideal Ir acts nontrivially: the cellular rule xCu,vr=ϕn,r(x,u)v gives a nonzero operator since the form is nonzero. Thus a composition factor of Wn,m cannot have label r<m. If Dn,m≠0, the same rank-one rule shows that Im kills the form radical, while Wn,m modulo this radical is Dn,m. Therefore this label has multiplicity exactly one; every other factor has larger label. If m=0,δ=0,n>0, the form is identically zero, so this label contributes no simple quotient. These are all cases because a link state has nonzero form whenever m>0 or δ≠0: at nonzero loop use its self-pairing, and at positive m use the two shifted adjacent-cup states whose gluing has no loop.

2.1F3F4step 1.1constructalgebra

Write d(N,m)=1 when m∈Supp⁡(N) and 0 otherwise. We prove the lower bound for the trivial-factor multiplicity t(N,m)=[WN,m:DN,N]. Call vN,m embodied if there are a submodule U⊆WN,m containing it and a module map q:U→DN,N with q(vN,m)≠0. This implies t(N,m)≥1. If the support is a singleton, its only label is N and the assertion is immediate. Otherwise write N+1=∑i=0rnisi with r≥1 and let μ=nrsr−∑i<rnisi−1. The pair N,μ is a reflection about the sr-wall below N, with 0<N−μ<2sr and N+μ+2=2nrsr. Thus [F4] gives a nonzero homomorphism WN,N→WN,μ carrying its basis vector to vN,μ. Its image is an actual trivial submodule, so this vector is embodied.

3.1F3F4step 2.1algebra

We propagate this property across the cube. Consider any subcube with higher signs fixed and all lower nonzero digits up to index j variable. Let h be its maximal label, with all variable signs positive, and l its minimal label, with all variable signs negative; suppose vN,l 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 j. The minus-half has minimum l. The plus-half has minimum a, obtained by retaining the positive sign at j and making every smaller variable sign negative. Full-prefix reflections give genuine homomorphisms f:WN,h→WN,a and H:WN,h→WN,l by [F4], using the identity map for f if a=h. All three labels are comparable cube elements, so [F3]–[F4] give gf=λH with λ≠0, where g:WN,a→WN,l is the linear candidate map. This makes g a module map on I=im⁡f: for any algebra element and any preimage in WN,h, the equality with the genuine map H verifies intertwining, and f is surjective onto I. Moreover f(vN,h) is a nonzero multiple of vN,a and g(vN,a) is a nonzero multiple of vN,l, again because their candidate-composition scalars are nonzero. If Ul,ql embody vN,l, the submodule I∩g−1(Ul) and the functional qlg therefore embody vN,a. Apply induction to both smaller halves. The whole support cube starts with its embodied minimum from step 2.1, proving t(N,m)≥d(N,m) for every field and every support label.

4.1F1F2step 1.1step 3.1algebra

We now prove equality by induction on n, the case n=0 being the one-dimensional algebra. Suppose the full decomposition formula holds at smaller ranks. For each label m put tm=t(n,m) and let um be the multiplicity of the rank-(n−1) trivial module in the restriction of Wn,m. By [F2] and induction, um=d(n−1,m−1)+d(n−1,m+1). For each nonzero simple Dn,r let br be the multiplicity of that trivial module in its restriction; these are nonnegative integers, and bn=1. For r<n, [F2] and induction already give [Wn,m:Dn,r]=d(r,m). It remains only to determine the tm.

5.1F1F2F5step 1.1step 3.1step 4.1algebra

Treat labels m<n in decreasing order, assuming tr=d(n,r) and br=βn,r at all larger labels. If Dn,m≠0, step 1.1 and restriction of a composition series give um=tm+bm+∑m<r<nd(r,m)br. The carry identity [F5] gives um=d(n,m)+βn,m+∑m<r<nd(r,m)βn,r. Subtracting and using the descending assumption yields tm+bm=d(n,m)+βn,m. If βn,m=0, the lower bound of step 3.1 and bm≥0 force tm=d(n,m) and bm=0. If βn,m>0, [F5] makes Wn,m simple. Since m<n, its simple label is different from n, so tm=0; step 3.1 then forces d(n,m)=0, and the same equality gives bm=βn,m. This completes the descending step whenever the diagonal simple exists.

6.1F1F2F5step 1.1step 4.1step 5.1algebra

The only missing diagonal is m=0,δ=0,n>0 even. Here Dn,0=0 by step 1.1, so restriction of a composition series gives u0=t0+∑0<r<nd(r,0)br with no b0 term. By [F5], βn,0=0, and all larger br already equal their carry values. The carry identity consequently gives t0=d(n,0) directly. Thus the exceptional zero-form standard is classified too, and no nonexistent simple has been inserted. The case n=1 is covered by the initial top label and needs no descending step.

7.1F2step 3.1step 4.1step 5.1step 6.1algebra∎

We have proved [Wn,m:Dn,n]=d(n,m) at rank n, completing the induction by steps 4.1–6.1. Finally, for any nonzero Dn,r, exact truncation [F2] identifies its desired multiplicity with [Wr,m:Dr,r]=d(r,m), 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

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