The category of elements has objects for , and morphisms with . Send to the representable presheaf , and a morphism to . The element supplies a natural transformation with component , by the Yoneda lemma. These transformations form a cocone.
Pointwise at , the colimit of this diagram in a category has representatives , with relation . These are exactly the relations of the preceding categorical coend. Its proved natural isomorphism with therefore identifies the cocone with the universal colimit cocone. More directly, every representative equals through the morphism ; two representatives with the same image therefore agree. As is small, is small, so this is an ordinary small colimit. Consequently
Working with a small category (or in a fixed ambient universe), for a categorical presheaf and fixed , apply the categorical coend construction to . It is the quotient of the disjoint union of pairs by the relations
Define . It respects every relation because . Define . Then . Conversely the relation with gives , so is the identity morphism. Therefore
For , restriction on the categorical coend sends to , and . A natural transformation likewise acts on the second coordinate and commutes with . Thus the density formula for presheaves is a natural isomorphism, not just a family of unrelated bijections.
Let . A categorical end is an object with morphisms satisfying, for every ,
It is universal among such families: any satisfying the same equations is uniquely for one . This is a universal dinatural transformation from the constant value , and is written .
Dually a categorical coend is with morphisms satisfying
Any family satisfying these equations is uniquely for one . Write . For small , the categorical end can be constructed as the equalizer of when these objects exist. The categorical coend is the coequalizer of when those objects exist. The two morphisms impose exactly the displayed equations for a dinatural transformation.
A precise commutation of iterated categorical limits statement is the following. For small categories and , if every column categorical limit and the resulting -limit exist, then
If every row categorical limit and the resulting -limit also exist, then
Each isomorphism is the unique one identifying all projections to . Indeed, the preceding part proves that each iterated categorical limit has the universal property of the whole product diagram in a category. Its uniqueness gives the canonical isomorphism. Equivalently, categorical cones with vertex over the product diagram in a category are exactly compatible families, indexed by , of categorical cones over ; regrouping the same compatibility equations cannot change their representing object. In a complete category all the stated existence hypotheses hold for small . The theorem is about categorical limits with categorical limits, and makes no unconditional claim about commuting a categorical limit with a colimit.
Let be a categorical limit of , with projections . Set . The equations for the categorical cones and , and the defining equations for , show that this family is a categorical cone over .
For any categorical cone , fix . Its -legs give a unique . For , both and have composite with every , so they are equal. Thus the form a categorical cone over , which factors uniquely through . The equalities follow. Any other such has the same composites with every , because the projections detect equality; uniqueness for then makes it equal to . Therefore is a categorical limit of the whole product diagram in a category.
Choose for each a categorical limit of , with projections . For , the morphisms form a categorical cone over , since the two actions of the product functor commute. Define by the equations
Existence and uniqueness follow from the universal property. The identity morphism of satisfies the equations for , and satisfies those for , so uniqueness gives and . Hence is a functor.
If with projections are other choices, there is a unique isomorphism carrying every projection to the corresponding projection. The same equations show , because their composites with all agree. Thus the choices give a unique natural isomorphism compatible with the chosen categorical limit categorical cones. Without the compatibility condition, uniqueness of an arbitrary natural isomorphism is not asserted.
For , define the functor by
where is the constant diagram functor; a morphism into acts by precomposition on every categorical cone leg. A categorical limit is a representation of a functor of the form
The image of is the universal categorical cone . By naturality of the representing isomorphism, the image of is . Thus this definition is exactly existence and uniqueness of factorization of every categorical cone through . Conversely that universal property gives the representing natural bijection.
Let be a terminal object. The pullback in a category of has precisely the universal property of the binary product in a category : every pair of morphisms to is compatible over . Repeated binary products in a category, together with as the empty product, give all finite products in a category.
For , form the pullback in a category of the categorical diagonal along . Its projection satisfies . If satisfies , the pair gives a unique morphism into this pullback in a category. Conversely any such morphism must project to that pair. Hence is the equalizer of . The preceding construction now gives all finite limits.
For a functor with finite indexing category, form the finite products in a category
Define by requiring the coordinate indexed by to be for and for . Let be their equalizer, and put . The equality says exactly that for every morphism , so these morphisms form a categorical cone.
For any other categorical cone , the product in a category gives a unique with . The categorical cone equations give , so the equalizer gives a unique with . This is exactly the universal property of a categorical limit. Empty indexing products are terminal objects, so the construction includes the empty diagram in a category. Thus finite products and equalizers give all finite limits.
Here is a precise base change of a pullback square statement. Suppose is a pullback in a category and is a morphism. Assume the pullbacks in a category
exist, where is the common composite. The induced square with vertices is a pullback in a category; equivalently,
Indeed, compatible morphisms and give morphisms , , and a common , with the composites of to both equal to . The original pullback in a category gives a unique morphism with projections . Its composite to is , so the defining pullback in a category for gives a unique morphism above . Its maps to and are the prescribed ones by uniqueness in those pullbacks in a category. Conversely, these projections recover , so every possible factorization is the same. This proves the universal property without requiring arbitrary categorical limits in the ambient category.
Keep the notation of the preceding part. For and satisfying , we have . The outside pullback in a category gives a unique with and . Moreover . The morphisms thus have the same composites with and . Uniqueness in the right pullback in a category gives . Any factorization through the left square also factors through the outside rectangle, so it is unique there. The left square is a pullback. Together these two arguments prove the pullback pasting lemma.
Name the upper objects and the lower objects , so the morphisms are , , , , , , and . The commutative diagram gives and .
Take and with . The right pullback in a category gives a unique with and . The left pullback in a category then gives a unique with and . It follows that , giving the required factorization through the outside rectangle. Any other factorization has the same middle morphism by uniqueness in the right pullback in a category, and therefore is the same by uniqueness in the left pullback in a category. The outside rectangle is a pullback.
We first justify the relevant pointwise epimorphism in a functor category criterion. A componentwise surjective function gives an epimorphism, because equality of two composites can be cancelled at each component. Conversely, for a natural transformation , form the pointwise pushout . Restrictions of preserve the identifications imposed by , so these pointwise sets and restrictions form a categorical presheaf. The two inclusions satisfy . If is epic, . At an object , an element outside the image of would retain two distinct copies in , contradicting this equality. Thus every is surjective.
Apply this criterion to at . Surjectivity of supplies with . Conversely, if , then , making a split epimorphism and hence an epimorphism. Therefore
If is a monomorphism, each function given by postcomposition with is injective. Consequently, if two natural transformations into become equal after , their components are equal, and the transformations themselves are equal. This proves that is a monomorphism in the presheaf category.
Conversely, suppose is a monomorphism and satisfy . Then . Cancellation gives , and faithfulness of the Yoneda embedding gives . Hence is monic exactly when is monic.
Define the Yoneda embedding by and . For , define . Associativity proves naturality in , and preservation of identity morphisms and composition in a category proves that is a functor.
Apply the Yoneda lemma to . It gives
The natural transformation corresponding to has component , exactly . Therefore the induced map on every hom-set is a bijection: the Yoneda embedding is full and faithful.
For a categorical presheaf and , the Yoneda lemma gives a natural bijection
To construct its inverse, take and set for . For , the functor law gives , so is a natural transformation. Conversely, naturality of any at gives . Thus the two constructions are inverse, proving the bijection.
The bijection is natural in : a natural transformation sends the distinguished element to on either side. It is natural in : for , precomposing a transformation with postcomposition by sends its distinguished element to . These equations prove the claimed naturality, rather than just an objectwise correspondence. Reversing morphisms gives the covariant form for .
Frobenius reciprocity is the adjointness of character induction and restriction: for class functions on and on ,
For characters this says that the multiplicity of an irreducible -character in an induced character equals the corresponding multiplicity after restriction. To prove the identity directly, insert the induced class function formula and interchange the two finite sums. For each , substitute with . Since is constant on conjugacy classes,
This proves the theorem for all class functions, not just irreducible characters.
For the group-theoretic conclusion, suppose that divides . A central element of order lies in every Sylow p-subgroup: adjoining it to a Sylow subgroup gives a p-subgroup, so maximality forces it into that subgroup. Hence there is a subgroup of order . Choose a nontrivial linear character of .
Since is abelian, extends to a linear character of . One direct justification is to extend from an abelian subgroup to one generator at a time: if is the least positive exponent with , choose a complex th root of as the value at . The formula on is then well defined and multiplicative. Iteration yields the claimed extension to .
The induced character has degree , which is prime to . In its decomposition into irreducible characters, at least one constituent must have degree prime to ; otherwise the total degree would be divisible by . Frobenius reciprocity also gives for this constituent. Restriction to the central subgroup forces
Indeed, the induced representation itself restricts to as copies of , because conjugation by every coset representative is trivial on ; alternatively this follows from Schur's lemma and the positive multiplicity after restriction.
Each consequently acts in the representation affording as the scalar . Taking its determinant character gives
The left side is trivial since and every linear character kills . The right side is nontrivial since has order and . This contradiction proves
The argument is the central commutator has no torsion from an abelian Sylow subgroup determinant obstruction.
Let afford the given group representation of . Its induced representation is the left -module
Choose representatives of the left cosets ; then it is the direct sum of the spaces . If with , the action sends to . This is independent of the representatives up to equivalence, and its dimension is .
Only cosets fixed by contribute to its trace. Their contribution is , giving the induced character formula
For an arbitrary class function on , the same averaging formula defines its induced class function on . Equivalently, extend by zero outside and average . This definition is linear and does not require to be an actual character.
For a complex character of a finite group afforded by a representation , its determinant character is
Multiplicativity of the determinant makes this a linear character; it does not mean the determinant of the scalar value . The definition depends only on the character because characters determine the equivalence class of a finite-dimensional complex representation. In particular the determinant character is trivial on the derived subgroup .
Let be the intersection under consideration. The family is nonempty since it contains , and is invariant under conjugation: conjugating an irreducible inducing pair gives another such pair. Hence is a normal subgroup of .
For any , monomiality gives with a linear character of some . This belongs to the family, so . Because is normal, for every . In the induced representation on
each coset line is therefore invariant under : for ,
Thus the restriction to is a direct sum of one-dimensional group representations. All representing matrices of commute, and the derived subgroup acts as the identity. Equivalently,
The intersection of the character kernels is trivial: the regular representation is faithful and is a direct sum of irreducible representations. It follows that .
This proves the abelian intersection of irreducible inducing subgroups without assuming that every subgroup of an M-group is itself monomial.
A finite monomial group, also called an M-group, is a finite group for which every irreducible character is a monomial character: for every there are a subgroup and a linear character of such that . The inducing subgroup and linear character may depend on .
Taketa's theorem states that every finite monomial group is solvable. Here being a solvable group means that the iterated derived subgroups eventually reach the identity.
Dade's embedding theorem for monomial groups states that every finite solvable group embeds as a subgroup of a finite monomial group. It does not say that every solvable group is itself monomial, nor that the embedding can always be taken normal. Together the results identify solvability as a necessary property of monomial groups without making monomiality closed under taking arbitrary subgroups.

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!
We have two killer features:
  1. 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-calculus
    Articles 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/derivative
  2. 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.
    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.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
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