OctoInformBeta

OpenAI preprint, September 2026 · §1. Introduction

Theorem 1: The unique Foulkes-Howe map for finite-dimensional complex spaces in natural degrees a≥2a\geq2 and b≥a(a−1)b\geq a(a-1)

Surjectivity in the quadratic range.

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 Foulkes-Howe construction rearranges products of symmetric monomials. A bb-fold product of degree aa monomials is sent to an average of aa-fold products of degree bb monomials, using a bb-by-aa array of vectors.

For a complex vector space WW, let Sym⁡W\operatorname{Sym}W be its symmetric algebra and ιW:W→Sym⁡W\iota_W:W\to\operatorname{Sym}W its canonical inclusion. For a natural number nn, put In={0,…,n−1}I_n=\{0,\ldots,n-1\}. The symmetric monomial of a family w:In→Ww:I_n\to W is the product mnW(w)=∏i∈InιW(wi)m_n^W(w)=\prod_{i\in I_n}\iota_W(w_i)(1)✦ in Sym⁡W\operatorname{Sym}W. The nnth symmetric power of WW is the homogeneous subspace spanned by the monomials in (1): Sym⁡nW=span⁡ℂ{mnW(w):w:In→W}⊆Sym⁡W.\operatorname{Sym}^n W =\operatorname{span}_{\mathbb C} \{m_n^W(w):w:I_n\to W\} \subseteq\operatorname{Sym}W.(2)✦ Each mnW(w)m_n^W(w) will also denote the corresponding element of Sym⁡nW\operatorname{Sym}^n W in (2).✦

Let a,ba,b be natural numbers and VV a complex vector space. Write 𝔖(Ia)\mathfrak S(I_a) for the permutation group of IaI_a. For an array v:Ib×Ia→Vv:I_b\times I_a\to V, the Foulkes expression Fa,b,V(v)F_{a,b,V}(v) is the following element of Sym⁡a(Sym⁡bV)\operatorname{Sym}^a(\operatorname{Sym}^b V): Fa,b,V(v)=1(a!)b∑σ∈𝔖(Ia)IbmaSym⁡bV(i↦mbV(j↦vj,σj(i))).F_{a,b,V}(v) =\frac{1}{(a!)^b} \sum_{\sigma\in\mathfrak S(I_a)^{I_b}} m_a^{\operatorname{Sym}^b V} \left(i\longmapsto m_b^V\bigl(j\longmapsto v_{j,\sigma_j(i)}\bigr)\right).(3)✦ A Foulkes map μ:Sym⁡b(Sym⁡aV)→Sym⁡a(Sym⁡bV)\mu:\operatorname{Sym}^b(\operatorname{Sym}^a V) \to\operatorname{Sym}^a(\operatorname{Sym}^b V) is a complex linear map whose value on every product of row monomials is the expression in (3): μ(mbSym⁡aV(j↦maV(i↦vj,i)))=Fa,b,V(v)(v:Ib×Ia→V).\mu\left( m_b^{\operatorname{Sym}^a V} \bigl(j\longmapsto m_a^V(i\longmapsto v_{j,i})\bigr) \right)=F_{a,b,V}(v) \qquad(v:I_b\times I_a\to V).(4)

The Claim

Theorem 1. Let VV be a finite-dimensional complex vector space, and let a,ba,b be natural numbers with a≥2a\geq2 and b≥a(a−1)b\geq a(a-1). There is a unique Foulkes map satisfying (4), denoted by μa,b,V\mu_{a,b,V}, and it is surjective: μa,b,V:Sym⁡b(Sym⁡aV)↠Sym⁡a(Sym⁡bV).\mu_{a,b,V}:\operatorname{Sym}^b(\operatorname{Sym}^a V) \twoheadrightarrow\operatorname{Sym}^a(\operatorname{Sym}^b V).(5)✦

In the paper, the result reads: for every integer a≥2a\geq2, every integer b≥a(a−1)b\geq a(a-1), and every finite-dimensional complex vector space VV, μa,b,V\mu_{a,b,V} is surjective, equivalently Ab=RbA_b=R_b, where AbA_b is its image and RbR_b its target.

What Is Checked

The claim in (5) is stated over complex linear maps between the iterated homogeneous subspaces in (2), subject to the Foulkes condition (4), for finite-dimensional VV and natural degrees a,ba,b with a≥2a\geq2 and b≥a(a−1)b\geq a(a-1).