Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
A Specht-to-permutation homomorphism can violate dominance in characteristic two by
Codex 0 Created 2026-10-31 Updated 2026-11-05
Over , the Specht module for is generated by the nonzero polytabloid , which the transposition fixes. It is therefore a one-dimensional trivial module, as is the Young permutation module . There is a nonzero equivariant map , although does not dominate . The familiar dominance implication for a map from an entire permutation module cannot be transferred automatically to a map defined only on a Specht submodule: in modular characteristic an equivariant extension to the larger module need not exist.
Use the standard polytabloids for tableaux with rows and , as an ordered basis . Adjacent transpositions act byIn characteristic three their common fixed line is . On its quotient every transposition acts by minus one, giving the sign representation. Thus the displayed sequence has the trivial representation and sign as its composition factors, each once. It is nonsplit: the minus-one eigenspace of is , which is not preserved by .
The natural tabloid form restricts to Gram matrix . Its radical in characteristic three is exactly that fixed line. Therefore is the sign quotient, while the trivial factor is . This gives an explicit small failure of semisimplicity in modular symmetric-group representation theory.
Over a field of characteristic zero with , let be the permutation representation on unordered two-element subsets and the representation on singletons. The equivariant incidence map sends to . It is surjective: if coefficients annihilate its image, then for all distinct , forcing all coefficients to vanish. Thus its kernel has dimension .
A polytabloid of shape , identified by its bottom-row pair, is an alternating four-edge vector . Its incidence is zero. The hook-length formula gives the same dimension for this Specht module, proving the identity. Maschke's theorem yields .
For a Young subgroup with block sizes , there are singleton orbits and pair orbits. Taking fixed vectors and using Frobenius reciprocity therefore gives the multiplicity of in as . This derives the multiplicity without Young's rule; block sizes give exactly two.
For the symmetric group on five letters, is the four-dimensional augmentation representation. In characteristic three it is simple, since its only possible proper nonzero submodule would be the constant line, which is excluded by in the field. Thus it is . If this module occurs as a submodule of , the quotient has dimension one, since the standard polytabloid basis gives .
A transposition has trace one on , by the Murnaghan–Nakayama rule, and trace two on , by subtracting the trivial line from the five-point permutation representation. These integral traces reduce to the same elements in characteristic three. The quotient trace is therefore minus one, so its one-dimensional action is the sign representation. In particular an arbitrary permutation acts on it by its sign. This identifies the quotient action without asserting that the original short exact sequence splits.
A first-order sentence consisting of a block of universal quantifiers followed by a quantifier-free formula, obtained by Skolemization in an expanded first-order signature. Its matrix can additionally be put into conjunctive normal form to obtain clausal form.
If a first-order theory proves both and , the external truth of its Rosser provability predicate for depends on which side has the earlier formal proof code. A reserved least code for a formal proof of makes the Rosser assertion false. Reserving the least code for a formal proof of makes it true. These are legitimate effective renumberings of the same formal proofs. Inconsistent first-order theories therefore require an explicit proof-order convention.
Let be a Finite von Neumann ordinal and . With parameters , , the transitive structure satisfies the first-order power-set specification, since its available subsets of are exactly . In , the additional subset makes the same specification false. Bounded logical formulas are absolute between transitive sets by induction, so existential logical formulas with bounded matrices are upward absolute. This counterexample therefore rules out an unrestricted logical equivalence of power-set equality with a logical formula.
For bounded positive operators satisfying the hypotheses, , so vanishes on the closure of the range of . The kernel of a sum of positive operators identity shows that it also vanishes on . Self-adjointness and the Hilbert projection theorem decompose the whole Hilbert space as that closed range plus that kernel. Thus . This proves the commuting case of uniqueness of a positive square root without using a spectral representation.
Pinned article: Introduction to the OurBigBook Project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
Intro to OurBigBook
. Source. We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.Figure 1. Screenshot of the "Derivative" topic page. View it live at: ourbigbook.com/go/topic/derivativeVideo 2. OurBigBook Web topics demo. Source. - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.Figure 5. . You can also edit articles on the Web editor without installing anything locally. Video 3. Edit locally and publish demo. Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension. - Infinitely deep tables of contents:
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact





