OctoInformBeta

OpenAI preprint, September 2026 · §4. Vanishing on products

§4 (proof of Proposition 3): parameter reduction and induction setup: Parameter bounds and pure power determination for symmetric multilinear forms

Induction from product transfer statements.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

The question is whether a symmetric multilinear form on copies of a symmetric power is determined by its values on repeated products of vectors.

Let VV be a complex vector space of arbitrary dimension, and let all degrees be natural numbers. Write Finn={0,…,n−1}\mathrm{Fin}\,n=\{0,\ldots,n-1\} and let ι:V→A\iota:V\to A, where A=SymmetricAlgebra⁡(ℂ,V)A=\operatorname{SymmetricAlgebra}(\mathbb C,V), be the canonical inclusion. For a family y:Finn→Vy:\mathrm{Fin}\,n\to V, the ambient symmetric monomial Pn(y)∈AP_n(y)\in A is the product in (1). Pn(y)=∏i∈Finnι(yi).P_n(y)=\prod_{i\in\mathrm{Fin}\,n}\iota(y_i).(1)✦ The symmetric power Sym⁡nV\operatorname{Sym}^n V is the homogeneous subspace of degree nn defined by (2). Sym⁡nV=span⁡ℂ{Pn(y):y:Finn→V}⊆A.\operatorname{Sym}^n V =\operatorname{span}_{\mathbb C} \{P_n(y):y:\mathrm{Fin}\,n\to V\}\subseteq A.(2) A symmetric monomial Pn(y)P_n(y) in Sym⁡nV\operatorname{Sym}^n V is the product in (1) of a family yy of nn vectors of VV. Write vn=Pn((v)i∈Finn)v^n=P_n((v)_{i\in\mathrm{Fin}\,n}) for v∈Vv\in V.

Let ℳa,b(V)\mathcal M_{a,b}(V) be the vector space of complex multilinear maps T:(Sym⁡bV)Fina→ℂT:(\operatorname{Sym}^b V)^{\mathrm{Fin}\,a}\to\mathbb C.✦ A form T∈ℳa,b(V)T\in\mathcal M_{a,b}(V) is symmetric if it satisfies (3) for every permutation σ\sigma of Fina\mathrm{Fin}\,a and every family q:Fina→Sym⁡bVq:\mathrm{Fin}\,a\to\operatorname{Sym}^b V. T((qσ(i))i∈Fina)=T((qi)i∈Fina).T((q_{\sigma(i)})_{i\in\mathrm{Fin}\,a}) =T((q_i)_{i\in\mathrm{Fin}\,a}).(3)✦

Symmetric power multiplication is the bilinear map (4), where pqpq is multiplication in AA. Sym⁡rV×Sym⁡mV→Sym⁡r+mV,(p,q)↦pq.\operatorname{Sym}^r V\times\operatorname{Sym}^m V \longrightarrow\operatorname{Sym}^{r+m}V, \qquad (p,q)\longmapsto pq.(4)✦ For T∈ℳr+1,r+m(V)T\in\mathcal M_{r+1,r+m}(V) and x,t∈Vx,t\in V, the lower product form Lx,tT∈ℳr,m(V)L^T_{x,t}\in\mathcal M_{r,m}(V) is defined by (5) for Q:Finr→Sym⁡mVQ:\mathrm{Fin}\,r\to\operatorname{Sym}^m V; the displayed pure power is the first argument of TT. Lx,tT(Q)=T(tr+m,(xrQi)i∈Finr).L^T_{x,t}(Q)=T\bigl(t^{r+m},(x^rQ_i)_{i\in\mathrm{Fin}\,r}\bigr).(5)✦

The Claim

Theorem 1. Let a,ba,b be natural numbers with a≥2a\geq2 and b≥a(a−1)b\geq a(a-1), and set r=a−1r=a-1 and m=b−rm=b-r. The parameter bounds are (6). r≥1,r(r+1)≤b,r2≤m,m≥1,r(r−1)≤m.r\geq1,\qquad r(r+1)\leq b,\qquad r^2\leq m, \qquad m\geq1,\qquad r(r-1)\leq m.(6)✦

Let VV be a complex vector space. Assume the following two transfer properties for every pair of natural numbers r,m≥1r,m\geq1 with (r+1)r≤r+m(r+1)r\leq r+m and every symmetric form T∈ℳr+1,r+m(V)T\in\mathcal M_{r+1,r+m}(V).

For the first transfer property, suppose that T((Pr+m(y))i∈Fin(r+1))=0T((P_{r+m}(y))_{i\in\mathrm{Fin}\,(r+1)})=0 for every y:Fin(r+m)→Vy:\mathrm{Fin}\,(r+m)\to V; require (7). Lx,tT((Pm(y))i∈Finr)=0(x,t∈V,y:Finm→V).L^T_{x,t}((P_m(y))_{i\in\mathrm{Fin}\,r})=0 \quad \bigl(x,t\in V,\ y:\mathrm{Fin}\,m\to V\bigr).(7) For the second transfer property, suppose that Lx,tT(Q)=0L^T_{x,t}(Q)=0 for every x,t∈Vx,t\in V and every Q:Finr→Sym⁡mVQ:\mathrm{Fin}\,r\to\operatorname{Sym}^m V; require (8). T((vir+m)i∈Fin(r+1))=0(v:Fin(r+1)→V).T((v_i^{r+m})_{i\in\mathrm{Fin}\,(r+1)})=0 \quad\bigl(v:\mathrm{Fin}\,(r+1)\to V\bigr).(8) Assume also pure power determination: for all natural numbers c,dc,d, every form F∈ℳc,d(V)F\in\mathcal M_{c,d}(V) that vanishes on (vid)i∈Finc(v_i^d)_{i\in\mathrm{Fin}\,c} for every v:Finc→Vv:\mathrm{Fin}\,c\to V is zero.

For natural numbers a,b≥1a,b\geq1 with a(a−1)≤ba(a-1)\leq b, let T∈ℳa,b(V)T\in\mathcal M_{a,b}(V) be symmetric and suppose that T((Pb(y))i∈Fina)=0T((P_b(y))_{i\in\mathrm{Fin}\,a})=0 for every y:Finb→Vy:\mathrm{Fin}\,b\to V. Then (9) holds. T=0.T=0.(9)✦

In the paper, the result reads: for a≥2a\geq2, setting r=a−1r=a-1 and m=b−rm=b-r, the bound b≥a(a−1)b\geq a(a-1) gives b≥r(r+1)b\geq r(r+1), m≥r2≥1m\geq r^2\geq1 and m≥r(r−1)m\geq r(r-1), permitting induction on the number of slots.

What Is Checked

The claims are stated over natural degree parameters and multilinear forms on symmetric powers of an arbitrary complex vector space, with symmetry given by (3) and lower product forms given by (5). The homogeneous product containment underlying (4) is (10). (Sym⁡rV)(Sym⁡mV)⊆Sym⁡r+mV(r,m∈ℕ).(\operatorname{Sym}^r V)(\operatorname{Sym}^m V) \subseteq\operatorname{Sym}^{r+m}V\qquad(r,m\in\mathbb N).(10)✦