Complete Set Of Invariants
In mathematics, a complete set of invariants for a classification problem is a collection of maps
(where X is the collection of objects being classified, up to some equivalence relation, and the are some sets), such that ∼ if and only if for all i. In words, such that two objects are equivalent if and only if all invariants are equal.
Symbolically, a complete set of invariants is a collection of maps such that
is injective.
As invariants are, by definition, equal on equivalent objects, equality of invariants is a necessary condition for equivalence; a complete set of invariants is a set such that equality of these is sufficient for equivalence. In the context of a group action, this may be stated as: invariants are functions of coinvariants (equivalence classes, orbits), and a complete set of invariants characterizes the coinvariants (is a set of defining equations for the coinvariants).
Read more about Complete Set Of Invariants: Examples, Realizability of Invariants
Other articles related to "complete set of invariants, of invariants":
... A complete set of invariants does not immediately yield a classification theorem not all combinations of invariants may be realized ...
Famous quotes containing the words complete and/or set:
“Could slavery suggest a more complete servility than some of these journals exhibit? Is there any dust which their conduct does not lick, and make fouler still with its slime?”
—Henry David Thoreau (1817–1862)
“I set out as a sort of self-dependent politician. My opinions were my own. I dashed at all prejudices. I scorned to follow anybody in matter of opinion.... All were, therefore, offended at my presumption, as they deemed it.”
—William Cobbett (1762–1835)