Classification theorem

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In mathematics, a classification theorem answers the classification problem: "What are the objects of a given type, up to some equivalence?". It gives a non-redundant enumeration: each object is equivalent to exactly one class.[1]

A few issues related to classification are the following.

  • The equivalence problem is "given two objects, determine if they are equivalent".
  • A complete set of invariants, together with which invariants are realizable, solves the classification problem, and is often a step in solving it. (A combination of invariant values is realizable if there in fact exists an object whose invariants take on the specified set of values)
  • A computable complete set of invariants[clarify] (together with which invariants are realizable) solves both the classification problem and the equivalence problem.
  • A canonical form solves the classification problem, and is more data: it not only classifies every class, but provides a distinguished (canonical) element of each class.

There exist many classification theorems in mathematics, as described below.

Geometry

[edit | edit source]

Algebra

[edit | edit source]

Linear algebra

[edit | edit source]

Analysis

[edit | edit source]

Dynamical systems

[edit | edit source]

Mathematical physics

[edit | edit source]
  • Lua error in Module:GetShortDescription at line 33: attempt to index field 'wikibase' (a nil value).
  • Petrov classification – Classification used in differential geometry and general relativity
  • Segre classification – Algebraic classification of rank two symmetric tensors
  • Wigner's classification – Classification of irreducible representations of the Poincaré group

See also

[edit | edit source]

References

[edit | edit source]
  1. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).