Editing Canonical form (section)

==Examples==
Note: in this section, "[[up to]]" some equivalence relation E means that the canonical form is not unique in general, but that if one object has two different canonical forms, they are E-equivalent.

===Large number notation===
Standard form is used by many mathematicians and scientists to write extremely [[large numbers#Standardized system of writing very large numbers|large numbers]] in a more concise and understandable way, the most prominent of which being the [[scientific notation]].<ref>{{Cite web|url=https://serc.carleton.edu/quantskills/methods/quantlit/BigNumbers.html|title=Big Numbers and Scientific Notation|website=Teaching Quantitative Literacy|language=en|access-date=2019-11-20}}</ref>

===Number theory===
*[[Canonical representation of a positive integer]]
*The canonical form of a [[continued fraction]] for representing a number is the [[simple continued fraction]]

===Linear algebra===
{| class="wikitable"
|-
! Objects
! ''A'' is equivalent to ''B'' if:
! Normal form
! Notes
|-
| [[Normal matrix|Normal matrices]] over the [[complex number]]s
| <math>A=U^*B U</math> for some [[unitary matrix]] ''U''
| [[Diagonal matrices]] (up to reordering)
| This is the [[Spectral theorem]]
|-
| Matrices over the complex numbers
| <math>A=U B V^*</math> for some unitary matrices ''U'' and ''V''
| Diagonal matrices with real non-negative entries (in descending order)
| [[Singular value decomposition]]
|-
| Matrices over an [[algebraically closed field]]
| <math>A=P^{-1} B P</math> for some [[invertible matrix]] ''P''
| [[Jordan normal form]] (up to reordering of blocks)
|
|-
| Matrices over an algebraically closed field
| <math>A=P^{-1} B P</math> for some invertible matrix ''P''
| [[Weyr canonical form]] (up to reordering of blocks)
|
|-
| Matrices over a field
| <math>A=P^{-1} B P</math> for some invertible matrix ''P''
| [[Frobenius normal form]]
|
|-
| Matrices over a [[principal ideal domain]]
| <math>A=P^{-1} B Q</math> for some invertible matrices ''P'' and ''Q''
| [[Smith normal form]]
| The equivalence is the same as allowing invertible elementary row and column transformations
|-
| Matrices over the integers
| <math>A=UB</math> for some [[unimodular matrix]] ''U''
| [[Hermite normal form]]
|
|-
|Matrices over the [[Modular arithmetic#Integers modulo m|integers modulo n]]
|
|[[Howell normal form]]
|
|-
| Finite-dimensional [[vector space]]s over a field ''K''
| ''A'' and ''B'' are isomorphic as vector spaces
| <math>K^n</math>, ''n'' a non-negative integer
|
|}

===Algebra===
{| class="wikitable"
|-
! Objects
! ''A'' is equivalent to ''B'' if:
! Normal form
|-
| Finitely generated ''R''-modules with ''R'' a [[principal ideal domain]]
| ''A'' and ''B'' are isomorphic as ''R''-modules
| [[Structure theorem for finitely generated modules over a principal ideal domain|Primary decomposition (up to reordering) or invariant factor decomposition]]
|}

===Geometry===
In [[analytic geometry]]:
*The equation of a line: ''Ax''&nbsp;+&nbsp;''By''&nbsp;=&nbsp;''C'', with ''A<sup>2</sup>''&nbsp;+&nbsp;''B''<sup>2</sup>&nbsp;=&nbsp;1 and ''C''&nbsp;≥&nbsp;0
*The equation of a circle: <math>(x - h)^2 + (y - k)^2 = r^2</math>

By contrast, there are alternative forms for writing equations. For example, the equation of a line may be written as a [[linear equation]] in [[point-slope]] and [[slope-intercept form]].

[[Convex polyhedra]] can be put into [[Midsphere#Canonical_polyhedron|canonical form]] such that:
*All faces are flat,
*All edges are tangent to the unit sphere, and
*The centroid of the polyhedron is at the origin.<ref>{{citation|title=Lectures on Polytopes|author-link=Günter M. Ziegler|first=Günter M.|last=Ziegler|year=1995|isbn=0-387-94365-X|series=Graduate Texts in Mathematics|publisher=Springer-Verlag|volume=152|pages=117–118}}</ref>

===Integrable systems===
Every differentiable [[manifold]] has a [[cotangent bundle]]. That bundle can always be endowed with a certain [[differential form]], called the [[canonical one-form]]. This form gives the cotangent bundle the structure of a [[symplectic manifold]], and allows vector fields on the manifold to be integrated by means of the [[Euler-Lagrange equation]]s, or by means of [[Hamiltonian mechanics]]. Such systems of integrable [[differential equation]]s are called [[integrable system]]s.

===Dynamical systems===
The study of [[dynamical systems]] overlaps with that of [[Integrable system|integrable systems]]; there one has the idea of a [[normal form (dynamical systems)]].

===Three dimensional geometry===
In the study of manifolds in three dimensions, one has the [[first fundamental form]], the [[second fundamental form]] and the [[third fundamental form]].

===Functional analysis===
{| class="wikitable"
|-
! Objects
! ''A'' is equivalent to ''B'' if:
! Normal form
|-
| [[Hilbert spaces]]
| If ''A'' and ''B'' are both Hilbert spaces of infinite dimension, then ''A'' and ''B'' are isometrically isomorphic.
| <math>\ell^2(I)</math> [[Hilbert space#Sequence spaces|sequence spaces]] (up to exchanging the index set ''I'' with another index set of the same [[cardinality]])
|-
<!-- please double-check this one -->
| Commutative [[C*-algebra]]s with unit
| ''A'' and ''B'' are isomorphic as C*-algebras
| The algebra <math>C(X)</math> of continuous functions on a [[compact space|compact]] [[Hausdorff space]], up to [[homeomorphism]] of the base space.
|}

===Classical logic===
{{main article|Canonical form (Boolean algebra)}}
*[[Negation normal form]]
*[[Conjunctive normal form]]
*[[Disjunctive normal form]]
*[[Algebraic normal form]]
*[[Prenex normal form]]
*[[Skolem normal form]]
*[[Blake canonical form]], also known as the complete sum of prime implicants, the complete sum, or the disjunctive prime form

===Set theory===
*[[Cantor normal form#Cantor normal form|Cantor normal form]] of an [[ordinal number]]

===Game theory===
*[[Normal form game]]

===Proof theory===
*[[Normal form (natural deduction)]]

===Rewriting systems===
{{main|Normal form (abstract rewriting)}}
The symbolic manipulation of a formula from one form to another is called a "rewriting" of that formula. One can study the abstract properties of rewriting generic formulas, by studying the collection of rules by which formulas can be validly manipulated. These are the "rewriting rules"—an integral part of an [[abstract rewriting system]]. A common question is whether it is possible to bring some generic expression to a single, common form, the normal form. If different sequences of rewrites still result in the same form, then that form can be termed a normal form, with the rewrite being called a confluent. It is not always possible to obtain a normal form.

===Lambda calculus===
*A lambda term is in [[beta normal form]] if no beta reduction is possible; [[lambda calculus]] is a particular case of an abstract rewriting system. In the untyped lambda calculus, for example, the term <math>(\lambda x.(x x) \; \lambda x.(x x))</math> does not have a normal form. In the typed lambda calculus, every well-formed term can be rewritten to its normal form.

===Graph theory===
{{main article|Graph canonization}}
In [[graph theory]], a branch of mathematics, graph canonization is the problem of finding a canonical form of a given graph ''G''. A canonical form is a [[Graph labeling|labeled graph]] Canon(''G'') that is [[graph isomorphism|isomorphic]] to ''G'', such that every graph that is isomorphic to ''G'' has the same canonical form as ''G''. Thus, from a solution to the graph canonization problem, one could also solve the problem of [[graph isomorphism]]: to test whether two graphs ''G'' and ''H'' are isomorphic, compute their canonical forms Canon(''G'') and Canon(''H''), and test whether these two canonical forms are identical.

===Computing===
In [[computing]], the reduction of data to any kind of canonical form is commonly called ''data normalization''.

For instance, [[database normalization]] is the process of organizing the [[Field (computer science)|fields]] and [[Table (database)|table]]s of a [[relational database]] to minimize [[Data redundancy|redundancy]] and dependency.<ref>{{Cite web|url=https://support.microsoft.com/en-ca/help/283878/description-of-the-database-normalization-basics|title=Description of the database normalization basics|website=support.microsoft.com|access-date=2019-11-20}}</ref>

In the field of [[software security]], a common [[Vulnerability (computing)|vulnerability]] is unchecked malicious input (see ''[[Code injection]]''). The mitigation for this problem is proper [[input validation]]. Before input validation is performed, the input is usually normalized by eliminating encoding (e.g., [[Character encodings in HTML|HTML encoding]]) and reducing the input data to a single common [[character set]].

Other forms of data, typically associated with [[signal processing]] (including [[Audio signal processing|audio]] and [[Image processing|imaging]]) or [[machine learning]], can be normalized in order to provide a limited range of values.

In [[content management]], the concept of a [[single source of truth]] (SSOT) is applicable, just as it is in [[database normalization]] generally and in [[software development]]. Competent [[content management system]]s provide logical ways of obtaining it, such as [[transclusion]].