Section normal form for a split group extension Created 2026-10-06 Updated 2026-11-05
If a group homomorphism section satisfies , then each has a unique form with and : take and . Thus is a bijection. It is a homomorphism for the ordinary direct product of groups exactly when the section image centralizes . In general it describes a semidirect product with a nontrivial conjugation action.
Self-map 2026-10-14
A self-map is a function whose domain of a function and codomain are the same set. It need not be a bijection: a constant function on a two-element set is a self-map that merges its inputs. Self-maps can always be composed with one another, and all self-maps of a specified set form its full transformation monoid.
Set theory Created 2026-09-24 Updated 2026-10-18
Set theory studies sets, their set elements, and the constructions and sizes possible for them. It supplies a shared vocabulary for mathematics: a function connects two sets, a binary relation specifies which pairs of objects are related, and a probability space starts with a set of possible outcomes. Giving these objects a common language lets a construction from one subject be used in another without repeating its underlying bookkeeping.
A particularly beautiful question is how to compare sizes without first assigning a number. Two sets have the same cardinality when a bijection pairs every member of one with exactly one member of the other. For finite sets, this agrees with ordinary counting. For infinite sets, it produces surprises: bijects the natural numbers with the nonnegative even integers, and the Cantor pairing function bijects the Cartesian product with . A proper subset can have the same cardinality as its containing set.
This does not make all infinite sets equally large. Cantor's diagonal argument shows that all infinite binary sequences cannot be listed by the natural numbers. Cantor's theorem gives the wider principle: the power set of any set has strictly greater cardinality. The contrast between an explicit enumeration and an impossibility argument makes the meaning of infinity much sharper than a picture of something merely continuing forever.
Set formation itself requires care. Russell's paradox shows why not every condition defines a set of all objects satisfying it. Zermelo–Fraenkel set theory instead uses axioms specifying permitted constructions, including set comprehension within a previously given set. The restrictions are useful: they let us form the collections ordinary arguments need while blocking the unrestricted construction that produces the paradox.
Shifted addition on odd integers 2026-10-18
The odd integers form an abelian group under the displayed operation. The identity element is and the inverse element of is . The bijection is a group isomorphism to , since it converts the shifted operation into addition. This illustrates how an unfamiliar identity and inverse can arise from ordinary addition by a change of coordinates.
Sign homomorphism Created 2026-09-24 Updated 2026-11-05
The sign homomorphism sends an even permutation to and an odd permutation to ; its kernel is the alternating group.
A symmetric group is the group of all bijections from a set to itself, with function composition as its operation.
Simplicial homeomorphism 2026-10-25
A simplicial homeomorphism is the homeomorphism of geometric realizations induced by an isomorphism of simplicial complexes: a bijection of their vertex sets such that a finite vertex set is a simplex exactly when its image is a simplex. The map acts linearly in each barycentric coordinate system. It and its inverse are continuous by the realization topology. Between the boundaries of two triangles, any bijection of the three vertices extends linearly on edges to a simplicial homeomorphism. This ensures that the edge identifications agree at common endpoints.
Simply transitive group action 2026-10-14
A group action on a nonempty set is simply transitive when exactly one group element sends any chosen point to any other:Equivalently it is both a transitive group action and a free group action; this is also a regular group action. Transitivity supplies a transport, and freeness makes it unique. Conversely, putting in the uniqueness condition shows that every stabilizer subgroup is , since the identity element already fixes . In a transitive group action, checking that just one stabilizer subgroup is trivial suffices: all the others are conjugate subgroups.
The cyclic group in the diagram under transitive group action is simply transitive. More generally, the left regular action of any group on itself is simply transitive: the equation has the unique solution , using the inverse element of . This shows why the property is useful: every position has a unique label relative to a chosen starting position.
Choose a point . Its orbit mapis a bijection and an equivariant map from the left regular action: . This identifies with a copy of , but does not come with a preferred identity element. If , then : changing the chosen point composes this identification with right multiplication by . An old label therefore becomes the new label , which also specifies the side of multiplication for a noncommutative group.
The transport from to remains independent of the chosen point. Writing and , it is . With , the new labels are and , andFor a finite group, simple transitivity implies . Conversely, a transitive group action with is simply transitive by the orbit-stabilizer theorem. Equality of cardinalities alone is insufficient without transitivity: the cyclic group can fix both points of a two-point set, giving two group orbits and two possible self-transports at each point.
Skolem's paradox 2026-10-31
A countable model of set theory can internally assert that an uncountable set exists. There is no contradiction because “there is a bijection” ranges only over functions in the model. An external enumeration of its domain need not itself be an element of that domain. Löwenheim-Skolem theorem controls external cardinality; Cantor's theorem remains valid for the sets and functions that the model contains.
Take , the nonnegative integers, and , the positive integers. Choose the injectionsHere is an inclusion map, while reaches only the positive even integers. In particular, is not a bijection: it misses every positive odd integer. Simply using the inverse function of on its image misses input zero.
The remedy is to follow the alternating injections starting at the missing input zero:The subscripts distinguish an input in from an output in , even when their numerical values agree. The resulting subset of is . Its sequence of members satisfies and , giving by mathematical induction. Define the function
The image covers all the positive members of exactly once. The other inputs cover exactly once by staying fixed. These output sets are disjoint and their union is , proving that is a bijection. In particular, , , , while and .
For completeness, its inverse function isThe familiar bijection also works, but this example shows something more specific: the two chosen injections can repair the missing zero by moving only a sparse sequence of inputs. The repair never has to shift the entire set.
Standard Young tableau Created 2026-10-05 Updated 2026-10-14
A standard Young tableau of shape is a Young tableau that uses exactly once and strictly increases left to right along every row and top to bottom down every column. Formally, a bijection is standard whenwhenever the indicated cells belong to the Young diagram. We write for the set of such fillings and for its cardinality.
For , the five standard Young tableaux are listed below, with each pair giving the top row followed by the bottom row:There are no others: the upper-left entry must be , and choosing the two bottom-row entries fixes both increasing row orders. Of the six choices of two entries from , only bottom row fails, because its would lie below . Hence by direct enumeration, independently of the hook-length formula.
The cells occupied by form a Young diagram: every cell above or to the left of an occupied cell has a smaller label. Consequently a standard Young tableau is equivalently a path from the empty shape to in the Young branching graph, adjoining one addable node of a Young diagram at each step. For , the successive shapes areConversely, number the cell added at step by to recover the standard Young tableau. This path interpretation also makes a standard Young tableau a linear extension of a partially ordered set defined by the row and column requirements; see Stanley's Algebraic Combinatorics, Chapter 8, on tableaux and paths in Young's lattice.
The usefulness goes beyond counting: the standard polytabloid basis of a Specht module over the complex numbers is indexed by , so . Each of the five pictured standard Young tableaux therefore labels one basis element of the irreducible representation of the symmetric group , whose dimension over the complex numbers is five. The filled diagrams index the basis; the actual vectors are polytabloids. The hook-length formula computes this dimension without listing all the standard Young tableaux.
Stars and bars (combinatorics) 2026-10-13
Stars and bars counts tuples of nonnegative integers with a prescribed sum. For integers and , its statement isSuch a tuple is a weak composition of an integer. Think of labelled bins: counts identical objects in the first bin, in the second, and so on. Bin names distinguish positions even when counts agree. Stars and bars counts these count tuples; assigning individually distinct objects requires additional information. [ref]
https://math.mit.edu/~fgotti/docs/Courses/C.%20Combinatorial%20Analysis/6.%20Compositions/Compositions.pdf. Felix Gotti, MIT 18.211, Lecture 6: Compositions, Proposition 1 and Example 3
Computed example. With and , the number of weak compositions of an integer is . The string
••|•|•• encodes : two dots before the first bar, one between the bars, and two after the second. For a fixed first-bin count , the second-bin count can be any integer from to and the third is forced. Thus the direct count is .Stars and bars for five identical objects and three labelled bins: ordinary splits, adjacent bars, and bars at either end
. Details. Adjacent bars encode an empty middle bin:
••||••• gives . A bar at the left end encodes an empty first bin, as in |••|••• for ; a bar at the right end encodes an empty third bin, as in ••|•••| for . These are valid weak compositions of an integer. For every count is zero, and for the unique tuple is , consistent with .Proof outline. Replace each count by that many dots and separate successive groups with bars. Reading the group sizes reverses this construction, so it is a bijection between weak compositions of an integer and strings of dots and bars. Choose the bar positions among positions; the binomial coefficient counts the choices. The beauty is that empty bins need no separate cases: end bars and adjacent bars encode them automatically.
If every bin must be nonempty, the tuples are compositions of an integer, and their count is for ; for there are none. Subtract one from every count, setting . This is a bijection to weak compositions of an integer of , so stars and bars gives . For five objects and three bins, this is , with the six positive tuplesFor instance, shifts to , whose sum is . Sorting the six positive tuples collapses them to just two integer partitions, and . Thus named bins and unordered summands answer different questions.
Stars and bars is useful for allocating identical resources or enumerating integer solutions without listing them individually. Prescribed lower bounds can be subtracted just like the nonempty-bin requirement. Upper bounds require removing forbidden tuples; the existing bounded weak compositions article applies the inclusion-exclusion principle to those violations.
Stereographic projection Created 2026-09-24 Updated 2026-10-18
Stereographic projection identifies a sphere minus one pole with the plane and supplies the standard charts of the Riemann sphere.
In the equatorial-plane convention of the Riemann sphere, draw the straight line through and a point on the unit sphere. Its intersection with the plane has complex coordinateThe inverse function, for and , isHere positive gives positive , and positive gives positive . Thus and lie on the positive and ends of the equator. The omitted north pole is assigned .[ref]
Topic 2 Notes. Complex Variables with Applications, MIT 18.04, Spring 2018; Topic 2 Notes, section 2.5.2, printed p. 7, projection formula and north pole
North-pole projection onto the equatorial plane: two real points and the positive complex-axis convention
. Details. For original worked points, the real numbers and lift to points with the same coordinate but opposite coordinates:Projecting back gives and . A point off the real axis checks the other sign:The coordinates satisfy , as a point on the unit sphere must. Also , and .
A short derivation starts with the line . Setting its last coordinate to zero gives , hence the projection formula. Conversely the line from to is . Substitution in the unit sphere equation givesThe root is ; the other root gives . These line intersections establish both the formula and its bijection property without guessing the inverse.
The same algebra explains how large planar distances become small spherical ones:Consequently brings to independently of direction. The last expression is twice the chordal metric distance . A whole unbounded exterior in the complex plane therefore becomes a small cap on the unit sphere.
Stirling numbers of the second kind 2026-10-14
For nonnegative integers , the Stirling number of the second kindcounts the set partitions of an -element finite set into exactly unlabelled blocks of a set partition. Set , for , and for . Also for . Grassl and Levin develop these counts through explicit set partitions and a recurrence relation. [ref]
https://discrete.openmathbooks.org/more/mdm/sec_adv-partitions.html. Grassl and Levin, More Discrete Mathematics via Graph Theory, section 3.1: counting partitions
Insert one distinguished element. For and , the Stirling numbers of the second kind obeyProof outline. Inspect the block of a set partition containing . If it contains another element, removing leaves a set partition into blocks of a set partition; conversely, insert into any of those blocks of a set partition. If is alone, remove its singleton set and obtain a set partition into blocks of a set partition. The cases cannot overlap, and deletion reverses each construction. This explains the factor even though the blocks of a set partition have no names. [ref]
https://discrete.openmathbooks.org/more/mdm/sec_adv-stirling.html. Grassl and Levin, More Discrete Mathematics via Graph Theory, section 3.4: Stirling recurrence
For , start with the three two-block set partitions of . Inserting into either block of a set partition gives six possibilities. The remaining possibility is , obtained by making a singleton set. Hence . The seven set partitions in the diagram comprise four with sizes and three with sizes ; this grouping by sizes independently gives .
Exact construction of all seven two-block set partitions of : six insert into an existing block of a set partition, and one creates a singleton set
. Details. Three different counting questions. The binomial coefficient selects one -element subset. The Stirling number of the second kind groups all distinct elements into nonempty unnamed blocks of a set partition. The power counts all functions to a specified -element finite set, allowing some destination labels to go unused. At , these counts are respectively , , and . Choosing two people, making two unnamed nonempty teams, and assigning each person a red or blue label are different tasks.
When the destinations have labels. For fixed finite sets of sizes , respectively, the number of surjective functions isHere every element of must be used. Each surjective function gives a set partition of into its nonempty preimages . Conversely, assign the distinct destination labels to the blocks of a set partition in ways, where is a factorial. For two labelled teams of four people this gives : of the assignments, exactly two use only one label. Dividing arbitrary function counts by fails in general because unused labels can be permuted without changing a function. For example, cannot count set partitions. The empty-to-empty function is a surjection, consistent with . Stanley gives the bijection underlying this qualification.[ref]
For example, the inclusion-exclusion principle counts the surjections from four elements to three labelled destinations as . Thus . An independent check chooses the only two-element block of a set partition in ways; the other two elements form singleton sets.
Why these numbers also occur in algebra. Classifying all functions to an -element finite set by the size of their image givesFor a fixed set partition, the falling factorial counts assignments of distinct labels to its blocks of a set partition, and is zero when . At , this reads . Replacing by yields a polynomial identity: both sides agree at every nonnegative integer. Thus the Stirling numbers of the second kind translate powers into falling factorials. Grouping by equal values turns a counting rule into an algebraic change of coordinates. Summing without destination labels instead gives the Bell number.
Subgroup correspondence for a surjective group homomorphism Created 2026-10-14 Updated 2026-11-05
For a surjection with kernel , inverse image and image give inverse order-preserving bijections between subgroups of and subgroups of containing . They preserve index. For an arbitrary subgroup , , so .
// Target: algebra.bigb
Subgroup correspondence theorem Created 2026-10-31 Updated 2026-11-05
For a normal subgroup of , projection to the quotient group gives a bijection between subgroups of containing and subgroups of . The maps are and inverse image under projection. Their two composites are identities because each relevant subgroup is a union of cosets of . They preserve inclusions and normality; consequently a composition series in a quotient lifts to a subnormal chain above with the same composition factors.
Sum of reduced residues 2026-10-14
The map is a bijection of the integers between one and that are coprime to . If their sum is , this bijection gives , so . This works even at , where the single residue is fixed. The same identity follows from the weighted inclusion-exclusion principle by excluding multiples of the prime factors of .
Surjective function Created 2026-09-24 Updated 2026-11-05
A function is surjective when every element of its codomain occurs as a value: for each there is an with . Equivalently, its image is all of .
For example, is surjective as a function , but not as a function , since negative values are missed. A surjective function may identify different inputs. Together with injectivity, surjectivity gives a bijection and hence an inverse function.
Symmetric group Created 2026-09-24 Updated 2026-11-05
The symmetric group is the group of all bijections of an -element set, with multiplication given by function composition. There are such permutations, since one chooses the images successively in ways.
For , composition is not commutative: but the reversed product is , applying the rightmost permutation first. Every permutation decomposes into disjoint cycles and into transpositions. By Cayley's theorem, every finite group embeds in some symmetric group, so permutation actions provide a universal concrete model of finite group operations.
Symmetry group Created 2026-10-14 Updated 2026-10-14
A symmetry group collects bijections of an object to itself that preserve a specified structure in both directions, with function composition as the operation. For a geometric object one may require Euclidean distances to be preserved, giving an isometry group; for a graph, one preserves adjacency, giving a graph automorphism group. For an unstructured finite set, every permutation is allowed. The structure to be preserved is part of the definition.
For a square with its usual geometric structure, the symmetry group consists of four rotations and four reflections. These form the dihedral group of group order eight. The existing group action example shows how its eight elements move the vertices of a polygon; changing the object to its edges or a marked configuration changes the group action being studied.[ref]
Specifying the preserved data makes it possible to test a proposed symmetry exactly. After the preserved data are declared, function composition, the identity map, and inverse maps automatically preserve them too. Symmetry transformations therefore form a group, and questions about equivalent configurations become questions about group orbits, stabilizer subgroups, and group homomorphisms. This supplies reusable mathematics for comparing many different kinds of objects.
Symmetry transformation 2026-10-14
A symmetry transformation is a bijection preserving the data that define the object's symmetry group. Its individual group elements are symmetry transformations; the group operation combines them by function composition.




