Young symmetrizers #
For a Young tableau t, this file defines the row symmetrizer a_t, the column
antisymmetrizer b_t, and the Young symmetrizer c_t = a_t b_t in the rational group
algebra of the symmetric group on the entries of t.
The defining coefficient formulas are accompanied by the translation laws that characterize
the two factors: the row group fixes a_t, while the column group acts on b_t through the
sign character. In particular, each factor squares to its subgroup order times itself.
Both factors are instances of a single construction: the character sum
∑_{h ∈ H} χ(h) h of a multiplicative character over a finite subgroup,
TauCeti.subgroupCharSum. The row symmetrizer is the trivial character over the row group and
the column antisymmetrizer is the sign character over the column group, so the coefficient
formula, the two translation laws, the square, and the values on a trivial or full subgroup are
read off from that shared API instead of being proved once for each factor.
These are the elementary inputs to the essential-idempotence theorem for c_t and the
construction of Specht modules. The two extreme shapes are also evaluated here: a trivial row or
column group collapses the corresponding factor to 1, so on a shape with at most one row the
whole group fixes c_t, and on a shape with at most one column it scales c_t by the sign. The
same two degeneracies evaluate the transported symmetrizer youngSymmetrizerOver outright, as the
full symmetrization ∑_σ σ and the full antisymmetrization ∑_σ sgn(σ) σ of the group algebra.
Finally, b_t acting on an arbitrary representation is unfolded into the signed sum over the
column group, which is how every downstream computation with the operator b_t begins.
The file closes with a third signed sum at the sign character, TauCeti.antisymmetrizerOn X: the
sum ∑ sgn(σ) σ over the permutations of an arbitrary type fixing everything outside a finite set
X. It is b_t with the column group replaced by the pointwise fixing subgroup of the
complement of X, so it shares the coefficient formula, the translation law and the vanishing
criterion with b_t, and it is the element the Garnir relations of
TauCeti/RepresentationTheory/Symmetric/Specht/Garnir.lean are stated for. Nothing about it
refers to a tableau, only to the sign character TauCeti.signLinearCharacter.
The symmetrizers are built over ℚ, which is what the essential-idempotence theorem and the
Specht-module constructions downstream of this file work over. The coefficients of c_t are in
fact integral -- each is a sum of signs -- so nothing about c_t itself demands rational
coefficients; it is this definition, over ℚ, whose coefficients are transported when c_t is
made to act on a module over another ring, which is youngSymmetrizerOver. That transport goes
along algebraMap ℚ k, so it asks the target ring to be a ℚ-algebra. The restriction is one
of the present implementation, not of the mathematics: an integral c_t, over ℤ or over an
arbitrary commutative ring, would remove it, and is a separate construction.
References #
- G. D. James, The Representation Theory of the Symmetric Groups, Chapter 2.
- Schur--Weyl roadmap, Layer 2.
Classical decidability of membership in the row group, used to form its finite sum.
Equations
- t.instDecidablePredPermFinCardMemSubgroupRowSubgroup = Classical.decPred fun (x : Equiv.Perm (Fin μ.card)) => x ∈ t.rowSubgroup
Instances For
Classical decidability of membership in the column group, used to form its finite sum.
Equations
- t.decidablePredMemColSubgroup = Classical.decPred fun (x : Equiv.Perm (Fin μ.card)) => x ∈ t.colSubgroup
Instances For
The row symmetrizer a_t, the sum of the permutations preserving the rows of t.
Equations
- t.rowSymmetrizer = ∑ p : ↥t.rowSubgroup, (MonoidAlgebra.of ℚ (Equiv.Perm (Fin μ.card))) ↑p
Instances For
The column antisymmetrizer b_t, the signed sum of the permutations preserving the
columns of t.
Equations
- t.columnAntisymmetrizer = ∑ q : ↥t.colSubgroup, ↑↑(Equiv.Perm.sign ↑q) • (MonoidAlgebra.of ℚ (Equiv.Perm (Fin μ.card))) ↑q
Instances For
The Young symmetrizer of t, with the convention c_t = a_t b_t: first
row-symmetrize, then column-antisymmetrize.
Equations
Instances For
The row symmetrizer is the sum of the basis elements indexed by the row group.
The column antisymmetrizer is the sign-weighted sum of the basis elements indexed by the column group.
The Young symmetrizer uses the row-then-column convention c_t = a_t b_t.
The row symmetrizer is the character sum of the trivial character over the row group.
The column antisymmetrizer is the character sum of the sign character over the column group.
The coefficient of a permutation in the row symmetrizer is its row-group indicator.
The coefficient of a permutation in the column antisymmetrizer is its sign on the column group and zero off that group.
Left multiplication by a member of the row group fixes the row symmetrizer.
Right multiplication by a member of the row group fixes the row symmetrizer.
Left multiplication by a member of the column group scales the column antisymmetrizer by the sign of that member.
Right multiplication by a member of the column group scales the column antisymmetrizer by the sign of that member.
The row symmetrizer squares to the order of the row group times itself.
The column antisymmetrizer squares to the order of the column group times itself.
The row group fixes the Young symmetrizer on the left.
The column group acts on the Young symmetrizer on the right through its sign character.
The coefficient of the identity permutation in a Young symmetrizer is one.
The coefficient of a row-group permutation in a Young symmetrizer is one: the row group
translates c_t to itself, so all of its coefficients on the row group agree with the
coefficient at the identity.
A Young symmetrizer is nonzero.
The symmetrizers of an extreme shape #
A trivial row group leaves the row symmetrizer as the empty symmetrization, 1.
A trivial column group leaves the column antisymmetrizer as the empty antisymmetrization,
1.
With a trivial column group the Young symmetrizer is the row symmetrizer.
With a trivial row group the Young symmetrizer is the column antisymmetrizer.
On a shape with at most one row every group element fixes the Young symmetrizer.
On a shape with at most one column every group element scales the Young symmetrizer by its sign.
The column antisymmetrizer as an operator #
The column antisymmetrizer of t acts on any representation as the signed sum of the
permutations in the column group of t.
The Young symmetrizer c_t with the coefficients of its rational form transported into a
ℚ-algebra k, so that it can act on a k-module.
The ℚ-algebra hypothesis comes from youngSymmetrizer being defined over ℚ here, not from
c_t, whose coefficients are integral.
Equations
Instances For
The transport of a Young symmetrizer applies the structure map of the algebra to every coefficient.
The coefficients of the transported Young symmetrizer are the images of the rational coefficients.
The column group acts on the transported Young symmetrizer through its sign character.
This is TauCeti.mul_youngSymmetrizer_right carried into k. The sign keeps acting as a rational
scalar, which is available because k is a ℚ-algebra; it cannot be phrased as a ℤ-action,
since a CommSemiring k need not have negation.
The Young symmetrizer of a shape with at most one row is the full symmetrization
∑_σ σ: the row group is everything and the column group is trivial.
The Young symmetrizer of a shape with at most one column is the full antisymmetrization
∑_σ sgn(σ) σ: the column group is everything and the row group is trivial.
The antisymmetrizer of a set of points #
The signed sum over the permutations supported in a finite set is the character sum of the sign
character over the pointwise fixing subgroup of the complement. Nothing below refers to a
tableau, only to TauCeti.signLinearCharacter.
Classical decidability of membership in the subgroup of permutations fixing everything outside a finite set, used to form its finite sum.
Equations
- TauCeti.decidablePredMemFixingSubgroupCompl X = Classical.decPred fun (x : Equiv.Perm α) => x ∈ fixingSubgroup (Equiv.Perm α) (↑X)ᶜ
Instances For
The antisymmetrizer of a finite set X of points: the signed sum ∑ sgn(σ) σ, in the
rational group algebra of Equiv.Perm α, over the permutations σ fixing every point outside X.
For X the labels lying in one column of a Young tableau this is the factor of that tableau's
column antisymmetrizer belonging to that column; the relations it satisfies on the polytabloids of
a tableau are the Garnir relations.
Equations
- TauCeti.antisymmetrizerOn X = TauCeti.subgroupCharSum ((Units.coeHom ℚ).comp (TauCeti.signLinearCharacter ℚ α)) (fixingSubgroup (Equiv.Perm α) (↑X)ᶜ)
Instances For
The coefficient of a permutation in TauCeti.antisymmetrizerOn X is its sign if it is
supported in X, and zero otherwise.
The antisymmetrizer of a set, acting on a representation of the symmetric group, is the signed sum of the actions of the permutations fixing everything outside that set.
The decidability of the summation range is an instance argument rather than a synthesized one, so that the equation rewrites a sum however its own filter was built.
Right multiplication by a permutation supported in X scales the antisymmetrizer of X by
its sign, since the antisymmetrizer absorbs it up to that sign.
A signed sum annihilates whatever an odd permutation in it fixes. If an odd permutation
supported in X fixes v, then the antisymmetrizer of X kills v: absorbing that permutation
negates the sum while leaving v alone.