en>Rgdboer: See talk Undid revision 633020664 by 73.184.19.215 (talk)

2014-11-09T00:56:16Z

See talk Undid revision 633020664 by 73.184.19.215 (talk)

← Older revision		Revision as of 02:56, 9 November 2014
Line 1:		Line 1:
	~~{{for\|the theorem in linear algebra\|Rouché–Capelli theorem}}~~		52 year old Florist Bradly from Delta, likes to spend some time pottery, new launch property singapore and educational courses. Finds the globe an fascinating place having spent 4 weeks at Group of Monuments at Mahabalipuram.<br><br>Also visit my web-site: [http://www.worldwidesoccerfans.com/index.php?do=/blog/6166/benefits-of-hiring-property-management-services/ www.worldwidesoccerfans.com]
	~~'''Rouché's theorem'''~~, named after {{Link-interwiki\|en=Eugène Rouché\|lang=fr}}, states that if the [[complex number\|complex]]-valued [[function (mathematics)\|functions]] ''f'' and ''g'' are [[Holomorphic function\|holomorphic]] inside and on some ~~closed contour ''K''~~, ~~with \|''g''(''z'')\| < \|''f''(''z'')\| on ''K'', then ''f''~~ and ~~''f'' + ''g'' have the same number of zeros inside ''K'', where each zero is counted as many times as its [[Multiplicity (mathematics)\|multiplicity]]~~. ~~This theorem assumes that~~ the ~~contour ''K'' is simple, that is, without self-intersections. Rouché's theorem is~~ an ~~easy consequence~~ of ~~a stronger Symmetric Rouché's theorem described below.~~

	~~== Symmetric version ==~~

	[[Theodor Estermann]] (1902–1991) proved in his book ''Complex Numbers and Functions'' the following relation: Let <math>K\subset G</math> be a bounded region with continuous boundary <math>\partial K</math>. Two holomorphic functions <math>f,\,g\in\mathcal H(G)</math> have the same number of roots in <math>K</math>, if the strict inequality

	~~:<math>\|f(z)-g(z)\|< \|f(z)\|+\|g(z)\| \qquad \left(z\in \partial K\right)</math>~~

	~~holds on the boundary <math>\partial K</math>.~~

	~~The original Rouché's theorem then follows by setting <math>f(z):=f(z)+g(z)</math> and <math>g(z):=f(z)</math>.~~

	~~== Usage ==~~

	The theorem is usually used to simplify the problem of locating zeros, as follows. Given an analytic function, we write it as the sum of two parts, one of which is simpler and grows faster than (thus dominates) the other part. We can then locate the zeros by looking at ~~only the dominating part~~. ~~For example, the polynomial <math>z^5 + 3z^3 + 7</math> has exactly 5 zeros in the disk <math>\|z\| < 2</math> since <math>\|3z^3 + 7\| < 32 = \|z^5\|</math> for every <math>\|z\| = 2</math>, and~~ <~~math~~>~~z^5~~<~~/math~~>~~, the dominating part, has five zeros in the disk.~~

	~~== Geometric explanation ==~~
	~~[[Image:rouche~~-~~thm.png\|thumb\|300px\|right\|Since the ''distance'' between the curves is ''small'', ''h''(''z'') does exactly one turn around just as ''f''(''z'') does.]]~~

	~~It is possible to provide an informal explanation of Rouche's theorem.~~

	Let ''C'' be a closed, simple curve (i.e., not self-intersecting). Let ''h''(''z'') = ''f''(''z'') + ''g''(''z''). If ''f'' and ''g'' are both holomorphic on the interior of ''C'', then ''h'' must also be holomorphic on the interior of ''C''. Then, with the conditions imposed above, the Rouche's theorem in its original (and not symmetric) form says that

	: ~~If \|''f''(''z'')\| > \|''h''(''z'') − ''f''(''z'')\|, for every ''z'' in ''C,'' then ''f''(''z'') and ''h''(''z'') have the same number of zeros in the interior of ''C''.~~

	Notice that the condition \|''f''(''z'')\| > \|''h''(''z'') − ''f''(''z'')\| means that for any ''z'', the distance from ''f''(''z'') to the origin is larger than the length of ''h''(''z'') − ''f''(''z''), which in the following picture means that for each point on the blue curve, the segment joining it to the origin is larger than the green segment associated with it. Informally we can say that the blue curve ''f''(''z'') is always closer to the red curve ''h''(''z'') than it is to the origin.

	~~The previous paragraph shows that ''h''(''z'') must wind around the origin exactly as many times as ''f''(''z''). The index of both curves around zero is therefore the same, so by the~~ [~~[argument principle]], ''f''(''z'') and ''h''(''z'') must have the same number of zeros inside ''C''.~~

	~~One popular, informal way to summarize this argument is as follows~~: If a person were to walk a dog on a leash around and around a tree, and if the length of the leash is less than the minimum radius of the walk, then the person and the dog go around the tree an equal number of times.

	~~== Applications ==~~
	~~{{see also\|Properties of polynomial_roots#Bounds on (complex) polynomial roots}}~~
	~~Consider the polynomial <math>z^2 + 2az + b^2</math> (where <math>a > b > 0<~~/~~math>). By the [[quadratic formula]] it has two zeros at <math>-a \pm \sqrt{a^2 - b^2}<~~/~~math>~~. ~~Rouché's theorem can be used to obtain more precise positions of them~~. ~~Since~~
	~~:<math>\|z^2 + b^2\| \le 2b^2 < 2a\|z\|<~~/~~math> for every <math>\|z\| = b</math>,~~
	~~Rouché's theorem says that the polynomial has exactly one zero inside the disk <math>\|z\| < b</math>~~. Since <math>a + \sqrt{a^2 - b^2}</math> is clearly outside the disk, we conclude that the zero is <math>a - \sqrt{a^2 - b^2}</math>. This sort of arguments can be useful in locating residues when one applies Cauchy's [[Residue theorem]].

	~~Rouché's theorem can also be used to give a short proof of the [[Fundamental Theorem of Algebra]]. Let~~

	~~: <math>p(z) = a_0 + a_1z + a_2 z^2 + \cdots + a_n z^n, \quad a_n \ne 0\, </math>~~

	~~and choose <math>R>0</math> so large that:~~

	~~:<math>\|a_0 + a_1z + \cdots + a_{n-1}z^{n-1}\| \le \sum_{j=0}^{n - 1} \|a_j\| R^{n-1} < \|a_n\|R^n = \|a_n z^n\|\text{ for }\|z\| = R.</math>~~

	Since <math>a_n z^n</math> has <math>n</math> zeros inside the disk <math>\|z\| < R</math> (because <math>R>0</math>), it follows from Rouché's theorem that <math>p</math> also has the same number of zeros inside the disk.

	~~One advantage of this proof over the others is that it shows not only that a polynomial must have a zero but the number of its zeros is equal to its degree (counting, as usual, multiplicity).~~

	~~Another use of Rouché's theorem is to prove the [[open mapping theorem (complex analysis)\|open mapping theorem]] for analytic functions. We refer to the article for the proof.~~

	~~==Proof of symmetric form of Rouché's theorem==~~
	~~The hypothesis ensures both that <math>f</math> and <math>g</math>~~ do ~~not have any roots on the boundary <math>\partial K</math> and that <math>\frac {f(z)}{g(z)}</math> is not a negative real number for <math>z \in \partial K</math>. Thus the [[homotopy]]~~
	~~:<math>I(t):=\frac 1 {2 \pi i} \oint_{\partial K} \frac{F'(z)}{F(z)+t}dz </math>~~
	~~is well defined for <math>t\ge 0</math>, where <math>F(z):=\frac {f(z)}{g(z)}</math>.~~

	~~Clearly, <math>I(t) \to 0</math> as <math>t \to \infty</math>. As <math>I(t)</math> is continuous and integer valued, it follows that <math>I(0)=0</math>.~~
	~~By the [[argument principle]], this winding number is given by~~

	~~:<math>0 = \frac{1}{2\pi i}\oint_{\partial K} {F'(z) \over F(z)}\,dz~~ = ~~N_F(K)-P_F(K)</math>~~

	~~where ''N''<sub>''F''</sub>(''K'') is the number of zeros of ''F'' inside ''K'', ''P''<sub>''F''<~~/~~sub>(''K'') is the number of poles inside ''K''. Hence ''N''<sub>''F''<~~/~~sub> = ''P''<sub>''F''<~~/sub>. But ''F'' is the ratio of two holomorphic functions ''f'' and ''g'' inside ''K'', and so the zeros are those of ''f'' and the poles are the zeros of ''g'' (after canceling out the common zeros of ''f'' and ''g''). That is,

	~~:<math>0=N_F(K)~~ - ~~P_F(K) = N_{f}(K) - N_g(K),\,</math>~~

	~~as required.~~

	~~==See also==~~
	* [[Hurwitz's theorem (complex analysis)]]
	* [[Sturm's theorem]]
	* [[Rational root theorem]]
	* [[Properties of ~~polynomial roots]]~~
	* [[Riemann mapping theorem]]

	~~==References==~~
	* {{cite book \| first=Alan \| last=Beardon \| title=Complex Analysis: the Winding Number principle in analysis and topology \| publisher=John Wiley and Sons \| page=131 \| year=1979 \| isbn=0-471-99672-~~6 }}~~
	* {{cite book \| first=E. C. \| last=Titchmarsh \| title=The Theory of Functions \| edition=2nd \| publisher=Oxford University Press \| year=1939 \| isbn=0-19-~~853349~~-~~7 \| pages=117–119,198–203 \| authorlink=Edward Charles Titchmarsh }}~~

	~~==External links==~~
	~~[http://math.fullerton.edu~~/~~mathews/c2003/RoucheTheoremMod~~.~~html Module for Rouche’s Theorem by John H~~. ~~Mathews]~~

	~~{{DEFAULTSORT:Rouche's theorem}}~~
	~~[[Category:Articles containing proofs]]~~
	~~[[Category:Theorems in complex analysis]~~]

en>Thirteenangrymen: /* History */ grammar

2013-12-21T15:10:45Z

History: grammar

Show changes

76.120.181.41: edit

2012-08-06T21:23:17Z

edit

New page

For your offense, you might contain Gunboats which can easily shoot at enemy safeguarding coming from a long range and Landing Projects which you must seal when you train pieces for example Rifleman, Heavy, Zooka, Warrior and Tanks. To your village defenses, you might possess structures like Mortar, Hardware Gun, Sniper Tower, Cannon, Flamethrower, Mine, Tank Mine, Boom Cannon and Bomb Launcher to assist families eradicate enemies. when you are locating a definite handle system tough to successfully use, optimize the places within your activity. The default manage platform might not be on everyone. Some an individual prefer a better display screen, a set within more sensitive management along with perhaps an inverted structure. In several on the net gaming, you may regulation these from the setting's area. Pay attention to a game's evaluation when purchasing an ongoing. This evaluation will allow you find out what age level clash of clans hack tool is most suitable for and will reveal to you when the sport would be violent. It can help you figure out whether you'll want to buy the sport. So if you feel like users targeted your enemy spot on in a shooter and still missed, inspection what weapon you are using. Just like in real life, unusual weapons have different benefits and weaknesses. All of the weapon you are the application of may not have the entire short distance required aka the weapon recoil is actually putting you a little bit off target. Your dog's important to agenda the actual apple is consistently attach from association war dilemmas because association wars end up being fought inside a become different breadth absolutely -- this war zone. Into the war region, individuals adapt and advance warfare bases instead of agreed on villages; therefore, your communities resources, trophies, and absorber are never in danger. By - borer on a boondocks anteroom you possibly can now appearance added advice with regard to that play, scout, [http://www.Thefreedictionary.com/entente entente] troops, or attack. Of course, these accomplishments will rely on what appearance of the hostilities you might be found in. If you have any concerns relating to where by along with the best way to use clash of clans hack android ([http://circuspartypanama.com navigate to this web-site]), it is possible to email us on our web-site. Try to restrain your major gaming to only an individual kind of machine. Buying all the fundamental consoles plus a gaming-worthy personal computer can demand up to thousands, just in hardware. Yet, most big titles are going to be available on near all of them. Choose one platform to stick with for reduction.

Hyperbolic angle - Revision history

en>Rgdboer: See talk Undid revision 633020664 by 73.184.19.215 (talk)

en>Thirteenangrymen: /* History */ grammar

76.120.181.41: edit