Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Algebraic function
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== Monodromy === Note that the foregoing proof of analyticity derived an expression for a system of ''n'' different '''function elements''' ''f''<sub>''i''{{space|hair}}</sub>(''x''), provided that ''x'' is not a '''critical point''' of ''p''(''x'', ''y''). A ''critical point'' is a point where the number of distinct zeros is smaller than the degree of ''p'', and this occurs only where the highest degree term of ''p'' or the [[discriminant]] vanish. Hence there are only finitely many such points ''c''<sub>1</sub>, ..., ''c''<sub>''m''</sub>. A close analysis of the properties of the function elements ''f''<sub>''i''</sub> near the critical points can be used to show that the [[monodromy theorem|monodromy cover]] is [[Ramification (mathematics)|ramified]] over the critical points (and possibly the [[Riemann sphere|point at infinity]]). Thus the [[Holomorphic function|holomorphic]] extension of the ''f''<sub>''i''</sub> has at worst algebraic poles and ordinary algebraic branchings over the critical points. Note that, away from the critical points, we have :<math>p(x,y) = a_n(x)(y-f_1(x))(y-f_2(x))\cdots(y-f_n(x))</math> since the ''f''<sub>''i''</sub> are by definition the distinct zeros of ''p''. The [[monodromy group]] acts by permuting the factors, and thus forms the '''monodromy representation''' of the [[Galois group]] of ''p''. (The [[monodromy action]] on the [[universal covering space]] is related but different notion in the theory of [[Riemann surface]]s.)
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)