Dependency relation - Revision history

en>Mark viking: /* top */ Added wl, removed informal 'clearly'

2015-01-10T05:55:46Z

top: Added wl, removed informal 'clearly'

← Older revision		Revision as of 07:55, 10 January 2015
Line 1:		Line 1:
	~~In the metrical theory of [[continued fraction\|regular continued fractions]], the ''k''th '''complete quotient''' ζ<sub> ''k''</sub>~~ is ~~obtained by ignoring the first ''k'' partial denominators ''a''<sub>''i''</sub>~~. ~~For example, if a regular continued fraction~~ is ~~given by~~		Wilber Berryhill is what his spouse enjoys to call him and he totally enjoys this name. North Carolina is where we've been living for years and will by no means move. It's not a typical thing but what I like doing is to climb but I don't have the time recently. Credit authorising is how she makes a living.<br><br>Here is my webpage: clairvoyance ([http://www.skullrocker.com/blogs/post/10991 simply click the following web site])

	~~:<math>~~
	~~x = [a_0; a_1, a_2, a_3, \dots] = a_0 + \cfrac{1}{a_1 + \cfrac{1}{a_2 + \cfrac{1}{a_3 + \cfrac{1}{\ddots}}}},~~
	~~</math>~~

	~~then the successive complete quotients ζ<sub> ~~'~~'k''</sub> are given~~ by

	~~:<math>~~
	~~\begin{align}~~
	~~\zeta_0 & = [a_0; a_1, a_2, a_3, \dots]\\~~
	~~\zeta_1 & = [a_1; a_2, a_3, a_4, \dots]\\~~
	~~\zeta_2 & = [a_2; a_3, a_4, a_5, \dots]\\~~
	~~\zeta_k & = [a_k; a_{k+1}, a_{k+2}, a_{k+3}, \dots]. \,~~
	~~\end{align}~~
	~~</math>~~

	~~==A recursive relationship==~~
	~~From the definition given above we can immediately deduce that~~

	~~:<math>~~
	~~\zeta_k = a_k + \frac{1}{\zeta_{k+1}} = [a_k; \zeta_{k+1}], \,~~
	~~</math>~~

	~~or, equivalently,~~

	~~:<math>~~
	~~\zeta_{k+1} = \frac{1}{\zeta_k - a_k}~~.\,
	~~</math>~~

	~~==Complete quotients and the convergents of~~ '~~'x''==~~

	~~Denoting the successive [[convergent (continued fraction)\|convergent]]~~s ~~of the regular continued fraction ''x'' = [''~~a''<sub>0</sub>; ''a''<sub>1</sub>, ''a''<sub>2</sub>, …] by ''A''<sub>0</sub>, ''A''<sub>1</sub>/''B''<sub>1</sub>, ''A''<sub>2</sub>/''B''<sub>2</sub>, … (as explained more fully in the article [[fundamental recurrence formulas]]), it can be shown that

	~~:<math>~~
	~~x = \frac{A_k \zeta_{k+1} + A_{k-1}}{B_k \zeta_{k+1} + B_{k-1}}\,~~
	~~</math>~~

	~~for all ''k'' ≥ 0.~~

	~~This result can be better understood by recalling that the successive convergents of an infinite regular continued fraction approach the value ''x'' in a sort of zig-zag pattern:~~

	~~:<math>~~
	~~A_0 < \frac{A_2}{B_2} < \frac{A_4}{B_4} < \cdots < \frac{A_{2n}}{B_{2n}} < x~~
	~~< \frac{A_{2n+1}}{B_{2n+1}} < \cdots < \frac{A_5}{B_5} < \frac{A_3}{B_3} < \frac{A_1}{B_1}.\,~~
	~~</math>~~

	~~so that when ''k''~~ is ~~even we have ''A''<sub>''k''</sub>/''B''<sub>''k'~~'~~</sub> < ''x'' < ''A''<sub>''k''+1</sub>/''B''<sub>''k''+1</sub>, and when ''k'' is odd we~~ have ~~''A''<sub>''k''+1</sub>/''B''<sub>''k''+1</sub> < ''x'' < ''A''<sub>''k''</sub>/''B''<sub>''k''</sub>~~. ~~In either case, the ''k'' + 1st complete quotient ζ<sub> ''k''+1</sub>~~ is ~~the unique real number that expresses ''x'' in the form of~~ a ~~[[continued fraction#Semiconvergents\|semiconvergent]]~~.

	~~==Complete quotients and equivalent real numbers==~~
	~~===An equivalence relation defined by LFTs===~~

	~~Consider the set of [[linear fractional transformation]]s (LFTs) defined by~~

	:<~~math~~>
	~~f(x) = \frac{a + bx}{c + dx}\,~~
	<~~/math~~>

	~~where ''a'', ''b'', ''c'', and ''d'' are [[integer]]s, and ''ad'' − ''bc'' = ±1. Since this set of LFTs contains an identity element (0 + ''x'')/1, and since it~~ is ~~closed under [[composition of functions]], and every member of the set has an inverse in the set, these LFTs form a [[group (mathematics)\|group]]~~ (~~the group operation being composition of functions),~~ [~~[Modular group\|GL(2,'''Z''')]].~~

	We can define an [[equivalence relation]] on the set of [[real number]]s by means of this group of linear fractional transformations. We will say that two real numbers ''x'' and ''y'' are equivalent (written ''x'' ~ ''y'') if

	:~~<math>~~
	~~y = f(x) = \frac{a + bx}{c + dx}\,~~
	</~~math>~~

	~~for some integers ''a'', ''b'', ''c'', and ''d'' such that ''ad'' − ''bc'' = ±1.~~

	Clearly this relation is symmetric, reflexive, and transitive, so it is an equivalence relation and it can be used to separate the real numbers into [[equivalence class]]es. All the [[rational number]]s are equivalent, because each rational number is equivalent to zero. What can be said about the [[irrational number]]s? Do they also fall into a single equivalence class?

	~~===A theorem about "equivalent" irrational numbers===~~

	Amazingly enough, two irrational numbers ''x'' and ''y'' are equivalent under this scheme if and only if the infinitely long "tails" in their expansions as regular continued fractions are exactly the same. ~~More precisely, the following theorem can be proved~~.

	Let ''x'' and ''y'' be two irrational (real) numbers, and let the ''k''th complete quotient in the regular continued fraction expansions of ''x'' and ''y'' be denoted by ζ<sub> ''k''</sub> and ψ<sub> ''k''</~~sub>, respectively, Then ''x'' ~ ''y'' (under the equivalence defined in the preceding section) if and only if there are positive integers ''m'' and ''n'' such that ζ<sub> ''m''<~~/~~sub> = ψ<sub> ''n''<~~/~~sub>.~~

	~~===An example===~~

	~~The [[golden ratio]] φ is~~ the ~~irrational number with the very simplest possible expansion as a regular continued fraction: φ = [1; 1, 1, 1, …~~]~~. The theorem tells us first that if ''x'' is any real number whose expansion as a regular continued fraction contains the infinite string~~
	~~[1, 1, 1, 1, …], then there are integers ''a'', ''b'', ''c'', and ''d'' (with ''ad'' − ''bc'' = ±1~~) ~~such that~~

	~~:<math>~~
	~~x = \frac{a + b\phi}{c + d\phi}.\,~~
	~~</math>~~

	Conversely, if ''a'', ''b'', ''c'', and ''d'' are integers (with ''ad'' − ''bc'' = ±1), then the regular continued fraction expansion of every real number ''y'' that can be expressed in the form

	~~:<math>~~
	~~y = \frac{a + b\phi}{c + d\phi}\,~~
	~~</math>~~

	~~eventually reaches a "tail" that looks just like the regular continued fraction for φ.~~

	~~==References==~~
	*{{cite book\|last1 = Rockett\|first1 = Andrew M.\|last2 = Szüsz \| first2 = Peter\|title = Continued Fractions\|publisher = World Scientific\|year = 1992\|pages = 4–8\|isbn = 981-02-1052-3}}

	~~[[Category:Continued fractions]]~~

en>Homei at 09:17, 24 June 2013

2013-06-24T09:17:02Z

← Older revision		Revision as of 11:17, 24 June 2013
Line 1:		Line 1:
	~~The writer~~ is ~~called Wilber Pegues~~. ~~Ohio is where her home~~ is. ~~One of~~ the ~~issues she enjoys most is canoeing~~ and ~~she~~'s ~~been doing~~ it for ~~quite~~ a ~~whilst~~. ~~Office supervising~~ is ~~where her main earnings comes from but she~~'~~s currently applied for another one~~.<br><br>~~Here~~ is ~~my webpage email psychic readings -~~ [~~http~~://~~www~~.~~onbizin~~.co.kr/xe/~~?document_srl~~=~~320614 onbizin~~.co.kr],		In the metrical theory of [[continued fraction\|regular continued fractions]], the ''k''th '''complete quotient''' ζ<sub> ''k''</sub> is obtained by ignoring the first ''k'' partial denominators ''a''<sub>''i''</sub>. For example, if a regular continued fraction is given by

			:<math>
			x = [a_0; a_1, a_2, a_3, \dots] = a_0 + \cfrac{1}{a_1 + \cfrac{1}{a_2 + \cfrac{1}{a_3 + \cfrac{1}{\ddots}}}},
			</math>

			then the successive complete quotients ζ<sub> ''k''</sub> are given by

			:<math>
			\begin{align}
			\zeta_0 & = [a_0; a_1, a_2, a_3, \dots]\\
			\zeta_1 & = [a_1; a_2, a_3, a_4, \dots]\\
			\zeta_2 & = [a_2; a_3, a_4, a_5, \dots]\\
			\zeta_k & = [a_k; a_{k+1}, a_{k+2}, a_{k+3}, \dots]. \,
			\end{align}
			</math>

			==A recursive relationship==
			From the definition given above we can immediately deduce that

			:<math>
			\zeta_k = a_k + \frac{1}{\zeta_{k+1}} = [a_k; \zeta_{k+1}], \,
			</math>

			or, equivalently,

			:<math>
			\zeta_{k+1} = \frac{1}{\zeta_k - a_k}.\,
			</math>

			==Complete quotients and the convergents of ''x''==

			Denoting the successive [[convergent (continued fraction)\|convergent]]s of the regular continued fraction ''x'' = [''a''<sub>0</sub>; ''a''<sub>1</sub>, ''a''<sub>2</sub>, …] by ''A''<sub>0</sub>, ''A''<sub>1</sub>/''B''<sub>1</sub>, ''A''<sub>2</sub>/''B''<sub>2</sub>, … (as explained more fully in the article [[fundamental recurrence formulas]]), it can be shown that

			:<math>
			x = \frac{A_k \zeta_{k+1} + A_{k-1}}{B_k \zeta_{k+1} + B_{k-1}}\,
			</math>

			for all ''k'' ≥ 0.

			This result can be better understood by recalling that the successive convergents of an infinite regular continued fraction approach the value ''x'' in a sort of zig-zag pattern:

			:<math>
			A_0 < \frac{A_2}{B_2} < \frac{A_4}{B_4} < \cdots < \frac{A_{2n}}{B_{2n}} < x
			< \frac{A_{2n+1}}{B_{2n+1}} < \cdots < \frac{A_5}{B_5} < \frac{A_3}{B_3} < \frac{A_1}{B_1}.\,
			</math>

			so that when ''k'' is even we have ''A''<sub>''k''</sub>/''B''<sub>''k''</sub> < ''x'' < ''A''<sub>''k''+1</sub>/''B''<sub>''k''+1</sub>, and when ''k'' is odd we have ''A''<sub>''k''+1</sub>/''B''<sub>''k''+1</sub> < ''x'' < ''A''<sub>''k''</sub>/''B''<sub>''k''</sub>. In either case, the ''k'' + 1st complete quotient ζ<sub> ''k''+1</sub> is the unique real number that expresses ''x'' in the form of a [[continued fraction#Semiconvergents\|semiconvergent]].

			==Complete quotients and equivalent real numbers==
			===An equivalence relation defined by LFTs===

			Consider the set of [[linear fractional transformation]]s (LFTs) defined by

			:<math>
			f(x) = \frac{a + bx}{c + dx}\,
			</math>

			where ''a'', ''b'', ''c'', and ''d'' are [[integer]]s, and ''ad'' − ''bc'' = ±1. Since this set of LFTs contains an identity element (0 + ''x'')/1, and since it is closed under [[composition of functions]], and every member of the set has an inverse in the set, these LFTs form a [[group (mathematics)\|group]] (the group operation being composition of functions), [[Modular group\|GL(2,'''Z''')]].

			We can define an [[equivalence relation]] on the set of [[real number]]s by means of this group of linear fractional transformations. We will say that two real numbers ''x'' and ''y'' are equivalent (written ''x'' ~ ''y'') if

			:<math>
			y = f(x) = \frac{a + bx}{c + dx}\,
			</math>

			for some integers ''a'', ''b'', ''c'', and ''d'' such that ''ad'' − ''bc'' = ±1.

			Clearly this relation is symmetric, reflexive, and transitive, so it is an equivalence relation and it can be used to separate the real numbers into [[equivalence class]]es. All the [[rational number]]s are equivalent, because each rational number is equivalent to zero. What can be said about the [[irrational number]]s? Do they also fall into a single equivalence class?

			===A theorem about "equivalent" irrational numbers===

			Amazingly enough, two irrational numbers ''x'' and ''y'' are equivalent under this scheme if and only if the infinitely long "tails" in their expansions as regular continued fractions are exactly the same. More precisely, the following theorem can be proved.

			Let ''x'' and ''y'' be two irrational (real) numbers, and let the ''k''th complete quotient in the regular continued fraction expansions of ''x'' and ''y'' be denoted by ζ<sub> ''k''</sub> and ψ<sub> ''k''</sub>, respectively, Then ''x'' ~ ''y'' (under the equivalence defined in the preceding section) if and only if there are positive integers ''m'' and ''n'' such that ζ<sub> ''m''</sub> = ψ<sub> ''n''</sub>.

			===An example===

			The [[golden ratio]] φ is the irrational number with the very simplest possible expansion as a regular continued fraction: φ = [1; 1, 1, 1, …]. The theorem tells us first that if ''x'' is any real number whose expansion as a regular continued fraction contains the infinite string
			[1, 1, 1, 1, …], then there are integers ''a'', ''b'', ''c'', and ''d'' (with ''ad'' − ''bc'' = ±1) such that

			:<math>
			x = \frac{a + b\phi}{c + d\phi}.\,
			</math>

			Conversely, if ''a'', ''b'', ''c'', and ''d'' are integers (with ''ad'' − ''bc'' = ±1), then the regular continued fraction expansion of every real number ''y'' that can be expressed in the form

			:<math>
			y = \frac{a + b\phi}{c + d\phi}\,
			</math>

			eventually reaches a "tail" that looks just like the regular continued fraction for φ.

			==References==
			*{{cite book\|last1 = Rockett\|first1 = Andrew M.\|last2 = Szüsz \| first2 = Peter\|title = Continued Fractions\|publisher = World Scientific\|year = 1992\|pages = 4–8\|isbn = 981-02-1052-3}}

			[[Category:Continued fractions]]

en>Yobot: /* Examples */WP:CHECKWIKI error 22 fixes (category with space) + general fixes using AWB (7799)

2011-07-29T11:36:12Z

Examples: WP:CHECKWIKI error 22 fixes (category with space) + general fixes using AWB (7799)

New page

The writer is called Wilber Pegues. Ohio is where her home is. One of the issues she enjoys most is canoeing and she's been doing it for quite a whilst. Office supervising is where her main earnings comes from but she's currently applied for another one.<br><br>Here is my webpage email psychic readings - [http://www.onbizin.co.kr/xe/?document_srl=320614 onbizin.co.kr],