Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

The cogood node gives the simple socle and head of the residue induction

Statement

Let k be a field of characteristic p>0, μ a p-restricted partition of d and i∈Z/p with φi(μ)>0; let B be the cogood i-node and ν=μ∪B (Residue signatures, normal, good, conormal and cogood nodes). Then FiD(μ) has simple socle and simple head, both isomorphic to D(ν), and the total (ungraded) multiplicity of D(ν) in FiD(μ) is φi(μ) (Generalized Jucys-Murphy primary idempotents and the residue-summand functors Ei, Fi).

Facts & Assumptions

Given: A field F of characteristic p>0, a p-restricted partition μ of d, a residue i with φi(μ)>0, its cogood node B, and ν=μ∪B.

[F1]

The integrated Schur endomorphism algebra has normalized semistandard cell maps and actual weight projections, and the right corner is transported by ρh(x)=hx (The type-A q-Schur algebra and its Weyl modules, The Schur idempotent and the Schur functor for type-A q-Schur algebras). Nonzero cellular form quotients are absolutely simple and classify the simples; canonical Schur norm one makes all Schur labels nonzero (Nonzero cell heads classify the simple modules of a cellular algebra). All corner and socle-lifting assertions needed below are proved locally.

[F2]

The accepted integral root-interval supplier gives the T,Q operators, splitting identity (P), zero criterion (Z), matched norm (M), and triangular hats, including distinct essential hats and the essential-regular characterization of root normality (An integral essential-subset basis and count for type-A root intervals). Its global tensor/positive-detection foundation is recalled explicitly below; no characteristic-zero PBW or strong-linkage premise is used.

[F3]

The independent Murphy datum and signed-conjugate module/form bridge have form factor one at q=1 (The Murphy cellular basis, the cell law and the Murphy form, Ordinary Specht modules are the signed conjugate Murphy cells). The published ordinary group form criterion and classification give distinct absolutely irreducible quotients exactly at regular labels, with nondegenerate invariant quotient forms (Nonzero modular Specht quotient criterion, Modular simple modules of the symmetric group, Modular Specht form and radical quotient). Thus the restricted convention is obtained through the actual sign/inverse dictionary, not a finite-e Hecke classifier.

[F4]

The complete locally proved Conormal-node composition multiplicities under residue induction gives, over every field of characteristic p, zero multiplicity off conormality and otherwise the number of conormal i-nodes weakly above the restricted addition B. The recovered reviewer independently verified its tensor-weight support, integer opposed recurrence, boundary-stack evaluation, actual induction corner and central-content residue allocation on the guarded companion proposal. Only the final total-multiplicity step uses this interface.

[F5]

Normal/good and conormal/cogood mean the surviving signs, first surviving minus and last surviving plus in the top-to-bottom reduced signature (Residue signatures, normal, good, conormal and cogood nodes). Primary projectors are commuting polynomials in the Jucys-Murphy elements, inverse fixes them, and Ld+1 commutes with FSd (Generalized Jucys-Murphy primary idempotents and the residue-summand functors Ei, Fi). Their needed content/adjunction interfaces are proved locally below. A self-dual finite-dimensional module has head dual to socle (The radical, socle, head, and Loewy series of a finite-dimensional module).

Proof

technique · direct
1.1givenF1F2construct

We first establish the restriction endpoint locally. Work with left Schur modules through star. In tensor degree m, the word of mαTw has jth letter the row containing j in tαw; at regular type it is jw−1, with zero-multiplicity labels omitted. Over K=F(t) the evaluations g⊗m span the tensor Schur algebra: a functional killing them gives a polynomial zero on invertible matrices; multiplication by det⁡ and the infinite-field polynomial identity force that polynomial to be zero. Schur simples are therefore simple polynomial GLN modules. The canonical shape/type diagonal is its permutation-summand projection, whose square gives canonical form value one. Semistandard column strictness bounds entries at most k by the first k rows, so all weights are dominated by the highest weight ξ and the highest space is Kv. Integer torus characters, rather than Lie eigenvalues modulo p, distinguish these weights.

2.1step 1.1construct

Gaussian factorization g=u−tu+ on the big cell shows that negative coefficient operators on v span its simple module: a functional killing them kills gv on that open set and hence everywhere by polynomial identity. Similarly, positive coefficient operators detect every nonzero vector x of weight ξ−Γ. If every positive highest coefficient vanished, the highest coefficient of gx would vanish on the big cell, because negative operators cannot raise any weight to ξ; it would then vanish on the orbit of x, which spans the simple and contains v. All coefficient operators have integral tensor replacement matrices, and the ranks and Hom kernels of finite matrices preserve extension from F to K. These arguments consequently descend to F.

3.1step 2.1construct

Let ξN=0, l=N−1, and let M be the full last-coordinate-one subspace of LN(ξ). A primitive vector means one killed by every nonconstant coefficient of the upper Levi unipotent group, not merely by its Lie generators. Factor the full upper group as VUl+, where V has only the last column above the diagonal nontrivial. A positive test of a Levi-primitive vector acts only through V, since the right-hand nonconstant Levi coefficients kill it. Raising last coordinate 1 to highest coordinate 0 requires a V monomial of degree exactly one. Positive detection therefore gives ErNx=cv≠0 for some r. Hence wt⁡(x)=ξ−βr, where βr=αr+⋯+αl, even when the initial first-level deficit was arbitrary. On that primitive weight space x↦ErNx is injective by the same detection argument, so its dimension is at most one.

4.1step 3.1F2construct

Put aj=ξj−ξj+1 and use B(r,s)=s−r+∑j=rsaj and C(r,s)=s−r+∑j=rs−1aj. For nonempty I, the canonical Q(I) kills a primitive vector: if b=min⁡I, its ascending-prefix letter eb−1 commutes past the remaining ascending letters, whose indices exceed b, and becomes a rightmost Levi letter with b−1<l. Expand a nonzero primitive vector of weight ξ−βr in the essential T basis and select the largest hat among its nonzero coefficients. The triangular pivot isolates a nonzero term. That hat cannot be nonempty, since its Q test would annihilate the vector. Distinct essential hats therefore leave exactly one essential set with empty hat. Empty is linked precisely to a regular set, and the essential-regular matching theorem says such a set exists precisely when r is normal. This proves necessity of normality.

5.1step 4.1F2construct

Conversely, for normal r let Rr={s∈(r,l]:B(r,s)=0} and choose its compensation f with r<f(s)≤s and B(f(s),s)=0. Put D=f(Rr). The inverse matching makes D regular, so its hat is empty. The matched norm is Ξr,l(D)=∏s∈[r,l]∖RrB(r,s)≠0: B(r,r)=ar≠0, and Rr removes exactly the other zero factors. Thus Tr,l(D)v is nonzero, and the maximal-hat assertion gives h(I,D)=0 for every nonempty I. For r≤j<l, every positive test of ejT(D)v has grade βr−αj. Expanding its root matrices into simple words and appending the rightmost ej gives full words with nonempty canonical Q index, since ej acts before ej+1. All highest coefficients vanish, so positive detection gives ejT(D)v=0. For j<r the target weight is outside dominance below ξ and is zero. A nonconstant Levi coefficient whose weight is not bounded by βr likewise has zero target. At a weight bounded by βr, root-variable exponents are at most one, so the coefficient is a product of positive root matrices, each an iterated simple-root commutator; its rightmost root kills the vector. This proves full group primitivity. The primitive line at ξ−βr is consequently one-dimensional exactly at normal r, and we denote any nonzero vector on it by vr.

6.1step 5.1construct

We separate primitive labels integrally, including p=2. In tensor degree b for Levi rank l, put Ha=Eaa and define (Ha2) to act on a weight ζ by the integer (ζa2) reduced in F. Concretely it is ∑x<yEaa(x)Eaa(y), with no division by 2 in F. The tensor action Zb of the group central transposition sum zb=∑x<y(x,y) satisfies the exact integer identity Zb=∑a(Ha2)+∑a<c(EacEca−Ha). The equal-position part of EacEca is Ha; after subtracting it, the terms are exactly the two swaps of unequal labels. The diagonal terms count equal-label pairs. Since zb commutes with the position group and every Schur endomorphism, this operator belongs to the Schur algebra and is central.

7.1step 6.1construct

On a primitive vector of dominant weight ζ, Eac kills it for a<c, so EacEca acts by Ha−Hc. Therefore Zb has scalar κ(ζ)=∑a(ζa2)−∑c(c−1)ζc=∑(c,j)∈[ζ](j−c). The binomial here is the actual diagonal weight operator of step 6.1. Centrality makes this scalar constant on the cyclic module generated by the vector. For first-level ζr=(ξ1,…,ξl)−ϵr, it is κ(ζr)=κ(ξ)−(ξr−r), so κ(ζt)−κ(ζr)=−C(t,r). Thus the cyclic Levi module Ψr generated by vr cannot contain another primitive vt when C(t,r)≠0. Equality of the scalars alone does not prove simplicity; we treat it explicitly next.

8.1step 7.1construct

Suppose t<r are normal and C(t,r)=0. Choose D for the demands of r as in step 5.1. For w≥r, B(t,w)=B(r,w), and B(t,r)=ar≠0. The demands of t split into Y={y∈(t,r):B(t,y)=0} and Rr. Compensation for Y, inherited from normality of t, has image E below r. Since B(t,r−1)=C(t,r)−1=−1≠0, all those targets and E lie at most r−2. Combining their matching with D gives compensation for every demand of t, so choose vt=Tt,l(E∪D)v and vr=Tr,l(D)v. For each e∈E its matched y gives B(e,y)=B(t,y)=0, hence C(t,e)=0. If E≠∅ and e=max⁡E, then C(e,r)=C(t,r)−C(t,e)=0.

9.1step 8.1F2construct

Splitting (P) gives Tt,r−1(E)vr=vt−Tt,l((E∖{e})∪{r}∪D)v−C(e,r)Tt,l(E∪{r}∪D)v. The last term is zero. The middle term has a (Z) witness with endpoint r−1, outside its cuts because E≤r−2 and D>r. Removing matched source e releases its zero-B target ye; assign t to ye and retain the matching on E∖{e}. All distinct bounded targets are below r−1. Hence that term is zero as well. For E=∅, (P) omits the middle term and its last coefficient is C(t,r)=0. In both cases vt=Tt,r−1(E)vr∈Ψr, without a field denominator.

10.1step 9.1F1construct

The Gaussian argument on a cyclic module, without assuming simplicity, shows that Ψr is spanned by negative Levi coefficients on vr and has weights at most ζr. Any nonzero proper Schur submodule contains a simple Schur submodule and thus a primitive vt by step 3.1. Dominance gives t≤r. For t=r, its one-dimensional line is the generating line and would generate all of Ψr; thus a proper submodule has t<r, and the central scalar requires C(t,r)=0. Conversely, such an earlier normal t gives a proper nonzero Ψt⊂Ψr by step 9.1, since its weights are at most ζt<ζr. Consequently Ψr is simple precisely when r is normal with no earlier normal t satisfying C(t,r)=0. All simple Schur submodules of M are exactly these Ψr, each once: every simple has a primitive highest vector, and each primitive line has dimension one.

11.1step 10.1F5construct

Now assume ξ restricted. The root criterion is its physical signature criterion: ar≠0 identifies the removable node in row r; scanning j>r, a nonzero aj gives a removable push if C(r,j)=0 and an addable pop at row j+1 if B(r,j)=0. These events have the residue of row r; at aj=0 the matching slot supplies and consumes itself and is neutral. For 0<aj<p, the two events are disjoint. The compensation-prefix inequalities are exactly survival of the initial push in the signature stack. Also C(t,r)=(ξt−t)−(ξr−r) compares the residues. Thus the simple cyclic modules in step 10.1 are exactly at the good nodes. Their lower labels are restricted: removing row r decreases ar by one and increases ar−1 by one. The only failure, when r>1, would be ar−1=p−1. Then C(r−1,r)=0, and r−1 is also normal, since its later demands are those of r, B(r−1,r)=ar≠0, and the compensation for r is also valid for r−1. This contradicts goodness. Hence every Schur socle factor survives the restricted-label corner; no assertion is made about the other composition factors.

12.1step 11.1F1F3construct

To transfer without a held generic classifier, for ξ⊢m choose N=m+1 and the regular composition ω=(1m−1,0,1), so ξN=0 even for columns. Compute the cell corner temporarily in its original right-module convention, then transport through star. Its permutation summand is Mω=FSm, and its actual projection e gives eSe=FSm via ρh(x)=hx. Type-ω tableaux correspond to standard tableaux by increasing relabeling 1,…,m−1,N to 1,…,m. Their normalized map fibers are singleton, and evaluation at 1 sends φst to mst. Higher ideals correspond as equality of corner basis spans. The Weyl weight projection keeps exactly these basis vectors; read its cell action using a fixed outer index of the same type and evaluate at 1 to get the Murphy action. Thus Wζe≅CM(ζ) with the actual same-shape normalization.

13.1step 12.1F3construct

In the Schur cell product choose all four indices a,s,t,b standard of type ω. Evaluation at 1 turns φasφtb≡Bζ(ws,wt)φab into masmtb≡Bζ(ws,wt)mab, so the unique Murphy coefficient gives Bζ(ws,wt)=Gζ(cs,ct). The factor is one. Since e∗=e, the Weyl splitting W=We⊕W(1−e) is orthogonal, giving rad⁡form(We)=rad⁡form(W)e, including zero corner forms. Projection is exact by lifting ye through xe and taking kernels fixed by e. Hence Lζe≅CM(ζ)/rad⁡form. The actual q=1 form-unit bridge identifies it with Dζ′⊗sgn⁡, nonzero exactly when ζ′ is regular. Transporting these right-cell identities through star gives the corresponding left corners eWζ and eLζ used below. Their nonzero images are exactly the distinct absolutely simple restricted-label modules D(ζ), with the inverse group convention fixed by the nondegenerate quotient form.

14.1step 13.1construct

Let π1 be the sum of actual weight projections with last coordinate one, so M=π1LN(ξ). The lower Schur orbit matrix EA embeds as Ediag⁡(A,1); on each word with one N it preserves that position and applies EA to the remaining ordered positions. Products agree and the lower identity is π1, and transpose/star is respected. The lower regular projection of ω′=(1m−1,0) maps to e. On the coset-word convention of step 1.1, ρh′ acts by label permutation h−1 on the used lower labels, fixing N, identically to ρh for the subgroup fixing the last entry of Sm. Thus, in the left convention, e′M=eLN(ξ)↓Sm−1. Write SL=S(N−1,m−1) for this lower Schur algebra; every socle and corner lift of M below is over SL. The inverse/star equivalence passes between right and left modules and commutes with this embedding, restriction and sign; the ordinary simple labels are fixed by their nondegenerate invariant quotient forms. No self-duality of a degenerate Specht module is assumed.

15.1step 14.1F1construct

Socle preservation requires more than exactness. By step 11.1 every Schur socle simple of M survives e′. A nonzero Schur submodule killed by e′ would contain a simple submodule inside that socle, whose corner is nonzero, a contradiction. Now a group-simple injection j:D→e′M corresponds to SLe′⊗e′SLe′D→M, se′⊗x↦sj(x), s∈SL. Its image I is generated by its corner e′I=j(D). A proper Schur submodule J of I has either e′J=0, excluded by the no-killed-submodule property, or e′J=e′I, which generates I and forces J=I. Thus I is simple. Every group-simple corner submodule lifts to an actual Schur simple submodule, and conversely every surviving Schur simple has simple corner. Exactness on the semisimple sum, distinct labels and the one-dimensional primitive lines yield soc⁡FSm−1(e′M)=e′soc⁡SLM, multiplicity-free with exactly the good-deletion labels. The unused coordinate includes columns and m=1, whose lower degree-zero corner is F.

16.1step 15.1F5construct

The group central zm acts on D(ξ) by κ(ξ), since its tensor action is step 6.1 and its regular-summand action is ρzm; right multiplication equals left multiplication for this central element. On the good lower label it acts by κ(ξ−A). Therefore Lm=zm−zm−1 has scalar res⁡(A) on that simple submodule, with the restricted convention c−r. Primary projection selects just that residue, and socles respect the actual direct sum. We obtain soc⁡EiD(ξ)=D(ξ−Ai) when εi(ξ)>0, and zero otherwise. In the latter case EiD(ξ)=0, since a nonzero finite-dimensional module contains a simple submodule.

17.1step 16.1F3F5construct

The invariant nondegenerate quotient form makes D(ξ) self-dual. A primary polynomial projector in Lm is self-adjoint, since the inverse involution fixes Lm, so its summand has a restricted nondegenerate invariant form. Its head is therefore dual to its simple socle and is the same simple. Thus for every restricted η,τ of consecutive degrees, dim⁡FHom⁡(EiD(η),D(τ)) is one if εi(η)>0 and η−good⁡i(η)=τ, and zero otherwise. The scalar endomorphism ring is F by absolute simplicity. This all-pairs criterion includes the zero case and all initially possible primitive weights; it does not discard middle composition factors.

18.1step 17.1F5construct

We justify the needed functor interfaces locally. In ZSn the Jucys identity is ∏r=1n(u+Lr)=∑g∈Snu#cycles⁡(g)g. Induct on n: choosing u leaves n fixed, and choosing (a,n) inserts it next to a in a cycle, bijectively covering the non-fixed permutations. Hence each elementary symmetric JM coefficient is central over every field. On a simultaneous primary tuple these operators have generalized eigenvalues equal to its elementary symmetric residue coefficients; nilpotence follows by expanding a polynomial in the commuting nilpotent differences. Distinct residue multisets have distinct coefficient tuples, since their monic products of prime-field linear factors retain multiplicities uniquely even in characteristic p. For each elementary symmetric operator, construct its univariate primary projectors by the same polynomial CRT construction as in [F5], then multiply these commuting projectors. This gives the content projector equal to the sum of tuple projectors of that content. This proves content centrality without factorial division, position-dependent symmetric-polynomial claims, or content-block primitivity. The projectors are inverse-fixed. For an input in content α, induction projection by right eαPd+1,i is the same as right Pd+1,i, because geα⊗x=g⊗eαx. An absolutely simple D(μ) lies in exactly one of these central contents, since their scalar idempotents are orthogonal and sum to one; denote it by α. Thus these interfaces agree with the actual functor definition.

19.1step 18.1construct

Put G=Sd+1, H=Sd, and let EH:FG→FH truncate group coefficients. For left modules the natural Frobenius map is Φ(g⊗x)(y)=EH(yg)x, with coinduction action (aq)(y)=q(ya). It is balanced and G-linear by EH(hz)=hEH(z) and EH(zh)=EH(z)h. For a left-coset transversal T of G/H, its inverse is Ψ(q)=∑r∈Tr⊗q(r−1). The right cosets Hr−1 partition G, so evaluation at y has exactly the term yr∈H and returns q(y). On g⊗x the unique term with r−1g∈H balances back to g⊗x. These verify both identities and naturality with correct cosets and only finite choices.

20.1step 19.1construct

Let e=eαPd+1,i, commuting with FH and inverse-fixed. For any such centralizer element, EH(eZ)=EH(Ze): the coefficient at h is the group coefficient trace τ(h−1eZ)=τ(h−1Ze), by cyclicity and commuting e with h−1. Under Φ, the value at one of right projection Re is consequently q(e). If f:N→Coind⁡X is G-linear, f(en)(1)=f(n)(e). Evaluation therefore identifies projected maps N→FiX with H-maps EiN→X; conversely an H-map extends via qn(y)=h(eyn), with h:EiN→X evaluated after the projector e. For X=eαX, every H-map already selects the matching content. Thus Hom⁡G(N,FiX)≅Hom⁡H(EiN,X) exactly, with no duality shift and no asserted equality of composition multiplicities.

21.1step 20.1F5construct

The labelled signature inverse is local. Adding or removing a corner flips its i-sign, and the other boundary statuses that can change have residues i±1, not i for p≥2. In the stack reduction, flipping the last surviving plus gives the first surviving minus and conversely: before that position the minus stack is empty, and its distinguished minus survives exactly when every suffix prefix has at least as many minus pushes as plus pops, equivalent to no later plus surviving after the flip. Good removal preserves restrictedness by step 11.1. Cogood addition also does: its only possible new forbidden difference is ar=p−1, in which case the addable node in row r+1 has the same residue, with no i-node between the two pluses. If the earlier plus survives, the later one also survives, contradicting that the earlier is cogood. Hence addition remains restricted and the inverse holds in both directions. In particular B is cogood for μ exactly when it is good for ν=μ∪B. No equality between εi(ν) and φi(μ) is used.

22.1step 21.1F3construct

Apply step 20.1 with N=D(η) and X=D(μ) for every restricted η⊢d+1. By step 17.1 the resulting Hom space is one-dimensional precisely when η−good⁡i(η)=μ, and zero otherwise. Step 21.1 makes exactly one such label, namely ν=μ∪B. The group simple classification covers every simple by these absolutely irreducible labels. The dimensions of all simple-to-module Hom spaces therefore identify the socle of FiD(μ) as the single D(ν), with socle multiplicity one, excluding every other label.

23.1step 22.1F3F5construct

Give Ind⁡HGD(μ) the invariant nondegenerate coset form β(r⊗x,s⊗y)=δrsβμ(x,y) on a finite left transversal. A group element permutes cosets and acts by H on the fibers, proving invariance. Equivalently its value on general group representatives is βμ(x,EH(g−1h)y). The projection Re is self-adjoint: moving it to the first argument gives EH(e∗g−1h), which equals EH(g−1he∗) by the trace calculation of step 20.1, and e∗=e. Its image is orthogonal to the complement and inherits a nondegenerate invariant form. Thus FiD(μ) is self-dual, and its head is the dual of its simple socle, namely D(ν) through the nondegenerate invariant quotient form. This proves both endpoints, including characteristic two.

24.1step 23.1F1F3construct

For d=0, the empty partition has one conormal node (1,1) of residue zero and φ0=1. Induction from S0 to S1 is F, with L1=0, so F0D(∅)=D(1)=F has these endpoints; other residue functors are zero. Every use of F(t) above descends to the original field: weight projections and coefficient operators have matrices over F, finite Hom ranks preserve extension, and the simple Schur and group labels remain absolutely simple. Therefore the endpoint assertions hold over every original field of characteristic p.

25.1step 24.1F4F5construct∎

The total multiplicity is the separate use of [F4]. Apply it to the cogood B, which is bottommost conormal. Its conormal nodes weakly above it are exactly all φi(μ) conormal nodes, so [FiD(μ):D(ν)]=φi(μ). Combining this count with the independently constructed endpoints proves the full statement. The implication uses no equality of induction and restriction composition counts and no equality εi(ν)=φi(μ).

Remark

Steps 1.1–17.1 also prove the following restriction endpoint, independently of the uncoloured-socle corollary: for every p-restricted ξ⊢m with m≥1, soc⁡EiD(ξ)={D(ξ∖Ai),εi(ξ)>0,0,εi(ξ)=0, where Ai is the good i-node and its deletion remains p-restricted. The scalar is the node residue in step 16.1. The proof covers every field of characteristic p, including p=2, using the unused coordinate N=m+1 and the degree-zero lower corner when m=1.

This is the recovered research-only first construction proposal for the exact cogood endpoint case, not a native-ready decision. The saved native50 construction and mathematical steps are reused; recovery has not opened another review or repair round. The endpoint proof is local; the complete target uses the independently reviewed conormal-count companion [F4], which must be integrated first. The actual canonical good-node/uncoloured-socle items and the survey statements are not endpoint proof premises. No general finite-e classifier is used or reopened.

The former unused equality in F3 was false: for p=2, μ=(1), its two addable 1-nodes are conormal, so φ1(μ)=2; for ν=(1,1) one has ε1(ν)=1. The true labelled good/cogood inverse is proved above. Simple endpoint multiplicity one and total composition multiplicity two in this example are consistent.

The authentic cached Kleshchev 1995 II scan (SHA-256 6a7a7856d3eb8c8198920c02bdcdd16d8b350f024d39ae96215f072050bc368c, 51 PDF pages) was recorded by the original native50 constructor as read visually on every printed page 198–212 and 163–166. The recovery constructor read the saved proof, proposal and handoffs; it does not claim to have repeated that visual reading. These include the full Theorems 4.2 and 4.11 proofs/continuations and the actual Theorem 0.5 statement. The scan ends with section 4 and references, not a section 5. The source's strong-linkage citation in 4.11 is replaced here by the integral central tensor operator and explicit compensated containment. No full-article/book reading or new retrieval is claimed. Source reading, preimages, pending interfaces and exact hashes are recorded in the accompanying handoff; all prior K/50 seals and caps remain untouched.

Depends on

Used by

Dependency tree · two levels

72 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