Oseledets theorem - Revision history

en>Crasshopper: /* Cocycles */

2014-05-19T02:20:15Z

Cocycles

← Older revision		Revision as of 04:20, 19 May 2014
Line 1:		Line 1:
	Irwin ~~Butts is what my spouse loves~~ to ~~call me though~~ I ~~don't~~ truly ~~like being called like that~~. ~~Puerto Rico is where he's been residing for years and he will by no means move. To gather badges is what her~~ family members and ~~her appreciate~~. ~~Managing people~~ is ~~his profession~~.<br><br>~~Also visit~~ my ~~website :~~: [http://~~reinodoprazer~~.~~Com.br~~/~~index.php?do=~~/~~blog~~/~~326~~/~~tips~~-~~about~~-~~how~~-to-~~overcome~~-~~candidiasis~~-~~easily/ http://reinodoprazer.Com.br~~/]		The author is called Irwin. I used to be unemployed but now I am a librarian and the wage has been truly satisfying. My family members lives in Minnesota and my family loves it. One of the extremely best issues in the world for me is to do aerobics and now I'm attempting to earn cash with it.<br><br>Look into my homepage: [http://raybana.com/chat/pg/groups/174883/solid-advice-for-dealing-with-a-candida/ home std test]

en>Guy vandegrift: Redirect for less technical discussion. Is it OK to do this?

2014-02-09T17:02:45Z

Redirect for less technical discussion. Is it OK to do this?

← Older revision		Revision as of 19:02, 9 February 2014
Line 1:		Line 1:
	~~{{About\|group theory\|cycles in homological algebra\|Chain complex#Fundamental terminology\|cycles in graph theory\|Cycle (graph theory)}}~~		Irwin Butts is what my spouse loves to call me though I don't truly like being called like that. Puerto Rico is where he's been residing for years and he will by no means move. To gather badges is what her family members and her appreciate. Managing people is his profession.<br><br>Also visit my website :: [http://reinodoprazer.Com.br/index.php?do=/blog/326/tips-about-how-to-overcome-candidiasis-easily/ http://reinodoprazer.Com.br/]
	~~In [[mathematics]], and in particular in [[group theory]], a '''cycle'''~~ is ~~a [[permutation]] of the elements of some set ''X'' which maps the elements of some subset ''S'' of ''X''~~ to ~~each other in a cyclic fashion, while fixing (i.e., mapping to themselves) all other elements of~~ '~~'X''. For example, the permutation of {1, 2, 3, 4} that sends 1 to 3, 2 to 4, 3 to 2 and 4 to 1 is a cycle, while the permutation~~ that ~~sends 1 to 3, 2 to 4, 3 to 1 and 4 to 2 is not (it separately permutes the pairs {1, 3} and {2, 4})~~. ~~The set ''S''~~ is ~~called the [[orbit (group theory)\|orbit]] of the cycle.~~

	~~== Definition ==~~
	~~A permutation of a set~~ ''X'', which is a [[bijection\|bijective function]] <math>\sigma:X\to X</math>, is called a cycle if the action on ''X'' of the subgroup generated by <math>\sigma</math> has exactly one orbit with more than a single element. This notion is most commonly used when ''X'' is a finite set; then of course the orbit ''S'' in question is also finite. Let <math>s_0</math> be any element of ''S'', and put <math>s_i=\sigma^i(s) \,</math> for any <math>i\in\mathbf{Z}</math>. Since by assumption ''S'' has more than one element, <math>s_1\neq s_0</math>; if ''S'' is finite, there is a minimal number <math>k>1</math> for which <math>s_k=s_0</math>. Then <math>S=\{ s_0, s_1, \ldots, s_{k-1}\}</math>, and <math>\sigma</math> is the permutation defined by

	~~:<math>\sigma(s_i) = s_{i+1} \quad\mbox{~~for ~~}0\leq i<k</math>~~

	and ~~<math>\sigma(x)=x</math> for any element of <math>X\setminus S</math>. The elements not fixed~~ by ~~<math>\sigma</math> can be pictured as~~

	~~:<math>s_0\mapsto s_1\mapsto s_2\mapsto\cdots\mapsto s_{k-1}\mapsto s_k=s_0</math>.~~

	~~A cycle can be written using the compact [[cycle notation]] <math>\sigma = (s_0~s_1~\dots~s_{k-1})</math> (there are~~ no ~~commas between elements in this notation, to avoid confusion with a ''k''-[[tuple]]). The '''length''' of a cycle, is the number of elements of its orbit of non-fixed elements~~. ~~A cycle of length ''k''~~ is ~~also called a ''' ''k''-cycle'''.~~

	~~== Basic properties ==~~

	One of the basic results on [[symmetric group]]s says that any permutation can be expressed as the product of [[Disjoint sets\|disjoint]] cycles (more precisely: cycles with disjoint orbits); such cycles commute with each other, and the expression of the permutation is unique up to the order of the cycles (but note that the cycle notation is not unique: each ''k''-cycle can itself be written in ''k'' different ways, depending on the choice of <math>s_0</math> in its orbit). ~~The [[multiset]] of lengths of the cycles in this expression~~ is ~~therefore uniquely determined by the permutation, and both the signature and the [[conjugacy class]] of the permutation in the symmetric group are determined by it~~.

	~~The number of ''k''-cycles in the symmetric group ''S''~~<~~sub~~>~~''n''~~<~~/sub~~> ~~is given, for <math>2\leq k\leq n</math>, by the following equivalent formulas~~
	:~~<math>\binom nk(k-1)!=\frac{n(n-1)\cdots(n-k+1)}{k}=\frac{n!}{(n-k)!k}</math>~~

	~~A ''k''-cycle has~~ [~~[signature of a permutation\|signature]] (−1)<sup>''k'' − 1</sup>.~~

	~~== Transpositions ==~~
	~~[[File~~:~~Array of permutations; transpositions.svg\|thumb\|400px\|Array of transpositions]]~~
	A cycle with only two elements is called a '''transposition'''. For example, the permutation of {1, 2, 3, 4} that sends 1 to 1, 2 to 4, 3 to 3 and 4 to 2 is a transposition (specifically, the transposition that swaps 2 and 4).

	~~=== Properties ===~~
	Any permutation can be expressed as the [[function composition\|composition]] (product) of transpositions—formally, they are [[Generating set of a group\|generators]] for the [[group (mathematics)\|group]]. In fact, if one takes <math>a=1</~~math>, <math>b=2<~~/~~math>,~~ ...~~, <math>e~~=5</~~math>, then any permutation can be expressed as a product of '''{{visible anchor\|adjacent transpositions}}''', meaning the transpositions <math>(k~~k+1),<~~/~~math> in this case <math>(1~2)<~~/math>, <math>(2~3)</math>, <math>(3~4)</math>, and <math>(4~5).</math> This follows because an arbitrary transposition can be expressed as the product of adjacent transpositions. Concretely, one can express the transposition <math>(k~~l)</math> where <math>k < l</math> by moving ''k'' to ~~''l'' one step at a time, then moving ''l'' back to where ''k'' was, which interchanges these two and makes no other changes:~~

	~~:<math>(k~~l) = (k~~k+1)\cdot(k+1~~k+2)\cdots(l~~-~~1~~l)\cdot(l~~-~~2~~l~~-~~1)\cdots(k~~k+1).<~~/~~math>~~

	The decomposition of a permutation into a product of transpositions is obtained for example by writing the permutation as a product of disjoint cycles, and then splitting iteratively each of the cycles of length 3 and longer into a product of a transposition and a cycle of length one less:

	~~:<math>(a,b,c,d,\ldots,y,z) = (a,b)\cdot (b,c,d,\ldots y,z)</math>~~

	This means the initial request is to move <math>a</math> to <math>b</math>, <math>b</math> to <math>c</math>, <math>y</math> to <math>z</math> and finally <math>z</math> to <math>a</math>. Instead one may roll the elements keeping <math>a</math> where it is by executing the right factor first (as usual in operator notation, and following the convention in the article on [[Permutation#Product and inverse\|Permutations]]). This has moved <math>z</math> to the position of <math>b</math>, so after the first permutation, the elements <math>a</math> and <math>z</math> are not yet at their final positions. The transposition <math>(a,b)</math>, executed thereafter, then addresses <math>z</math> by the index of <math>b</math> to swap what initially were <math>a</math> and <math>z</math>.

	~~In fact, the [[symmetric group]] is a [[Coxeter group]], meaning that it is generated by elements of order 2 (the adjacent transpositions), and all relations are of a certain form.~~

	One of the main results on symmetric groups states that either all of the decompositions of a given permutation into transpositions have an even number of transpositions, or they all have an odd number of transpositions, that allows to define the [[parity of a permutation]].

	~~== See also ==~~
	* [[Cycle detection]] – the algorithmic problem of finding a cycle in a sequence of iterated function values.
	* [[Cycle sort]] – a sorting algorithm that is based on the idea that the permutation to be sorted can be factored into cycles, which can individually be rotated to give a sorted result
	* [[Cycles and fixed points]]
	* [[Dihedral group]]
	* [[Fifteen puzzle]]

	~~== External links ==~~
	* [http://~~www~~.~~cut-the-knot~~.~~org/Curriculum~~/~~Combinatorics/PermByTrans.shtml Permutations as a Product of Transpositions]~~

	~~== References ==~~
	* Anderson, Marlow and Feil, Todd (2005), ''A First Course in Abstract Algebra'', Chapman & Hall/CRC; 2nd edition. ISBN 1-58488-515-7.
	*{{citation\|first=John\|last=Fraleigh\|authorlink=\|title=A first course in abstract algebra\|edition=7th\|year=2002\|publisher=Addison Wesley\|isbn=978-0-201-76390-4}}

	~~{{PlanetMath attribution\|id=2262\|title=cycle}}~~

	~~{{DEFAULTSORT:Cycle (Mathematics)}}~~
	~~[[Category:Algebra]]~~
	~~[[Category:Permutations]~~]

189.1.128.130: /* Statement of the theorem */

2013-01-04T21:16:28Z

Statement of the theorem

← Older revision		Revision as of 23:16, 4 January 2013
Line 1:		Line 1:
	~~Hello~~. Let ~~me introduce~~ the ~~author~~. ~~Her title~~ is ~~Refugia Shryock~~. ~~My working day job~~ is a ~~librarian~~. ~~South Dakota~~ is ~~exactly where me~~ and ~~my husband reside~~ and ~~my family members enjoys~~ it. ~~One~~ of the ~~things he enjoys most~~ is ~~ice skating but he~~ is ~~having difficulties~~ to ~~find~~ time for it.<br><br>~~Also visit my web blog:~~ [http://~~vip~~.~~akwacity~~.~~com~~/~~oxwall~~/~~blogs~~/~~post~~/~~10278 over the counter std test~~]		{{About\|group theory\|cycles in homological algebra\|Chain complex#Fundamental terminology\|cycles in graph theory\|Cycle (graph theory)}}
			In [[mathematics]], and in particular in [[group theory]], a '''cycle''' is a [[permutation]] of the elements of some set ''X'' which maps the elements of some subset ''S'' of ''X'' to each other in a cyclic fashion, while fixing (i.e., mapping to themselves) all other elements of ''X''. For example, the permutation of {1, 2, 3, 4} that sends 1 to 3, 2 to 4, 3 to 2 and 4 to 1 is a cycle, while the permutation that sends 1 to 3, 2 to 4, 3 to 1 and 4 to 2 is not (it separately permutes the pairs {1, 3} and {2, 4}). The set ''S'' is called the [[orbit (group theory)\|orbit]] of the cycle.

			== Definition ==
			A permutation of a set ''X'', which is a [[bijection\|bijective function]] <math>\sigma:X\to X</math>, is called a cycle if the action on ''X'' of the subgroup generated by <math>\sigma</math> has exactly one orbit with more than a single element. This notion is most commonly used when ''X'' is a finite set; then of course the orbit ''S'' in question is also finite. Let <math>s_0</math> be any element of ''S'', and put <math>s_i=\sigma^i(s) \,</math> for any <math>i\in\mathbf{Z}</math>. Since by assumption ''S'' has more than one element, <math>s_1\neq s_0</math>; if ''S'' is finite, there is a minimal number <math>k>1</math> for which <math>s_k=s_0</math>. Then <math>S=\{ s_0, s_1, \ldots, s_{k-1}\}</math>, and <math>\sigma</math> is the permutation defined by

			:<math>\sigma(s_i) = s_{i+1} \quad\mbox{for }0\leq i<k</math>

			and <math>\sigma(x)=x</math> for any element of <math>X\setminus S</math>. The elements not fixed by <math>\sigma</math> can be pictured as

			:<math>s_0\mapsto s_1\mapsto s_2\mapsto\cdots\mapsto s_{k-1}\mapsto s_k=s_0</math>.

			A cycle can be written using the compact [[cycle notation]] <math>\sigma = (s_0~s_1~\dots~s_{k-1})</math> (there are no commas between elements in this notation, to avoid confusion with a ''k''-[[tuple]]). The '''length''' of a cycle, is the number of elements of its orbit of non-fixed elements. A cycle of length ''k'' is also called a ''' ''k''-cycle'''.

			== Basic properties ==

			One of the basic results on [[symmetric group]]s says that any permutation can be expressed as the product of [[Disjoint sets\|disjoint]] cycles (more precisely: cycles with disjoint orbits); such cycles commute with each other, and the expression of the permutation is unique up to the order of the cycles (but note that the cycle notation is not unique: each ''k''-cycle can itself be written in ''k'' different ways, depending on the choice of <math>s_0</math> in its orbit). The [[multiset]] of lengths of the cycles in this expression is therefore uniquely determined by the permutation, and both the signature and the [[conjugacy class]] of the permutation in the symmetric group are determined by it.

			The number of ''k''-cycles in the symmetric group ''S''<sub>''n''</sub> is given, for <math>2\leq k\leq n</math>, by the following equivalent formulas
			:<math>\binom nk(k-1)!=\frac{n(n-1)\cdots(n-k+1)}{k}=\frac{n!}{(n-k)!k}</math>

			A ''k''-cycle has [[signature of a permutation\|signature]] (−1)<sup>''k'' − 1</sup>.

			== Transpositions ==
			[[File:Array of permutations; transpositions.svg\|thumb\|400px\|Array of transpositions]]
			A cycle with only two elements is called a '''transposition'''. For example, the permutation of {1, 2, 3, 4} that sends 1 to 1, 2 to 4, 3 to 3 and 4 to 2 is a transposition (specifically, the transposition that swaps 2 and 4).

			=== Properties ===
			Any permutation can be expressed as the [[function composition\|composition]] (product) of transpositions—formally, they are [[Generating set of a group\|generators]] for the [[group (mathematics)\|group]]. In fact, if one takes <math>a=1</math>, <math>b=2</math>, ..., <math>e=5</math>, then any permutation can be expressed as a product of '''{{visible anchor\|adjacent transpositions}}''', meaning the transpositions <math>(k~~k+1),</math> in this case <math>(1~2)</math>, <math>(2~3)</math>, <math>(3~4)</math>, and <math>(4~5).</math> This follows because an arbitrary transposition can be expressed as the product of adjacent transpositions. Concretely, one can express the transposition <math>(k~~l)</math> where <math>k < l</math> by moving ''k'' to ''l'' one step at a time, then moving ''l'' back to where ''k'' was, which interchanges these two and makes no other changes:

			:<math>(k~~l) = (k~~k+1)\cdot(k+1~~k+2)\cdots(l-1~~l)\cdot(l-2~~l-1)\cdots(k~~k+1).</math>

			The decomposition of a permutation into a product of transpositions is obtained for example by writing the permutation as a product of disjoint cycles, and then splitting iteratively each of the cycles of length 3 and longer into a product of a transposition and a cycle of length one less:

			:<math>(a,b,c,d,\ldots,y,z) = (a,b)\cdot (b,c,d,\ldots y,z)</math>

			This means the initial request is to move <math>a</math> to <math>b</math>, <math>b</math> to <math>c</math>, <math>y</math> to <math>z</math> and finally <math>z</math> to <math>a</math>. Instead one may roll the elements keeping <math>a</math> where it is by executing the right factor first (as usual in operator notation, and following the convention in the article on [[Permutation#Product and inverse\|Permutations]]). This has moved <math>z</math> to the position of <math>b</math>, so after the first permutation, the elements <math>a</math> and <math>z</math> are not yet at their final positions. The transposition <math>(a,b)</math>, executed thereafter, then addresses <math>z</math> by the index of <math>b</math> to swap what initially were <math>a</math> and <math>z</math>.

			In fact, the [[symmetric group]] is a [[Coxeter group]], meaning that it is generated by elements of order 2 (the adjacent transpositions), and all relations are of a certain form.

			One of the main results on symmetric groups states that either all of the decompositions of a given permutation into transpositions have an even number of transpositions, or they all have an odd number of transpositions, that allows to define the [[parity of a permutation]].

			== See also ==
			* [[Cycle detection]] – the algorithmic problem of finding a cycle in a sequence of iterated function values.
			* [[Cycle sort]] – a sorting algorithm that is based on the idea that the permutation to be sorted can be factored into cycles, which can individually be rotated to give a sorted result
			* [[Cycles and fixed points]]
			* [[Dihedral group]]
			* [[Fifteen puzzle]]

			== External links ==
			* [http://www.cut-the-knot.org/Curriculum/Combinatorics/PermByTrans.shtml Permutations as a Product of Transpositions]

			== References ==
			* Anderson, Marlow and Feil, Todd (2005), ''A First Course in Abstract Algebra'', Chapman & Hall/CRC; 2nd edition. ISBN 1-58488-515-7.
			*{{citation\|first=John\|last=Fraleigh\|authorlink=\|title=A first course in abstract algebra\|edition=7th\|year=2002\|publisher=Addison Wesley\|isbn=978-0-201-76390-4}}

			{{PlanetMath attribution\|id=2262\|title=cycle}}

			{{DEFAULTSORT:Cycle (Mathematics)}}
			[[Category:Algebra]]
			[[Category:Permutations]]

129.120.41.191: /* Statement of the theorem */

2012-05-26T19:42:57Z

Statement of the theorem

New page

Hello. Let me introduce the author. Her title is Refugia Shryock. My working day job is a librarian. South Dakota is exactly where me and my husband reside and my family members enjoys it. One of the things he enjoys most is ice skating but he is having difficulties to find time for it.<br><br>Also visit my web blog: [http://vip.akwacity.com/oxwall/blogs/post/10278 over the counter std test]