Binary quadratic form Created 2026-09-24 Updated 2026-11-05
A binary quadratic form is a quadratic form in two variables, written or . In number theory an integral binary quadratic form has integer polynomial coefficients . It represents an integer when for some integers .
The homogeneous polynomial identity distinguishes a form from a general quadratic polynomial with constant or linear terms. The discriminant of a binary quadratic form is . For example, has and represents , while has and represents at .
Changing integer coordinates can conceal the same arithmetic. Substituting into gives . The transformation has determinant one and an integer inverse, so both forms represent exactly the same integers. Proper equivalence of binary quadratic forms records this reversible change, and the reduction algorithm for a positive definite binary quadratic form chooses a small representative for each such equivalence class.
Brauer class Created 2026-10-14 Updated 2026-11-05
The Brauer class of a central simple algebra is its equivalence class under adjoining matrix-algebra factors. Two algebras have the same class exactly when their central division-algebra representatives are isomorphic. The zero class consists of split matrix algebras; the inverse of is the class of the opposite algebra. For a cyclic algebra , the class is zero exactly when is a field norm from .
The canonical projection of a quotient set is the function . It is surjective: every set element of is for some . Two set elements have the same image exactly when they are related by the equivalence relation. Its fibers are precisely the equivalence classes:
Here the left side is the preimage of a singleton subset of the quotient set; its members are the original set elements in the class . In the diagram, the three arrows arriving at start at , and .
Circle modulo reflection 2026-10-31
Identify points of the circle having the same real coordinate, equivalently points related by complex conjugation. The continuous surjection has exactly these equivalence classes as its fibers. It induces a continuous bijection from the quotient space to the closed interval. The quotient space is compact as a continuous image of a compact space, while the closed interval is Hausdorff, so the compact-to-Hausdorff continuous bijection theorem makes the induced map a homeomorphism. The two fixed points of the reflection become the two interval endpoints.
For a nonempty subset of a topological space , identify all points of and leave each point of in its own equivalence class. The resulting quotient space is denoted . For every subset , its saturation of a subset is
The quotient topology therefore gives a useful test: is a closed set if and only if the displayed saturation of a subset is a closed set of . In particular, every closed set disjoint from has closed image, even if is not closed. When is closed, is a closed map, because both possibilities in the formula are then closed sets for closed .
Communicating class Created 2026-09-24 Updated 2026-10-14
In a finite, time-homogeneous Discrete-time Markov chain with row-stochastic transition matrix , write when is accessible from , meaning for some . States communicate, written , when both and . Communication is an equivalence relation, and a communicating class is an entire equivalence class
Thus communicating classes form a partition of the state space; a smaller mutually communicating subset is not itself a class. See Maria Cameron's Markov Chains notes, section 1.2.
The allowance of zero steps matters: , the identity matrix, makes true even for a state with no possible positive-time return. Symmetry is built into communication. For transitivity, concatenate a positive-probability path from to with one from to , and do the same in reverse. These observations prove the equivalence relation directly. One-way accessibility alone is not symmetric and does not define the classes; see Accessible state of a Markov chain.
A closed communicating class satisfies for every and . Once entered, it cannot be left. A singleton class is an absorbing state exactly when it is closed. An open communicating class has an outgoing transition; after a path leaves it, it cannot return, since that would make the visited outside states communicate with it. The internal motion of a closed class can nevertheless continue forever.
Figure 1.
A constructed chain has three communicating classes: an open singleton, a closed alternating pair, and a closed absorbing singleton; dashed outlines group states into classes.
Details.
For this constructed example, in state order , the transition matrix is
There are exactly three communicating classes: , , and . Only the first is open. The second is closed but neither of its states is an absorbing state; they alternate deterministically. Although via , the reverse accessibility fails. A direct matrix power check gives and .
Starting at , let be the first hitting time of either closed class. Staying at for steps has probability , so and . The two eventual destination classes each have probability . Hence the hitting probability of the absorbing state is only , and its unconditional expected hitting time from is infinite: on half the paths it is never hit. In particular, entering a closed class with certainty does not imply entering an absorbing state with certainty.
Classifying the state space separates two questions: which closed region will eventually be entered, and how does the Markov chain move inside that region? In this example the restriction to is an irreducible Markov chain with period two; the restriction to is a one-state irreducible Markov chain with period one. The whole Markov chain is reducible. The absorbing state example illustrates a different possibility: every closed class is a singleton, so eventual class selection is also terminal outcome selection.
Connected component Created 2026-09-24 Updated 2026-10-14
A connected component of a topological space is a nonempty connected subset that is maximal under subset inclusion. If is a connected component and with a connected subset, then . Maximality means that no larger connected subset contains ; it does not mean largest cardinality among all connected subsets.
For example, the connected components of in the usual subspace topology of the real line are and . Each is a real interval, and no connected subset of the real line can meet both without containing the missing point . For the finite set in the same subspace topology, the three connected components are its singleton sets.
Figure 1.
An intact real interval, an interval with an interior point removed, and a finite set have one, two, and three connected components in the usual subspace topology of the real line
. Details.
Every point lies in exactly one connected component, constructed by taking the union
All members contain , so their union is connected by connected union with a connected hub. The union includes every connected subset through , so it is maximal. Equivalently, define
This is an equivalence relation: singleton sets give reflexivity, symmetry is immediate, and two connected subsets sharing the middle point have a connected union, giving transitivity. The equivalence classes are precisely the connected components. They form a partition of a set: they cover and any two are either equal or disjoint.[ref]
Every nonempty connected subset lies within one connected component. Moreover, every connected component is closed in : closure of a connected set makes its closure connected, and maximality forces that closure to equal the original connected component. A connected component need not be open. For example, in with its usual subspace topology from the real line, all connected components are singleton sets, but is not open: every neighbourhood of in contains some .[ref]
Let be a positive odd integer with distinct prime factors. Then
where is the class number of a negative discriminant.
Assign each complete prime power in the prime factorization of to one of two factors . There are ordered integer factorizations with coprime factors. Interchanging and pairs them without a fixed pair, because and coprime equal factors would both be one. Thus there are unordered pairs.
Each pair gives the primitive binary quadratic form of discriminant of a binary quadratic form . It is a reduced positive definite binary quadratic form, so distinct pairs give distinct equivalence classes under proper equivalence by uniqueness of the reduced positive definite binary quadratic form. This proves the lower bound. For the excluded case , the separate value also satisfies the weaker numerical inequality .
In the comparison model exposing only an equality test between otherwise opaque values, partitioning values into equivalence classes takes tests in the worst case. Run the algorithm on pairwise distinct values. If any pair remains untested, changing just those two values to equal is consistent with every answer observed so far but changes the required output partition. Every pair must therefore be tested. With a compatible total order, comparison sort can instead group equal values in time.
Equivalence class Created 2026-10-05 Updated 2026-10-14
An equivalence class collects all the set elements indistinguishable from a specified set element under an equivalence relation. For an equivalence relation on a set , the precise definition is
The ambient set matters: a finite class for integer congruence restricted to differs from the infinite residue class for the same integer congruence on all integers. We write when the equivalence relation and ambient set are clear.
In the finite modulo-three example,
There are nine names but only three distinct equivalence classes. In particular, , whereas : the first statement is membership of a set element; the second is equality of two sets.
For any equivalence relation on , the essential rule is
Reflexivity puts in , so the equivalence classes are nonempty and cover . If two equivalence classes share , the symmetric relation property and transitivity relate their defining elements through ; transitivity then makes their members coincide. Thus distinct equivalence classes are disjoint, giving a partition of a set. Conversely, declare two set elements equivalent when they belong to the same block of a partition of a set. The three relation properties follow immediately and its equivalence classes recover the blocks. [ref]
An equivalence class representative is any set element belonging to that equivalence class. In the finite modulo-three example, either , or represents . Changing the equivalence class representative changes its name but preserves the equivalence class itself. Choosing gives one representative of an equivalence class from each class; the quotient set consists of the three whole sets.
Equivalence relation Created 2026-09-24 Updated 2026-10-14
An equivalence relation says which set elements should count as the same for a particular purpose. In modular arithmetic, for example, distinct integers with the same remainder are equivalent. The relation gathers interchangeable set elements into equivalence classes; the quotient set then treats each whole equivalence class as one object.
Formally, an equivalence relation on a set is a binary relation , written , satisfying three conditions for all :
These conditions make the equivalence classes a partition of a set: each set element belongs to exactly one class. [ref]
For a worked example, take the finite set and restrict integer congruence modulo three to :
Reflexivity follows because . The symmetric relation property follows by changing the sign of a difference, and transitivity follows by adding and : divisibility by three is preserved in both steps. Thus and force . The three equivalence classes are , and . Their members alternate along the number line; membership in an equivalence class need not mean being close together.
Figure 1.
Congruence modulo three divides the integers from zero through eight into three equivalence classes
. Details.
The transitivity requirement rules out a tempting alternative. On , define nearness by the absolute value condition . This binary relation is reflexive and symmetric, but is near and is near while is not near . Its neighborhoods , and overlap without being equal. They are not equivalence classes or a partition of a set.
Essential infimum and essential supremum Created 2026-10-14 Updated 2026-10-25
The essential infimum and essential supremum describe the lower and upper bounds of a measurable function after disregarding null sets for a specified measure. A pointwise infimum or supremum sees every input; an essential bound sees whether values below or above a proposed threshold occur on a set of positive measure. Thus "essential" means insensitive to changes on a null set, rather than insensitive to unusual values. This distinction makes essential bounds compatible with Lebesgue integrals and the equivalence classes used in Lp spaces. [ref].
For a real measurable function on a measure space , the definitions are
These can take values in the extended real number line. On a space of positive total measure, finite essential bounds obey almost everywhere. If is finite, every threshold has ; the corresponding lower-edge statement is for every . These are the measure-based counterparts of the approximation property of a supremum and approximation property of an infimum.
Here is a two-sided example on with Lebesgue measure:
The pointwise bounds are and , while the essential bounds are and . Both exceptional singletons are null sets. But for , the inputs where still have measure , and those where have measure : deleting or adding two individual inputs cannot change those lengths. Hence neither essential bound can be moved inward.
Figure 1.
Essential infimum and essential supremum ignore two exceptional singletons, while pointwise infimum and supremum retain them
. The function follows except for the filled values and . Hollow markers exclude the ordinary values at those inputs. The shaded horizontal band spans the essential bounds zero and one for Lebesgue measure. Details.
The choice of measure is part of the answer. The same has essential bounds and under counting measure, because every nonempty set has positive measure. Under the Dirac measure at , both essential bounds equal . A null set for one measure need not be a null set for another.
Nor must the exceptional inputs be isolated. The Dirichlet function, equal to one at rational numbers and zero at irrational numbers, has pointwise supremum one on , but essential supremum zero for Lebesgue measure: the rational numbers form a countable set that is a null set, even though they are dense. Conversely, a value ten on an interval of length affects the essential supremum just as decisively as it would on half the domain. Small positive measure is not zero measure.
A measurable function is essentially bounded if some finite nonnegative real number bounds its absolute value almost everywhere. The exceptional null set may contain arbitrarily large values. With Lebesgue measure on , a function equal to zero outside and equal to at is essentially bounded despite being unbounded pointwise: its exceptional countable set is a null set, so works. Its L-infinity norm is zero because it represents the zero equivalence class in Lp space.
Contrast this with on . For every , the values exceeding occupy , a set of positive Lebesgue measure. Hence no finite almost everywhere bound works, and this function is not essentially bounded. Being finite at every input does not imply essential boundedness.
Essential range Created 2026-10-06 Updated 2026-10-25
The essential range of a real or complex measurable function consists of the values whose every neighborhood receives inputs of positive measure:
It depends on the measure as well as the function. This definition concerns values arbitrarily near , not necessarily inputs at which exactly. It therefore retains meaningful limiting values while ignoring values occurring only on null sets. [ref].
For on with Lebesgue measure, the ordinary image of a function is , but the essential range is . Neither endpoint is attained, yet inputs with or have positive measure for every . Every interior value also belongs to the essential range, although its exact fiber is a singleton of zero measure. Positive measure of a fiber is sufficient, but is not necessary, for a value to belong to the essential range.
The two-sided example from essential infimum and essential supremum illustrates what disappears. It follows on , except and . Its ordinary image of a function is , whereas its essential range remains . The missing ordinary values and still have arbitrarily close neighbors with positive measure; the exceptional values and can each be isolated by a sufficiently small neighborhood whose preimage is a null set.
Figure 1.
The essential range of the modified identity function remains , while its ordinary image of a function includes two isolated outliers
. For Lebesgue measure, the filled outliers and fail the criterion of positive measure in every neighborhood. The hollow values and still belong to the essential range because nearby outputs occur on intervals of positive measure. Details.
For the three-point example in L-infinity norm, the values are . With weights the essential range is ; with weights it is . A small but positive probability retains ten, so an essential range does not discard a value merely because it is rare. For a real function on a space of positive total measure, the essential infimum and essential supremum are the lower and upper edges of its essential range, allowing infinite bounds. The L-infinity norm instead takes the upper edge of the essential range of .
Figure 2.
Including ten in the essential range changes the limiting Lp norm, even when its probability is only
. The blue case has essential range , while the red case has essential range . These finite positive-valued examples make their largest essential values equal to their L-infinity norms. Details.
A useful operator connection is the spectrum of a real multiplication operator: on a nonzero L2 space over a sigma-finite measure, multiplication by a real measurable function has spectrum equal to its essential range, with the natural domain when is unbounded. Outside that range, has a positive lower bound almost everywhere, so multiplication by gives an inverse function that is a bounded linear operator. Near an essential value, this lower bound fails. Thus discarding null sets is precisely what makes the range match an operator acting on almost everywhere equivalence classes. [ref].
For , write to emphasize that this is a quasi-norm, as in the Lq quasi-norm branch. On two coordinates with counting measure, and give , but . At , this is the explicit failure in the right panel of the diagram. The midpoint has , so the corresponding unit sublevel set is not a convex set.
A useful replacement survives: for nonnegative real numbers , . Together with the scalar triangle inequality, this yields
Consequently is a metric on the equivalence classes of measurable functions with finite , even though itself need not be a metric. Do not replace the failed Minkowski inequality by a universal reversed bound for signed or complex functions: would give a zero sum but two positive separate sizes.
Fiber of a function Created 2026-10-06 Updated 2026-10-14
For a function and , its fiber of a function over is the set of all inputs producing that one output:
Here is shorthand for a preimage of a singleton set, rather than a claim that an inverse function exists. A fiber can contain several inputs or be empty. It describes exactly which distinctions the function forgets.
For the finite function under image and preimage of a function, the fibers over are , , and the empty set, respectively. The nonempty fibers form a partition of a set: they are disjoint sets whose union is the domain of a function. Every input belongs to the fiber over its unique output, and two fibers with distinct output labels cannot share an input. A function is injective exactly when every fiber has at most one member; it is surjective exactly when every member of its specified codomain has a nonempty fiber.
Figure 1.
A preimage collects complete fibers: the outputs select the fibers and
. Details.
More generally, is the union of the fibers over all . The relation defined by is an equivalence relation, and its equivalence classes are precisely the nonempty fibers. The resulting quotient set is naturally in bijection with the image of a function. This links an input partition to the output values actually reached, without choosing one representative from each class.
Fibers are useful when an output is known but the input is not uniquely determined. A solution set is one fiber, and factorization through a surjection explains when another function depends only on the retained output. Quantum hidden subgroup problem algorithms use functions whose fibers are cosets, giving the same idea a structured form in group theory.
First-order associative deformation Created 2026-10-14 Updated 2026-11-05
The order- part of associativity is , so is a Hochschild cocycle. A change of coordinates changes to . Therefore equivalence classes of first-order associative deformations of a fixed underlying algebra are its second Hochschild cohomology. Unital deformations use normalized cochains.
Geometric congruence class Created 2026-10-20 Updated 2026-11-05
A geometric congruence class is an equivalence class of figures under geometric congruence: two figures represent the same class when a Euclidean isometry maps one to the other. It forgets position and orientation but retains lengths and angles. For example, every triangle with side lengths represents the same class, by side-side-side congruence. A mirror image belongs to the same class when reflections are allowed; restricting to orientation-preserving motions can distinguish the two orientations of an asymmetric labelled figure.
Germ (mathematics) 2026-10-14
A germ at a point is an equivalence class of functions defined on a neighbourhood of the point: two representatives are equivalent if they agree on some smaller neighbourhood. A germ of a holomorphic function requires its representatives to be holomorphic functions; smooth and continuous germs use their corresponding classes of functions. The germ retains local behavior while forgetting the representative's values farther from the point.