OctoInformBeta

Foulkes' conjecture for sixth powers and quadratic stabilization

Let VV be a finite-dimensional complex vector space, and let a≥1a\ge1 and b≥0b\ge0 be integers. The canonical Foulkes-Howe map μa,b,V:Sym⁡b(Sym⁡aV)→Sym⁡a(Sym⁡bV)\mu_{a,b,V}:\operatorname{Sym}^b(\operatorname{Sym}^a V)\longrightarrow\operatorname{Sym}^a(\operatorname{Sym}^b V) is the linear map specified by μa,b,V(u1a⋯uba)=(u1⋯ub)a\mu_{a,b,V}(u_1^a\cdots u_b^a)=(u_1\cdots u_b)^a for vectors u1,…,ub∈Vu_1,\ldots,u_b\in V. The stabilization question asks for a nonnegative degree b0b_0 such that μa,b,V\mu_{a,b,V} is surjective for every b≥b0b\ge b_0.

Brion proved eventual surjectivity for fixed aa and VV. Brion subsequently gave an effective bound involving both aa and dim⁡V\dim V. Landsberg asked for a polynomial stabilization bound.

The preprint proves that μa,b,V\mu_{a,b,V} is surjective whenever a≥2a\ge2 and b≥a(a−1)b\ge a(a-1).

The Lean library proves existence of the canonical map in this surjectivity range. The Lean library also proves uniqueness in this range. For a=1a=1, the Lean library proves that the canonical map is bijective in every degree, including b=0b=0. Lean has checked every result of the Lean library, so the Lean library is the reference for the statements on these pages. Where the preprint gives a different formulation, the Lean library’s statement is given beside the preprint’s. The preprint is a guide only to the order and names of the results.

The Lean library: FoulkesHowe

FoulkesHowe is a Lean library: 16 items, in five groups. Each has a page written by OctoInform, listed below.

§1. Introduction 3 items
  1. §1 (setting): symmetric powers and the specified canonical map A canonical map between iterated symmetric powers.
  2. Theorem 1 Surjectivity in the quadratic range.
  3. §1 (unnumbered): the degree-one case Degree one gives a natural equivalence.
§2. The canonical image and diagonal vanishing 2 items
  1. §2 (setting): products, pure powers and symmetric multilinear forms Products and forms on symmetric powers.
  2. §2 (unnumbered criterion): diagonal vanishing detects surjectivity Diagonal vanishing forces canonical surjectivity.
§3. Differential injectivity 2 items
  1. §3 (setting): coordinate blocks and directional derivatives Directional derivatives on independent coordinate blocks.
  2. Lemma 2 Injectivity when the source block has greater degree.
§4. Vanishing on products 7 items
  1. Proposition 3 Products test vanishing above a quadratic bound.
  2. §4 (proof of Proposition 3): parameter reduction and induction setup Induction from product transfer statements.
  3. §4 (proof of Proposition 3, Step 1): splitting a binary form Diagonal vanishing constrains a mixed argument.
  4. §4 (proof of Proposition 3, Step 2): freeing the distinguished slot Freeing the distinguished argument by transfer.
  5. §4 (proof of Proposition 3, Step 3): induction on the remaining slots Second transfer gives vanishing on products.
  6. §4 (proof of Proposition 3, Step 4): removing the common power Removing common powers from multilinear arguments.
  7. §4 (proof of Theorem 1): assembly from diagonal vanishing Diagonal vanishing gives the canonical surjection.
§5. Representation comparison and scope 2 items
  1. §5 (setting): the natural GL(V) actions and equivariant embeddings Linear changes induce plethysm actions.
  2. Corollary 4 Equivariant comparison under a quadratic bound.

No item matches.