Root locus: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Zfeinst
 
en>Glrx
Undid revision 592604661 by 180.151.93.34 (talk) earlier seems better
Line 1: Line 1:
It is time to address the slow computer issues even if we do not know how. Just considering a computer is functioning thus slow or keeps freezing up; refuses to imply that you can not address the problem plus fix it. You may or can not be aware which any computer owner should understand which there are certain factors which a computer requires to maintain the number one performance. The sad truth is that so many people who own a program have no idea which it requires routine maintenance really like their cars.<br><br>You should recognize some convenient and inexpensive techniques that may resolve the problem of the computer plus speed it up. The earlier you fix it, the less damage your computer gets. I may tell about several helpful techniques which will assist we to speed up we computer.<br><br>It doesn't matter whether you're not truly clear about what rundll32.exe is. However remember which it plays an significant role inside sustaining the stability of our computers and the integrity of the system. Whenever certain software or hardware couldn't reply usually to the system procedure, comes the rundll32 exe error, which could be caused by corrupted files or lost information inside registry. Usually, error content may shows up at booting or the beginning of running a system.<br><br>Your computer was very quick whenever we first purchased it. Because your registry was surprisingly clean and free of errors. After time, the computer begins to run slow and freezes up now plus then. Because there are errors accumulating in it and some info is rewritten or completely deleted by your wrong uninstall of programs, improper operations, malware or alternative aspects. That is the reason why your computer performance decreases gradually plus become surprisingly unstable.<br><br>So to fix this, we simply should be able to create all the registry files non-corrupted again. This can dramatically accelerate the loading time of the computer plus allows we to a large amount of aspects on it again. And fixing these files couldn't be easier - you simply require to utilize a tool called a [http://bestregistrycleanerfix.com/tune-up-utilities tuneup utilities].<br><br>Another element is registry. It is one of the many important piece in a Windows XP, Vista running systems. When Windows begin up, it read connected information from registry and load into computer RAM. This takes up a big part of the startup time. After the information is all loaded, computer runs the startup programs.<br><br>Most likely should you are experiencing a slow computer it can be a couple years older. We additionally will not have been told which while we utilize a computer everyday; there are certain elements that it needs to continue running inside its best performance. We additionally can not even own any diagnostic tools which usually get your PC running like brand-new again. Well do not let that stop we from getting a program cleaned. With access to the web you will find the tools that will help you receive the system running like fresh again.<br><br>There is a lot a superior registry cleaner could do for the computer. It will check for plus download updates for Windows, Java and Adobe. Keeping updates present is an important part of good computer wellness. It could moreover protect a individual and company confidentiality and also your online safety.
{{about|algebraic geometry|the concept in graph theory|Intersection number (graph theory)}}
In [[mathematics]], and especially in [[algebraic geometry]], the '''intersection number''' generalizes the intuitive notion of counting the number of times two curves intersect to higher dimensions, multiple (more than 2) curves, and accounting properly for [[tangent|tangency]]. One needs a definition of intersection number in order to state results like [[Bézout's theorem]].
 
The intersection number is obvious in certain cases, such as the intersection of ''x''- and ''y''-axes which should be one. The complexity enters when calculating intersections at points of tangency and intersections along positive dimensional sets. For example if a plane is tangent to a surface along a line, the intersection number along the line should be at least two. These questions are discussed systematically in [[intersection theory]].
 
== Definition for Riemann surfaces ==
 
Let ''X'' be a [[Riemann surface]]. Then the intersection number of two closed curves on ''X'' has a simple definition in terms of an integral. For every closed curve ''c'' on ''X'' (i.e., smooth function <math>c : S^1 \to X</math>), we can associate a [[differential form]] <math>\eta_c</math> with the pleasant property that integrals along ''c'' can be calculated by integrals over ''X'':
 
:<math>\int_c \alpha = -\int \int_X \alpha \wedge \eta_c = (\alpha, *\eta_c)</math>, for every closed (1-)differential <math>\alpha</math> on ''X'',
 
where <math>\wedge</math> is the [[wedge product]] of differentials, and <math>*</math> is the [[hodge star]]. Then the intersection number of two closed curves, ''a'' and ''b'', on ''X'' is defined as
 
:<math>a \cdot b := \int \int_X \eta_a \wedge \eta_b = (\eta_a, -*\eta_b) = -\int_b \eta_a</math>.
 
The <math>\eta_c</math> have an intuitive definition as follows. They are a sort of [[dirac delta]] along the curve ''c'', accomplished by taking the differential of a [[unit step function]] that drops from 1 to 0 across ''c''. More formally, we begin by defining for a simple closed curve ''c'' on ''X'', a function ''f<sub>c</sub>'' by letting <math>\Omega</math> be a small strip around ''c'' in the shape of an annulus. Name the left and right parts of <math>\Omega \setminus c</math> as <math>\Omega^{+}</math> and <math>\Omega^{-}</math>. Then take a smaller sub-strip around ''c'', <math>\Omega_0</math>, with left and right parts <math>\Omega_0^{-}</math> and <math>\Omega_0^{+}</math>. Then define ''f<sub>c</sub>'' by
 
:<math>f_c(x) = \begin{cases} 1, & x \in \Omega_0^{-} \\ 0, & x \in X \setminus \Omega^{-} \\ \mbox{smooth interpolation}, & x \in \Omega^{-} \setminus \Omega_0^{-} \end{cases}</math>.
 
The definition is then expanded to arbitrary closed curves. Every closed curve ''c'' on ''X'' is [[Homology (mathematics)|homologous]] to <math>\sum_{i=1}^N k_i c_i</math> for some simple closed curves ''c<sub>i</sub>'', that is,
 
:<math>\int_c \omega = \int_{\sum_i k_i c_i} \omega = \sum_{i=1}^N k_i \int_{c_i} \omega</math>, for every differential <math>\omega</math>.
 
Define the <math>\eta_c</math> by
 
:<math>\eta_c = \sum_{i=1}^N k_i \eta_{c_i}</math>.
 
== Definition for algebraic varieties ==
 
The usual constructive definition in the case of algebraic varieties proceeds in steps. The definition given below is for the intersection number of [[Divisor (algebraic geometry)|divisor]]s on a nonsingular variety ''X''.
 
1. The only intersection number that can be calculated directly from the definition is the intersection of hypersurfaces (subvarieties of ''X'' of codimension one) that are in general position at ''x''. Specifically, assume we have a nonsingular variety ''X'', and ''n'' hypersurfaces ''Z''<sub>''1''</sub>, ..., ''Z''<sub>''n''</sub> which have local equations ''f''<sub>''1''</sub>, ..., ''f''<sub>''n''</sub> near ''x'' for polynomials ''f''<sub>''i''</sub>(''t''<sub>''1''</sub>, ..., ''t''<sub>''n''</sub>), such that the following hold:
 
* <math>n = \dim_k X</math>.
* <math>f_i(x) = 0</math> for all ''i''. (i.e., ''x'' is in the intersection of the hypersurfaces.)
* <math>\dim_x \cap_{i=1}^n Z_i = 0</math> (i.e., the divisors are in general position.)
* The <math>f_i</math> are nonsingular at ''x''.
 
Then the intersection number at the point ''x'' is
 
:<math>(Z_1 \cdots Z_n)_x := \dim_k \mathcal{O}_{X, x} / (f_1, \dots, f_n)</math>,
 
where <math>\mathcal{O}_{X, x}</math> is the local ring of ''X'' at ''x'', and the dimension is dimension as a ''k''-vector space. It can be calculated as the [[Localization of a ring|localization]] <math>k[U]_{\mathfrak{m}_x}</math>, where <math>\mathfrak{m}_x</math> is the maximal ideal of polynomials vanishing at ''x'', and ''U'' is an open affine set containing ''x'' and containing none of the singularities of the ''f''<sub>''i''</sub>.
 
2. The intersection number of hypersurfaces in general position is then defined as the sum of the intersection numbers at each point of intersection.
 
:<math>(Z_1 \cdots, Z_n) = \sum_{x \in \cap_i Z_i} (Z_1 \cdots Z_n)_x</math>
 
3. Extend the definition to ''effective'' divisors by linearity, i.e.,
 
:<math>(n Z_1 \cdots Z_n) = n(Z_1 \cdots Z_n)</math> and <math>((Y_1 + Z_1) Z_2 \cdots Z_n) = (Y_1 Z_2 \cdots Z_n) + (Z_1 Z_2 \cdots Z_n)</math>.
 
4. Extend the definition to arbitrary divisors in general position by noticing every divisor has a unique expression as ''D'' = ''P'' - ''N'' for some effective divisors ''P'' and ''N''. So let ''D''<sub>''i''</sub> = ''P''<sub>''i''</sub> - ''N''<sub>i</sub>, and use rules of the form
 
:<math>((P_1 - N_1) P_2 \cdots P_n) = (P_1 P_2 \cdots P_n) - (N_1 P_2 \cdots P_n)</math>
 
to transform the intersection.
 
5. The intersection number of arbitrary divisors is then defined using a "[[Chow's moving lemma]]" that guarantees we can find linearly equivalent divisors that are in general position, which we can then intersect.
 
Note that the definition of the intersection number does not depend on the order of the divisors.
 
== Further definitions ==
 
The definition can be vastly generalized, for example to intersections along subvarieties instead of just at points, or to arbitrary complete varieties.
 
In algebraic topology, the intersection number appears as the Poincaré dual of the [[cup product]]. Specifically, if two manifolds, ''X'' and ''Y'', intersect transversely in a manifold ''M'', the homology class of the intersection is the [[Poincaré dual]] of the cup product <math>D_M X \smile D_M Y</math> of the Poincaré duals of ''X'' and ''Y''.
 
== Intersection multiplicities for plane curves ==
 
There is a unique function assigning to each triplet (''P'',&nbsp;''Q'',&nbsp;''p'') consisting of a pair of polynomials, ''P'' and ''Q'', in ''K''[''x'',&nbsp;''y''] and a point ''p'' in ''K''<sup>2</sup> a number ''I''<sub>''p''</sub>(''P'',&nbsp;''Q'') called the ''intersection multiplicity'' of ''P'' and ''Q'' at ''p'' that satisfies the following properties:
 
# <math>I_p(P,Q) = I_p(Q,P).\,</math>
# <math>I_p(P,Q)</math> is infinite if and only if ''P'' and ''Q'' have a common factor that is zero at ''p''.
# <math>I_p(P,Q)</math> is zero if and only if one of ''P''(''p'') or ''Q''(''p'') is non-zero (i.e. the point p is off one of the curves).
# <math>I_p(x,y) = 1</math> where the point ''p'' is at (''x'', ''y'').
# <math>I_p(P,Q_1Q_2) = I_p(P,Q_1) + I_p(P,Q_2)</math>
# <math>I_p(P + QR,Q) = I_p(P,Q)</math> for any ''R'' in ''K''[''x'', ''y'']
 
Although these properties completely characterize intersection multiplicity, in practice it is realised in several different ways.
 
One realization of intersection multiplicity is through the dimension of a certain quotient space of the power series ring ''K''[<span/>[''x'',''y'']]. By making a change of variables if necessary, we may assume that the point p is (0,0). Let ''P''(''x'',&nbsp;''y'') and ''Q''(''x'',&nbsp;''y'') be the polynomials defining the algebraic curves we are interested in. If the original equations are given in homogeneous form, these can be obtained by setting ''z'' = 1. Let ''I'' = (''P'',&nbsp;''Q'') denote the ideal of ''K''[<span/>[''x'',''y'']] generated by ''P'' and ''Q''. The intersection multiplicity is the dimension of ''K''[<span/>[''x'',&nbsp;''y'']]/''I'' as a vector space over ''K''.
 
Another realization of intersection multiplicity comes from the [[resultant]] of the two polynomials ''P'' and ''Q''. In coordinates where ''p'' is (0,0), the curves have no other intersections with ''y'' = 0, and the [[degree of a polynomial|degree]] of ''P'' with respect to x is equal to the total degree of ''P'', ''I''<sub>''p''</sub>(''P'',&nbsp;''Q'') can be defined as the highest power of ''y'' that divides the resultant of ''P'' and ''Q'' (with ''P'' and ''Q'' seen as polynomials over ''K''[''x'']).
 
Intersection multiplicity can also be realised as the number of distinct intersections that exist if the curves are perturbed slightly. More specifically, if ''P'' and ''Q'' define curves which intersect only once in the [[closure (mathematics)|closure]] of an open set U, then for a dense set of (ε,δ) in ''K''<sup>2</sup>, ''P''&nbsp;&minus;&nbsp;ε and ''Q''&nbsp;&minus;&nbsp;δ are smooth and intersect transversally (i.e. have different tangent lines) at exactly some number ''n'' points in ''U''. ''I''<sub>''p''</sub>(''P'',&nbsp;''Q'') = ''n''.
 
===Example===
Consider the intersection of the ''x''-axis with the parabola
 
:<math>y = x^2.\ </math>
 
Then
 
:<math>P = y,\ </math>
 
and
 
:<math>Q = y - x^2,\ </math>
 
so
 
: <math>I_p(P,Q) = I_p(y,y - x^2) = I_p(y,x^2) = I_p(y,x) + I_p(y,x) = 1 + 1 = 2.\,</math>
 
Thus, the intersection degree is two; it is an ordinary [[tangent|tangency]].
 
==Self-intersections==
 
Some of the most interesting intersection numbers to compute are ''self-intersection numbers''. This should not be taken in a naive sense. What is meant is that, in an equivalence class of [[divisor (algebraic geometry)|divisor]]s of some specific kind, two representatives are intersected that are in [[general position]] with respect to each other. In this way, self-intersection numbers can become well-defined, and even negative.
 
== Applications ==
 
The intersection number is partly motivated by the desire to define intersection to satisfy [[Bézout's theorem]].
 
The intersection number arises in the study [[fixed point (mathematics)|fixed point]]s, which can be cleverly defined as intersections of function [[graph of a function|graph]]s with a [[diagonal]]s. Calculating the intersection numbers at the fixed points counts the fixed points ''with multiplicity'', and leads to the [[Lefschetz fixed point theorem]] in quantitative form.
 
==References==
* {{cite book | author=William Fulton | authorlink=William Fulton (mathematician) | title=Algebraic Curves | series=Mathematics Lecture Note Series | publisher=W.A. Benjamin | year=1974 | isbn=0-8053-3082-8 | pages=74–83 }}
* {{cite book | author=Robin Hartshorne | authorlink=Robin Hartshorne | title=Algebraic Geometry | series=[[Graduate Texts in Mathematics]] | volume=52 | year=1977 | isbn=0-387-90244-9 }} Appendix A.
* {{cite book | author=William Fulton | authorlink=William Fulton (mathematician) | title=Intersection Theory| series=Mathematics Lecture Note Series | publisher=Springer | year=1998 | isbn= 0-387-98549-2, 9780387985497 }}
* ''Algebraic Curves: An Introduction To Algebraic Geometry'', by William Fulton with Richard Weiss. New York: Benjamin, 1969. Reprint ed.: Redwood City, CA, USA: Addison-Wesley, Advanced Book Classics, 1989. ISBN 0-201-51010-3. [http://www.math.lsa.umich.edu/~wfulton/CurveBook.pdf Full text online].
* {{cite book | author=Hershel M. Farkas | author=Irwin Kra | title=Riemann Surfaces | series=[[Graduate Texts in Mathematics]] | volume=71 | year=1980 | isbn=0-387-90465-4 }}
 
[[Category:Intersection theory]]

Revision as of 00:47, 28 January 2014

29 yr old Orthopaedic Surgeon Grippo from Saint-Paul, spends time with interests including model railways, top property developers in singapore developers in singapore and dolls. Finished a cruise ship experience that included passing by Runic Stones and Church. In mathematics, and especially in algebraic geometry, the intersection number generalizes the intuitive notion of counting the number of times two curves intersect to higher dimensions, multiple (more than 2) curves, and accounting properly for tangency. One needs a definition of intersection number in order to state results like Bézout's theorem.

The intersection number is obvious in certain cases, such as the intersection of x- and y-axes which should be one. The complexity enters when calculating intersections at points of tangency and intersections along positive dimensional sets. For example if a plane is tangent to a surface along a line, the intersection number along the line should be at least two. These questions are discussed systematically in intersection theory.

Definition for Riemann surfaces

Let X be a Riemann surface. Then the intersection number of two closed curves on X has a simple definition in terms of an integral. For every closed curve c on X (i.e., smooth function ), we can associate a differential form with the pleasant property that integrals along c can be calculated by integrals over X:

, for every closed (1-)differential on X,

where is the wedge product of differentials, and is the hodge star. Then the intersection number of two closed curves, a and b, on X is defined as

.

The have an intuitive definition as follows. They are a sort of dirac delta along the curve c, accomplished by taking the differential of a unit step function that drops from 1 to 0 across c. More formally, we begin by defining for a simple closed curve c on X, a function fc by letting be a small strip around c in the shape of an annulus. Name the left and right parts of as and . Then take a smaller sub-strip around c, , with left and right parts and . Then define fc by

.

The definition is then expanded to arbitrary closed curves. Every closed curve c on X is homologous to for some simple closed curves ci, that is,

, for every differential .

Define the by

.

Definition for algebraic varieties

The usual constructive definition in the case of algebraic varieties proceeds in steps. The definition given below is for the intersection number of divisors on a nonsingular variety X.

1. The only intersection number that can be calculated directly from the definition is the intersection of hypersurfaces (subvarieties of X of codimension one) that are in general position at x. Specifically, assume we have a nonsingular variety X, and n hypersurfaces Z1, ..., Zn which have local equations f1, ..., fn near x for polynomials fi(t1, ..., tn), such that the following hold:

Then the intersection number at the point x is

,

where is the local ring of X at x, and the dimension is dimension as a k-vector space. It can be calculated as the localization , where is the maximal ideal of polynomials vanishing at x, and U is an open affine set containing x and containing none of the singularities of the fi.

2. The intersection number of hypersurfaces in general position is then defined as the sum of the intersection numbers at each point of intersection.

3. Extend the definition to effective divisors by linearity, i.e.,

and .

4. Extend the definition to arbitrary divisors in general position by noticing every divisor has a unique expression as D = P - N for some effective divisors P and N. So let Di = Pi - Ni, and use rules of the form

to transform the intersection.

5. The intersection number of arbitrary divisors is then defined using a "Chow's moving lemma" that guarantees we can find linearly equivalent divisors that are in general position, which we can then intersect.

Note that the definition of the intersection number does not depend on the order of the divisors.

Further definitions

The definition can be vastly generalized, for example to intersections along subvarieties instead of just at points, or to arbitrary complete varieties.

In algebraic topology, the intersection number appears as the Poincaré dual of the cup product. Specifically, if two manifolds, X and Y, intersect transversely in a manifold M, the homology class of the intersection is the Poincaré dual of the cup product of the Poincaré duals of X and Y.

Intersection multiplicities for plane curves

There is a unique function assigning to each triplet (PQp) consisting of a pair of polynomials, P and Q, in K[xy] and a point p in K2 a number Ip(PQ) called the intersection multiplicity of P and Q at p that satisfies the following properties:

  1. is infinite if and only if P and Q have a common factor that is zero at p.
  2. is zero if and only if one of P(p) or Q(p) is non-zero (i.e. the point p is off one of the curves).
  3. where the point p is at (x, y).
  4. for any R in K[x, y]

Although these properties completely characterize intersection multiplicity, in practice it is realised in several different ways.

One realization of intersection multiplicity is through the dimension of a certain quotient space of the power series ring K[[x,y]]. By making a change of variables if necessary, we may assume that the point p is (0,0). Let P(xy) and Q(xy) be the polynomials defining the algebraic curves we are interested in. If the original equations are given in homogeneous form, these can be obtained by setting z = 1. Let I = (PQ) denote the ideal of K[[x,y]] generated by P and Q. The intersection multiplicity is the dimension of K[[xy]]/I as a vector space over K.

Another realization of intersection multiplicity comes from the resultant of the two polynomials P and Q. In coordinates where p is (0,0), the curves have no other intersections with y = 0, and the degree of P with respect to x is equal to the total degree of P, Ip(PQ) can be defined as the highest power of y that divides the resultant of P and Q (with P and Q seen as polynomials over K[x]).

Intersection multiplicity can also be realised as the number of distinct intersections that exist if the curves are perturbed slightly. More specifically, if P and Q define curves which intersect only once in the closure of an open set U, then for a dense set of (ε,δ) in K2, P − ε and Q − δ are smooth and intersect transversally (i.e. have different tangent lines) at exactly some number n points in U. Ip(PQ) = n.

Example

Consider the intersection of the x-axis with the parabola

Then

and

so

Thus, the intersection degree is two; it is an ordinary tangency.

Self-intersections

Some of the most interesting intersection numbers to compute are self-intersection numbers. This should not be taken in a naive sense. What is meant is that, in an equivalence class of divisors of some specific kind, two representatives are intersected that are in general position with respect to each other. In this way, self-intersection numbers can become well-defined, and even negative.

Applications

The intersection number is partly motivated by the desire to define intersection to satisfy Bézout's theorem.

The intersection number arises in the study fixed points, which can be cleverly defined as intersections of function graphs with a diagonals. Calculating the intersection numbers at the fixed points counts the fixed points with multiplicity, and leads to the Lefschetz fixed point theorem in quantitative form.

References

  • 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

    My blog: http://www.primaboinca.com/view_profile.php?userid=5889534
  • 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

    My blog: http://www.primaboinca.com/view_profile.php?userid=5889534 Appendix A.
  • 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

    My blog: http://www.primaboinca.com/view_profile.php?userid=5889534
  • Algebraic Curves: An Introduction To Algebraic Geometry, by William Fulton with Richard Weiss. New York: Benjamin, 1969. Reprint ed.: Redwood City, CA, USA: Addison-Wesley, Advanced Book Classics, 1989. ISBN 0-201-51010-3. Full text online.
  • 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

    My blog: http://www.primaboinca.com/view_profile.php?userid=5889534