Subgradient method: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Moritzge
m →‎Classical subgradient rules: missing full-stop added
→‎General constraints: link to "subdifferential"
 
(One intermediate revision by one other user not shown)
Line 1: Line 1:
{{Unreferenced|date=March 2007}}
The author is known by the title of Figures Lint. My day occupation is a meter reader. South Dakota is her beginning place but she needs to move simply because of her family members. Playing baseball is the hobby he will never quit doing.<br><br>my blog post ... [http://xrambo.com/blog/191590 xrambo.com]
In [[mathematics]], a complete set of [[Invariant (mathematics)|invariant]]s for a [[classification theorems|classification problem]] is a collection of maps
:<math>f_i : X \to Y_i \,</math>
(where ''X'' is the collection of objects being classified, up to some equivalence relation, and the <math>Y_i</math> are some sets), such that <math>x</math> ∼ <math>x'</math> if and only if <math>f_i(x) = f_i(x')</math> 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
:<math>\prod f_i : (X/\sim) \to \prod Y_i</math>
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 [[coinvariant]]s (equivalence classes, orbits), and a complete set of invariants characterizes the coinvariants (is a set of defining equations for the coinvariants).
 
==Examples==
* In the [[classification of two-dimensional closed manifolds]], [[Euler characteristic]] (or [[Genus (mathematics)|genus]]) and [[orientability]] are a complete set of invariants.
* [[Jordan normal form]] of a matrix is a complete invariant for matrices up to conjugation, but [[eigenvalue]]s (with multiplicities) are not.
 
==Realizability of invariants==
A complete set of invariants does not immediately yield a [[classification theorem]]: not all combinations of invariants may be realized. Symbolically, one must also determine the image of
:<math>\prod f_i : X \to \prod Y_i.</math>
 
{{DEFAULTSORT:Complete Set Of Invariants}}
[[Category:Mathematical terminology]]

Latest revision as of 17:04, 14 October 2014

The author is known by the title of Figures Lint. My day occupation is a meter reader. South Dakota is her beginning place but she needs to move simply because of her family members. Playing baseball is the hobby he will never quit doing.

my blog post ... xrambo.com