arxiv: 2604.27163 · v1 · submitted 2026-04-29 · 🧮 math.AC

Recognition: unknown

Reverse Tableaux and the Surjectivity of the Component Map in Type A

Yasmine Fittouhi

Authors on Pith no claims yet

Pith reviewed 2026-05-07 10:16 UTC · model grok-4.3

classification 🧮 math.AC

keywords reverse tableauxcomponent mapBenlolo-Sanderson invariantsnilfibreparabolic subgroupssemi-invariantstype Asurjectivity

0 comments

The pith

The Factorization Principle for Benlolo-Sanderson invariants establishes surjectivity of the component map from reverse tableaux to irreducible components of the nilfibre.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper completes the proof that the component map φ from the set of component tableaux to the irreducible components of the nilfibre is surjective. It introduces the Factorization Principle showing that Benlolo-Sanderson invariants decompose into products indexed by pseudo-neighbouring column pairs in the associated reverse tableaux. This decomposition guarantees that each irreducible component arises from exactly one such tableau without loss or merging of components. A reader cares because it turns the earlier combinatorial construction of component tableaux into a complete bijection with the geometry of the nilfibre for parabolic nilradicals in type A. The result builds directly on the injectivity shown in prior work to give a full combinatorial parametrization.

Core claim

The component map φ: {component tableaux} → Irr(N) is surjective, where N is the nilfibre V(I_+) inside the nilradical m of a parabolic P in SL(n,C). Surjectivity follows from the Factorization Principle, under which the generators of the semi-invariant ring C[m]^{P'} factor as products over pseudo-neighbouring column pairs; each such factorization corresponds to the Red Set data of a unique reverse tableau and therefore hits a distinct irreducible component of N.

What carries the argument

The Factorization Principle, which decomposes Benlolo-Sanderson invariants into products indexed by pseudo-neighbouring column pairs of reverse tableaux so that every irreducible component of the nilfibre is reached exactly once.

If this is right

The map φ is bijective, so the irreducible components of N are in one-to-one correspondence with component tableaux.
The geometry of the nilfibre is completely parametrized by the combinatorial data of the Red Set.
Explicit equations for each component can be read off from the factored invariants associated to its tableau.
The polynomial generators of the semi-invariant ring C[m]^{P'} admit a canonical product decomposition compatible with the parabolic composition.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same factorization technique could be tested on the nilfibre of other parabolic subgroups or in small-rank cases to produce explicit lists of components.
This combinatorial indexing may connect to the representation theory of the Levi factor of P through the graded structure of the semi-invariants.
One could ask whether the reverse-tableau construction lifts to give a stratification of the whole nilradical rather than only its nilfibre.

Load-bearing premise

The factorization of the relevant invariants into products indexed by pseudo-neighbouring column pairs ensures that every irreducible component is reached in a controlled way without loss or merging.

What would settle it

Discovery of an irreducible component of N whose vanishing ideal is not generated by any collection of Benlolo-Sanderson invariants that arise from the pseudo-neighbouring factorization of a reverse tableau.

Figures

Figures reproduced from arXiv: 2604.27163 by Yasmine Fittouhi.

**Figure 1.** Figure 1: The reverse tableau for the composition (1, 2, 3, 3, 1, 2) with C = C2, C ′ = C6, and s = 2. After implementing (C3, C4) and (C1, C5), the entries 9 and 10 become red. In the resulting trapezium, the height-2 columns are Ce0, Ce1, Ce2, Ce3, so the pseudo-neighbouring pairs are (Ce0, Ce1), (Ce1, Ce2), and (Ce2, Ce3). The following factorisation result is the algebraic reason why red entries can record comp… view at source ↗

read the original abstract

Let $G = \mathrm{SL}(n,\mathbb{C})$, let $B$ be a fixed Borel subgroup, and let $P \supset B$ be a parabolic subgroup determined by a composition $(c_1,\dots,c_k)$ of $n$. Write $P'$ for the derived group of $P$ and $\mathfrak{m}$ for the Lie algebra of the nilradical of $P$. By Richardson's theorem the algebra of semi-invariants $\mathscr{I} := \mathbb{C}[\mathfrak{m}]^{P'}$ is polynomial; in type $A$ its generators may be taken to be the Benlolo--Sanderson (BS) invariants. The \emph{nilfibre} is the common zero locus $\mathscr{N} := V(\mathscr{I}_{+}) \subset \mathfrak{m}$. A set of \emph{component tableaux}, each encoding combinatorial data summarised in a multi-set called the \emph{Red Set}, was constructed in earlier work by Y. Fittouhi and A. Joseph in The reverse tableau: a gateway to the surjectivity of the component map. The resulting \emph{component map} $\phi : \{\text{component tableaux}\} \to \Irr(\mathscr{N})$ was shown to be injective. In the present article, we develop the Factorization Principle for Benlolo--Sanderson invariants in order to give a rigorous proof of the surjectivity of the component map $\phi$. While the combinatorial framework of reverse tableaux was introduced in a work by Y. Fittouhi and A. Joseph cited above, the surjectivity of $\phi$ remained conjectural: the linearization method used there did not exclude the possible loss or merging of irreducible components. The present paper resolves this geometric difficulty by showing that the relevant invariants factorize into products indexed by pseudo-neighbouring column pairs, thereby ensuring that every component is reached in a controlled and accountable way.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

This paper proves surjectivity of the component map by introducing a factorization principle for BS invariants, closing the conjecture from the prior work.

read the letter

The main point is that this paper resolves the surjectivity of the component map φ from reverse tableaux to irreducible components of the nilfibre. It does so with a new Factorization Principle that expresses the Benlolo-Sanderson invariants as products over pseudo-neighbouring column pairs, giving the geometric control that the earlier linearization method lacked. Together with the injectivity already shown, this yields the full bijection. The argument is presented as independent of the linearization issues and directly ties the factorization to the Red Set data, which looks like a clean way to avoid coalescence or omission of components. The stress-test found no visible internal inconsistencies in the structure, so the central claim holds up on the description given. A soft spot is the reliance on the authors' own prior combinatorial framework for the tableaux and Red Sets; if that setup has any unexamined edge cases, they would carry through here. The factorization itself seems to stand on its own, but full verification of the product formulas and their zero loci would need checking in the manuscript. This is for specialists in algebraic combinatorics and geometric representation theory who work with nilfibre components or semi-invariants in type A. Anyone already using the reverse tableaux construction will find it directly useful for explicit calculations. It deserves a serious referee because it supplies the missing half of the parametrization with a concrete new principle that could extend to related problems.

Referee Report

0 major / 3 minor

Summary. The manuscript claims to prove the surjectivity of the component map φ from the set of component tableaux (equipped with Red Sets) to the irreducible components Irr(𝒩) of the nilfibre 𝒩 = V(ℐ₊) ⊂ m, where ℐ is the polynomial algebra of Benlolo–Sanderson semi-invariants on the nilradical m of a parabolic P ⊃ B in SL(n,ℂ). Building on the authors’ prior work establishing injectivity of φ, the new Factorization Principle expresses the BS invariants as products indexed by pseudo-neighbouring column pairs; the resulting hypersurface equations are shown to cut out precisely the components indexed by reverse tableaux without coalescence or omission.

Significance. If the central argument holds, the result supplies a bijective combinatorial parametrization of the irreducible components of the nilfibre via reverse tableaux, completing the program begun in the cited predecessor paper. This furnishes an explicit, accountable description of the geometry of the nilfibre in type A that was previously obstructed by the limitations of linearization; the factorization technique itself may prove reusable in related questions on semi-invariants and nilpotent varieties.

minor comments (3)

[Abstract and §1] The abstract and introduction refer to “pseudo-neighbouring column pairs” and the Red Set without a self-contained sentence recalling their definition from the prior work; a single clarifying sentence would aid readers who have not yet consulted the earlier paper.
[Section introducing the Factorization Principle] In the statement of the Factorization Principle, the precise indexing set for the product (i.e., which pairs are pseudo-neighbouring for a given reverse tableau) should be recorded as a displayed equation or lemma for easy reference in later arguments.
[References] The manuscript cites the predecessor paper only by title; adding the arXiv identifier or journal details in the bibliography would improve traceability.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive and insightful report, including the recognition of the significance of establishing surjectivity of the component map φ via the Factorization Principle. This completes the bijective combinatorial parametrization of Irr(𝒩) by reverse tableaux in type A. The recommendation for minor revision is noted; we will incorporate any editorial or minor clarifications in the revised manuscript. No explicit major comments or criticisms were raised in the report.

Circularity Check

0 steps flagged

No significant circularity; derivation self-contained via new factorization

full rationale

The paper introduces the Factorization Principle for Benlolo-Sanderson invariants as a new tool to establish surjectivity of the component map φ, after the prior work (cited for the reverse-tableaux framework and Red Sets) had only established injectivity and left surjectivity conjectural due to possible component loss or merging under linearization. The central argument proceeds by showing that the invariants factor into products indexed by pseudo-neighbouring column pairs, yielding hypersurface equations whose zero loci match the irreducible components indexed by the tableaux without coalescence or omission. This step is developed and justified within the present manuscript and does not reduce by definition, redefinition, or self-citation chain to the inputs of the prior paper; the cited framework supplies setup and one direction but the geometric control for the missing direction is independent content supplied here.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Only the abstract is available; no explicit free parameters, axioms, or invented entities are identifiable from the given text.

pith-pipeline@v0.9.0 · 5662 in / 1127 out tokens · 45985 ms · 2026-05-07T10:16:31.300455+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

16 extracted references · 1 canonical work pages · 1 internal anchor

[1]

M. F. Atiyah and I. G. Macdonald,Introduction to Commutative Algebra, Addison–Wesley Series in Mathematics, Westview Press, Boulder, CO, 2016 (reprint of 1969 edition)

2016
[2]

Benlolo and Y

E. Benlolo and Y. B. Sanderson, On the hypersurface orbital varieties ofsl(N,C),J. Algebra245 (2001), no. 1, 225–246

2001
[3]

Eisenbud,Commutative Algebra with a View Toward Algebraic Geometry, Graduate Texts in Math- ematics, Vol

D. Eisenbud,Commutative Algebra with a View Toward Algebraic Geometry, Graduate Texts in Math- ematics, Vol. 150, Springer-Verlag, New York, 1995

1995
[4]

Fittouhi and A

Y. Fittouhi and A. Joseph, Weierstrass sections for parabolic adjoint actions in typeA,J. Algebra 618(2023), 1–41

2023
[5]

Fittouhi and A

Y. Fittouhi and A. Joseph, Parabolic adjoint action, Weierstrass sections and components of the nilfibre in typeA,Indag. Math.(N.S.), online January 2026

2026
[6]

Fittouhi and A

Y. Fittouhi and A. Joseph, The canonical component of the nilfibre for parabolic adjoint action, Weierstrass sections in typeA,J. Algebraic Combin.59(2024), 523–559

2024
[7]

Fittouhi and A

Y. Fittouhi and A. Joseph, The composition tableau and reconstruction of the canonical Weierstrass section for parabolic adjoint action in typeA,J. Algebra632(2023), 1–30

2023
[8]

Fittouhi and A

Y. Fittouhi and A. Joseph, The magic and mystery of component tableaux,Indag. Math.(N.S.), online January 2026

2026
[9]

The Reverse Tableaux: a Gateway to the Surjectivity of the Component Map

Y. Fittouhi and A. Joseph, The reverse tableau: a gateway to the surjectivity of the component map redressing. arXiv:2604.18100, 2026

work page internal anchor Pith review Pith/arXiv arXiv 2026
[10]

Fittouhi and A

Y. Fittouhi and A. Joseph, L’ensemble rouge, in preparation
[11]

Hartshorne,Algebraic Geometry, Graduate Texts in Mathematics, Vol

R. Hartshorne,Algebraic Geometry, Graduate Texts in Mathematics, Vol. 52, Springer-Verlag, New York, 1977

1977
[12]

Joseph and A

A. Joseph and A. Melnikov, Quantization of hypersurface orbital varieties insl(n), in:The Orbit Method in Geometry and Physics (Marseille, 2000), Progr. Math.213, Birkh¨ auser Boston, 2003, pp. 165–196

2000
[13]

Kostant, The solution to a generalized Toda lattice and representation theory,Adv

B. Kostant, The solution to a generalized Toda lattice and representation theory,Adv. Math.34 (1979), no. 3, 195–338

1979
[14]

Matsumura,Commutative Ring Theory, Cambridge Studies in Advanced Mathematics, Vol

H. Matsumura,Commutative Ring Theory, Cambridge Studies in Advanced Mathematics, Vol. 8, Cambridge University Press, Cambridge, 1986

1986
[15]

Spaltenstein, On the fixed point set of a unipotent element on the variety of Borel subgroups, Topology16(1977), no

N. Spaltenstein, On the fixed point set of a unipotent element on the variety of Borel subgroups, Topology16(1977), no. 2, 203–204

1977
[16]

Steinberg, An occurrence of the Robinson–Schensted correspondence,J

R. Steinberg, An occurrence of the Robinson–Schensted correspondence,J. Algebra113(1988), no. 2, 523–528

1988