Alphabeta Math
LemmaStatement: 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 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 N+1=∑j=0rnjsj with nr>0. When ℓ<∞, each signed expression ∑jεjnjsj−1 with εr=1 lies in [0,N], has parity N, and determines its signs at every nonzero digit uniquely. Thus the support has 2h elements, where h is the number of nonzero digits below r.

For 0≤v≤u, the specialized quantum binomial Bu,v(δ) is nonzero exactly when each mixed-radix digit of v is at most the corresponding digit of u. In characteristic zero this uses the two digits with places 1,ℓ; if ℓ=∞, every such binomial is nonzero.

For ℓ<∞ and any 0<k≤r, changing all signs at indices less than k reflects the corresponding support element about the wall H−1, where H=∑j≥kεjnjsj is a positive multiple of sk. In particular, writing L=∑j<kεjnjsj gives the pair H+L−1,H−L−1 and ∣L∣<sk.

For ℓ<∞, let a,b,c belong to this support, and suppose their sets of negative nonzero digits satisfy A⊆B⊆C. Then a≥b≥c and the specialized quantum binomial B(a−c)/2,(a−b)/2(δ) is nonzero. Here B 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 a=b=c=N.

Facts & Assumptions

Given: A field, its loop parameter, recurrence quantum characteristic, and the digit data in the Statement.

[F1]

The support uses digits of N+1, with highest sign fixed positive and the place values and digit bounds stated in Spencer quantum-characteristic digits and support set.

[F2]

The polynomials Bu,v satisfy Bu,v(q+q−1)=q−v(u−v)Gu,v(q2), where G is the binary-word inversion polynomial (Nonvanishing of an entire quantum-binomial row and the characteristic digits).

[F3]

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 p divides (pk) for 0<k<p).

Proof

Given: The data and hypotheses in the Statement.

1.1F1givenalgebra

Suppose ℓ<∞ for the digit and reflection arguments. The digit bounds give ∑j<knjsj≤sk−1 for every available k≥1: for k=1 this is n0≤ℓ−1, and adjoining a digit at place sk increases the maximum from sk−1 to (p−1)sk+sk−1=sk+1−1. In characteristic zero there is only the first such bound to check. Therefore the signed sum with positive highest digit is at least nrsr−(sr−1)−1≥0 and at most N. Flipping signs changes N by an even integer. For r=0, the only support element is N, so the same assertions hold.

1.2F1F2F3F4algebraconstruct

We prove the quantum-binomial zero test needed below, retaining scalar units. Using [F4] when necessary, adjoin a root q≠0 of X2−δX+1 if necessary and put Q=q2. If Q≠1, the recurrence gives [t]δ=q1−t(1−Qt)/(1−Q), so finite ℓ is the exact order of Q. If Q=1, the recurrence gives [t]δ=tqt−1, so finite ℓ equals the field characteristic. The extension does not change which elements of the original field vanish. Expanding by subsets gives ∏i=0u−1(1+QiX)=∑vQv(v−1)/2Gu,v(Q)Xv. In the first case, the length-ℓ factor is 1−(−X)ℓ by the distinct roots of Yℓ−1; in the second it has this same value by [F3].

2.1F1step 1.1algebra

If two sign choices differ at a nonzero digit, let j be their largest differing index. Their signed sums differ by a term of absolute value 2njsj≥2sj, whereas all smaller terms have combined absolute value at most 2(sj−1) by step 1.1. Thus their sums differ. Each of the h nonzero lower digits consequently gives an independent choice, proving the count.

2.2F1F2F3step 1.2algebra

If ℓ=∞, every quantum factorial is nonzero and [F2] proves the asserted nonvanishing directly. Suppose ℓ<∞ and write u=Uℓ+u0 and v=Vℓ+v0 with remainders in [0,ℓ−1]. Step 1.2 factors its product into (1−(−X)ℓ)U∏i=0u0−1(1+QiX). Comparing the coefficient of Xv, and using [F2], shows Bu,v(δ)≠0 precisely when v0≤u0 and (UV)≠0 in the field: the omitted factors are powers of Q and −1, and Gu0,v0 is nonzero because every quantum factorial index is less than ℓ. In positive characteristic, expand (1+X)U=∏i(1+Xpi)ui using [F3]. The coefficient at V is nonzero exactly when its base-p digits are at most the corresponding digits of U, since then it is a product of nonzero binomials with factorial indices less than p. In characteristic zero (UV) is nonzero whenever 0≤V≤U. Consequently the quantum binomial is nonzero exactly when every mixed-radix digit of v is at most that of u.

3.1F1step 1.1step 2.1algebra

For ℓ<∞ and a fixed split index k, the higher contribution H is divisible by sk and satisfies H≥nrsr−∑k≤j<rnjsj≥sk>0 by the same place-value bound. Step 1.1 gives ∣L∣<sk. Negating exactly the lower signs replaces H+L−1 by H−L−1=2(H−1)−(H+L−1), retains the highest positive sign, and hence stays in the support. This proves the reflection assertion, including the case L=0.

4.1F1F2step 2.1step 2.2algebra∎

For the nested sets in the Statement, subtracting the signed sums gives (a−c)/2=∑j∈C∖Anjsj and (a−b)/2=∑j∈B∖Anjsj. These are their actual mixed-radix expansions, because each digit is either 0 or the original allowed digit and no position is added twice. Since B∖A⊆C∖A, 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 B0,0=1 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

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