In mathematics, the term essentially unique is used to describe a weaker form of uniqueness, where an object satisfying a property is "unique" only in the sense that all objects satisfying the property are equivalent to each other. The notion of essential uniqueness presupposes some form of "sameness", which is often formalized using an equivalence relation.
A related notion is a universal property, where an object is not only essentially unique, but unique up to a unique isomorphism (meaning that it has trivial automorphism group). In general there can be more than one isomorphism between examples of an essentially unique object.
At the most basic level, there is an essentially unique set of any given cardinality, whether one labels the elements or . In this case, the non-uniqueness of the isomorphism (e.g., match 1 to or 1 to ) is reflected in the symmetric group.
On the other hand, there is an essentially unique ordered set of any given finite cardinality: if one writes and , then the only order-preserving isomorphism is the one which maps 1 to , 2 to , and 3 to .
The fundamental theorem of arithmetic establishes that the factorization of any positive integer into prime numbers is essentially unique, i.e., unique up to the ordering of the prime factors.
In the context of classification of groups, there is an essentially unique group containing exactly 2 elements. Similarly, there is also an essentially unique group containing exactly 3 elements: the cyclic group of order three. In fact, regardless of how one chooses to write the three elements and denote the group operation, all such groups can be shown to be isomorphic to each other, and hence are "the same".
On the other hand, there does not exist an essentially unique group with exactly 4 elements, as there are in this case two non-isomorphic groups in total: the cyclic group of order 4 and the Klein four group.
There is an essentially unique measure that is translation-invariant, strictly positive and locally finite on the real line. In fact, any such measure must be a constant multiple of Lebesgue measure, specifying that the measure of the unit interval should be 1—before determining the solution uniquely.
Given the task of using 24-bit words to store 12 bits of information in such a way that 7-bit errors can be detected and 3-bit errors can be corrected, the solution is essentially unique: the extended binary Golay code.
- Classification theorem
- Modulo, a mathematical term pertaining to the equivalence of objects
- Universal property
- Up to
- "The Definitive Glossary of Higher Mathematical Jargon — Essentially unique". Math Vault. 2019-08-01. Retrieved 2019-11-22.
- "Universal property - Encyclopedia of Mathematics". www.encyclopediaofmath.org. Retrieved 2019-11-22.
- Garnier, Rowan; Taylor, John (2009-11-09). Discrete Mathematics: Proofs, Structures and Applications, Third Edition. CRC Press. p. 452. ISBN 9781439812808.
- Weisstein, Eric W. "Essentially Unique". mathworld.wolfram.com. Retrieved 2019-11-22.
- Corry, Scott. "Classification of Groups of Order n ≤ 8" (PDF). Lawrence University. Retrieved 2019-11-21.
- Lickorish, W. B. Raymond (2012-12-06). An Introduction to Knot Theory. Springer Science & Business Media. ISBN 9781461206910.
- "limit in nLab". ncatlab.org. Retrieved 2019-11-22.
- Baez, John (2015-12-01). "Golay Code". Visual Insight. American Mathematical Society. Retrieved 2017-12-02.