Saturation of a subset Created 2026-10-25 Updated 2026-10-31
For the canonical projection of a quotient set , the saturation of is the union of all equivalence classes meeting , namely . A subset is called saturated when it equals its saturation. The quotient topology says that is closed exactly when the saturation of is closed, and similarly for openness. A closed set need not have closed saturation: collapsing to one point makes the saturation of equal to . Hence a quotient map need not be a closed map.
Second group cohomology classifies group extensions Created 2026-09-24 Updated 2026-11-05
Equivalence classes of group extensions of by an abelian -module correspond to . A section produces the extension cocycle
and changing the section changes by a group coboundary.
Fix an -bimodule . A unital ground-ring-linear split extension with square-zero kernel can be identified with , with multiplication . Associativity is exactly . Changing a unital linear section by changes by . Thus equivalence classes of these split extensions are . Over a field every such vector-space extension splits; over a general ground ring a splitting hypothesis is essential for this ordinary cochain classification.
For a co-computably enumerable equivalence relation, the least element of each equivalence class forms a complete transversal of a set family. Membership is semidecidable: run the finitely many inequivalence tests against smaller numbers in parallel and accept when all succeed. Infinitely many classes are needed only to make the resulting transversal infinite.
Set partition Created 2026-09-24 Updated 2026-10-13
A set partition of a finite set is a set of nonempty subsets, called blocks of a set partition, with
Thus every set element of belongs to exactly one block of a set partition. This is the finite counting version of a partition of a set. The blocks of a set partition are unlabelled: their subscripts help describe them, but give them no roles or order. Stanley uses this definition in his classification of counting problems.[ref]
All possibilities for three elements. The set has exactly five set partitions:
For two blocks of a set partition, one must have size two and the other size one; the three choices of the lone element give the middle row. One block of a set partition forces the whole set, and three blocks of a set partition force three singleton sets. This proves the enumeration complete, with counts by number of blocks of a set partition. Their sum is the Bell number .
Figure 1.
Exact enumeration of the five set partitions of : outlines show blocks of a set partition, whose positions and colours carry no labels
. Details.
What information is kept? Exchanging the two blocks of a set partition in leaves the same set partition; writing the tuple instead makes an ordered list, different from . Exchanging elements within a block of a set partition also changes nothing. In contrast, is a different set partition, because the actual memberships differ. Both have the same integer partition of sizes. An integer partition, or its Ferrers diagram, forgets which distinct objects were grouped together.
For four named people, and therefore describe different ways of making two unnamed teams, although both have sizes . If every team must have exactly two people, only three set partitions qualify; if any nonempty team sizes are permitted, the Stirling number of the second kind counts them. Naming the teams changes the counting problem again.
A set partition is useful whenever membership matters but category names do not. Define when and belong to the same block of a set partition. This is an equivalence relation, and its equivalence classes recover the set partition. Conversely, an equivalence relation supplies its set partition of equivalence classes. The beautiful simplification is that one grouping can be described by whole subsets or by a rule comparing two elements. Additional distinctions are organized by refinement of a set partition.
The empty set has one set partition, the empty collection , with zero blocks of a set partition. This differs from , which is forbidden because its proposed block of a set partition is empty.
Suppose a finite simple polygon in the curvature-minus-one hyperbolic plane has hyperbolic geodesic sides paired to produce a closed topological surface. Its metric descends to a smooth hyperbolic metric exactly when paired polygon sides have equal lengths and the sum of internal angles in each vertex equivalence class is . Equal lengths allow isometric gluing at open edges; at vertices the sectors assemble into a hyperbolic disc precisely when their total angle is . Other positive total angles produce a cone singularity of a surface metric. The area of a hyperbolic geodesic polygon and the Gauss-Bonnet theorem then give area for the closed surface.
Collapse the equator of a sphere to a single equivalence class and leave every other point in its own class. The two closed hemispheres are disks sharing that equator. A disk with its boundary collapsed is a sphere, so the two hemisphere quotients are spheres sharing just one point: their wedge sum. An explicit map sends height and longitude on the upper hemisphere to , and sends the lower hemisphere to the sphere centred at by reversing the first coordinate. The equator goes to the common origin and the poles go to . This map is continuous and has precisely the collapsed equator as its only nonsingleton fibre. Its induced map is a homeomorphism by the compact-to-Hausdorff continuous bijection theorem.
Tabloid Created 2026-09-28 Updated 2026-11-05
A tabloid is an equivalence class of tableaux under permutations within rows. The tabloids of shape form a transitive -set.
Consider an original abstract data type whose values are rational numbers. Store an ordered pair of integers, interpreted as a numerator and a denominator. Use exact, unbounded integer arithmetic in this model. The storage space, representation invariant and abstraction function are
The representation invariant does not require a positive denominator or a reduced fraction. Consequently , and are three different concrete states with the same abstract rational number . Similarly, and both represent zero. The abstraction function is a surjection: every rational number has an integer numerator and a nonzero integer denominator, so every abstract value has a representation.
Figure 1.
Several valid integer pairs represent one rational value; zero denominators have no abstract value
. Details.
Both and violate the representation invariant; neither has a value under this abstraction function. By contrast, is completely valid. Simplifying it to the reduced fraction may be a useful implementation choice, but is not a requirement of this representation. Strengthening the representation invariant to require a positive denominator and a greatest common divisor of one would choose a unique stored representative for each rational number; every constructor and operation would then need to establish that stronger condition.
Equality of abstract values is therefore different from equality of stored ordered pairs. For valid and ,
This defines an equivalence relation on : each equivalence class contains all representations of one rational number. An API equality operation can compare these cross-products using exact integer arithmetic. Comparing the two fields individually would incorrectly declare and unequal as rational numbers. The general reason is that an abstraction function may map several concrete values to one abstract value.[ref]
Vertex link in a polygonal schema Created 2026-10-25 Updated 2026-10-31
Witt group of a field Created 2026-10-14 Updated 2026-11-05
For a field of characteristic different from two, the Witt group classifies nondegenerate symmetric bilinear forms after hyperbolic parts are discarded. Two forms represent the same class if adding suitable hyperbolic planes of a quadratic form makes them isometric. The group operation is orthogonal direct sum.
A metabolic bilinear form has a totally isotropic subspace of half its dimension. In this characteristic it is a sum of hyperbolic planes of a quadratic form and represents zero. The inverse element of the equivalence class of is represented by : in , the vectors form such a half-dimensional totally isotropic subspace.
Over the real numbers, Sylvester's law of inertia reduces a nonsingular form to positive squares and negative squares. A positive-negative pair is a hyperbolic plane of a quadratic form, so cancelling pairs leaves exactly the signature . Conversely, equal signatures leave the same remainder. Thus
under the signature. This records how much definite form remains after all positive-negative cancellation.[ref]
Over the complex numbers, every nonzero diagonal coefficient can be rescaled to one, since it has a square root. Two unit squares already form a hyperbolic plane of a quadratic form, using the independent isotropic vectors and . Pairs therefore cancel, and only the parity of the dimension remains:
Odd dimension cannot disappear, because adjoining a hyperbolic plane of a quadratic form changes dimension by two. These are symmetric bilinear forms over the complex numbers, rather than Hermitian forms; confusing the two would give a different classification.[ref]
Zeroth law of thermodynamics Created 2026-10-14 Updated 2026-10-20
If two thermodynamic systems are each in thermal equilibrium with the same third system in the same equilibrium state, they are in thermal equilibrium with each other. Write for this relation. The zeroth law of thermodynamics supplies transitivity:
Its symmetric relation property and self-equilibrium (reflexivity), together with transitivity, make thermal equilibrium an equivalence relation. Its equivalence classes can be labelled by a common empirical temperature; choosing an absolute numerical scale requires the further structure of thermodynamic temperature.[ref]
The comparison assumes internally equilibrated macroscopic bodies, unchanged composition and mechanical constraints, and contact permitting only heat exchange. Use rigid, impermeable diathermal walls so that neither matter transfer nor boundary work spoils the test. The same state of matters: letting warm while measuring , then cool while measuring , does not supply the premise. Ordinary nonrelativistic laboratory thermodynamics is assumed; the Tolman temperature law treats gravitational qualifications. Equal temperatures establish the thermal condition, without requiring mechanical equilibrium or chemical equilibrium.
Figure 1.
Thermal equilibrium is transitive; an adiabatic wall supplies no equality test
. The top row compares and separately with the same equilibrium state of reference . The lower left shows the predicted absence of net heat transfer when and are put in thermal contact. The lower right is a counterexample to inferring equality from insulation: a rigid adiabatic wall can separate bodies at different temperatures. All numerical labels are illustrative. Details.
This explains why a thermometer can compare unlike materials: it supplies a reusable third system. A temperature is a property of an equilibrium state, while heat is energy transferred because of a temperature difference. Two bodies at the same temperature can have different internal energies and heat capacities. A thermometer therefore does not measure a body's stored amount of heat; the finite-body disturbance and waiting-time calculations in thermometer describe how making the comparison can change the state being measured.[ref]
The name “zeroth” reflects logical order rather than the date of the first thermometer: this premise about thermal equilibrium precedes the already numbered first law of thermodynamics, Second law of thermodynamics and third law of thermodynamics. This is the naming explanation given in University Physics Volume 2 by Samuel J. Ling and others (§1.1, “Thermal Equilibrium”).[ref]
The corresponding Zeroth law of black-hole mechanics states constancy of surface gravity over an equilibrium horizon; Hawking radiation identifies that quantity with physical temperature up to its universal conversion factor.