In mathematics and computer science, a canonical, normal, or standard form of a mathematical object is a standard way of presenting that object as a mathematical expression. Often, it is one which provides the simplest representation of an object and which allows it to be identified in a unique way. The distinction between "canonical" and "normal" forms varies from subfield to subfield. In most fields, a canonical form specifies a unique representation for every object, while a normal form simply specifies its form, without the requirement of uniqueness.
The canonical form of a positive integer in decimal representation is a finite sequence of digits that does not begin with zero. More generally, for a class of objects on which an equivalence relation is defined, a canonical form consists in the choice of a specific object in each class. For example:
In computer science, and more specifically in computer algebra, when representing mathematical objects in a computer, there are usually many different ways to represent the same object. In this context, a canonical form is a representation such that every object has a unique representation (with canonicalization being the process through which a representation is put into its canonical form). Thus, the equality of two objects can easily be tested by testing the equality of their canonical forms.
Despite this advantage, canonical forms frequently depend on arbitrary choices (like ordering the variables), which introduce difficulties for testing the equality of two objects resulting on independent computations. Therefore, in computer algebra, normal form is a weaker notion: A normal form is a representation such that zero is uniquely represented. This allows testing for equality by putting the difference of two objects in normal form.
Canonical form can also mean a differential form that is defined in a natural (canonical) way.
Given a set S of objects with an equivalence relation R on S, a canonical form is given by designating some objects of S to be "in canonical form", such that every object under consideration is equivalent to exactly one object in canonical form. In other words, the canonical forms in S represent the equivalence classes, once and only once. To test whether two objects are equivalent, it then suffices to test equality on their canonical forms. A canonical form thus provides a classification theorem and more, in that it not only classifies every class, but also gives a distinguished (canonical) representative for each object in the class.
Formally, a canonicalization with respect to an equivalence relation R on a set S is a mapping c:S->S such that for all s, s1, s2 ? S:
Property 3 is redundant; it follows by applying 2 to 1.
In practical terms, it's often advantageous to be able to recognize the canonical forms. There is also a practical, algorithmic question to consider: how to pass from a given object s in S to its canonical form s*? Canonical forms are generally used to make operating with equivalence classes more effective. For example, in modular arithmetic, the canonical form for a residue class is usually taken as the least non-negative integer in it. Operations on classes are carried out by combining these representatives, and then reducing the result to its least non-negative residue. The uniqueness requirement is sometimes relaxed, allowing the forms to be unique up to some finer equivalence relation, such as allowing for reordering of terms (if there is no natural ordering on terms).
A canonical form may simply be a convention, or a deep theorem. For example, polynomials are conventionally written with the terms in descending powers: it is more usual to write x2 + x + 30 than x + 30 + x2, although the two forms define the same polynomial. By contrast, the existence of Jordan canonical form for a matrix is a deep theorem.
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.
|Objects||A is equivalent to B if:||Normal form||Notes|
|Normal matrices over the complex numbers||for some unitary matrix U||Diagonal matrices (up to reordering)||This is the Spectral theorem|
|Matrices over the complex numbers||for some unitary matrices U and V||Diagonal matrices with real positive entries (in descending order)||Singular value decomposition|
|Matrices over an algebraically closed field||for some invertible matrix P||Jordan normal form (up to reordering of blocks)|
|Matrices over an algebraically closed field||for some invertible matrix P||Weyr canonical form (up to reordering of blocks)|
|Matrices over a field||for some invertible matrix P||Frobenius normal form|
|Matrices over a principal ideal domain||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||for some unimodular matrix U||Hermite normal form|
|Finite-dimensional vector spaces over a field K||A and B are isomorphic as vector spaces||, n a non-negative integer|
|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||Primary decomposition (up to reordering) or invariant factor decomposition|
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 equations, or by means of Hamiltonian mechanics. Such systems of integrable differential equations are called integrable systems.
|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.||sequence spaces (up to exchanging the index set I with another index set of the same cardinality)|
|Commutative -algebras with unit||A and B are isomorphic as -algebras||The algebra of continuous functions on a compact Hausdorff space, up to homeomorphism of the base space.|
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.
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 labeled graph Canon(G) that is 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.
In computing, the reduction of data to any kind of canonical form is commonly called data normalization.
In the field of software security, a common 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., HTML encoding) and reducing the input data to a single common character set.