Executive summary
A branched surface becomes algebraically useful when its loop behaviour is converted into permutations. Choose a regular base point where a multi-valued function has distinct values. Continue every value around a closed path that avoids forbidden points. Each starting value returns to one of the values at the base point, and uniqueness of continuation ensures different starting values return to different values. The loop therefore defines a permutation. All loop permutations form a group. Equivalently, one may generate the group from the local permutations produced by turns around branch points in a chosen surface scheme. Different sheet numberings or cut choices change the displayed permutations but not the group's isomorphism type.
What this handbook page teaches
- Associate a permutation with a closed continuation path.
- Generate the same group from local branch-point permutations.
- Understand why path reversal gives an inverse permutation and path concatenation gives composition.
- Separate arbitrary sheet numbering from intrinsic group structure.
- Use monodromy as an invariant for comparing multi-valued representations.
Core concepts
Loops act on branch values
Choose a base point z0 that is neither a branch point nor a non-uniqueness point, and list the distinct values w1,…,wm. For a closed admissible curve beginning and ending at z0, continue each wi along the curve. Each ends at some wj.
Two different starting values cannot merge along an admissible curve without violating uniqueness. Therefore the endpoint assignment is bijective and is a permutation of the m values. This is the fundamental passage from topology to finite group theory.
Group law from path operations
If a loop produces permutation σ, traversing it in the reverse direction produces σ^-1. Following one loop and then another produces the product of their permutations, with composition order fixed by the path convention. The constant loop gives the identity.
Thus loop-induced permutations are closed under composition and inverses and form a group. The source calls this the monodromy group of the multi-valued function.
Local generators and invariance
On a cut-plane scheme, a small positive turn around each branch point gives a sheet permutation. The subgroup generated by these branch-point permutations is isomorphic to the loop-defined group. This makes the group computable from a finite transition scheme when there are finitely many branch points.
Renumbering sheets conjugates all displayed permutations by the same relabelling permutation, producing an isomorphic group. Different cut choices can likewise alter the scheme but not the intrinsic monodromy isomorphism type.
Working method
Use the following sequence as a repeatable analysis workflow. The steps are ordered to separate definitions and admissibility checks from structural conclusions, so a result can be audited without relying on intuition or an unverified diagram.
- Choose a regular base point and label every distinct branch value there.
- Identify the branch points and any other forbidden continuation points.
- Choose simple loops that generate the relevant path behaviour, commonly small loops around individual branch points.
- Continue every labelled branch around each loop and write the resulting permutation.
- Generate the subgroup of the full symmetric group from those permutations.
- Check the result for invariance under relabelling and use its structural properties—commutativity, solubility, order, generators—as an invariant of the multi-valued function.
Monodromy of an nth-root function
For w^n=z, choose z0=1 and label the n roots in cyclic angular order. Continue all roots while z makes one counterclockwise turn around the origin. The continuous argument of z increases by 2π, so every root argument increases by 2π/n.
Each root therefore moves to the next root in the cyclic order. The loop permutation is one n-cycle. Repeating the loop gives its powers, and after n turns the identity returns. The monodromy group is the cyclic group generated by this one cycle.
This example is the atomic branch behaviour of radical extraction. More complicated radical expressions combine many such cyclic effects, but the later theorem shows their full monodromy remains soluble.
Technical reasoning and deeper connections
Monodromy is useful because it ignores the actual numerical formulas for branch values. Two functions can be analytically complicated yet have the same branch-permutation structure. Conversely, if two proposed representations have non-isomorphic monodromy groups, they cannot describe the same multi-valued function.
The base point does not fundamentally matter as long as it is regular and the domain under consideration is connected in the required way. Moving the base point transports branch labels along a connecting path and conjugates the group representation. The structural group remains the same up to isomorphism.
A branch-point permutation is local, but the group generated by all such local actions is global. Several simple transpositions can generate a very large non-commutative group. The degree-five obstruction relies precisely on this amplification from four local pair exchanges to the full five-symbol permutation group.
The group records how values permute, not how far they move geometrically. This is why branch diagrams can be replaced by combinatorial sheet schemes once continuation rules are known. The invariant is discrete even though it arises from continuous path motion.
Quick-reference matrix
| Path operation | Permutation operation | Consequence |
|---|---|---|
| Constant loop | Identity | Does not change any branch. |
| Reverse loop | Inverse | Undo continuation. |
Loop C1 then C2 | Permutation composition | Monodromy permutations form a group. |
| Small loop around branch point | Local generator | Computes group from branch structure. |
| Relabel sheets | Simultaneous conjugation | Group changes representation, not isomorphism type. |
Common mistakes
- Assigning a permutation to a path that passes through a branch or non-uniqueness point where continuation is not unique.
- Following only one branch and assuming the resulting motion determines the whole permutation.
- Changing sheet labels midway through a calculation.
- Using inconsistent order for path concatenation and permutation composition.
- Assuming the group is generated by one branch point when several independent branch points exist.
- Comparing raw permutation notation across two schemes without allowing for relabelling.
Verification checklist
Before accepting a solution or proof, confirm each item below. These checks are intentionally practical: they catch the most common category errors, missing hypotheses and structure mismatches.
- Base point is regular and all branch values there are distinct.
- All loops avoid forbidden points.
- Each generator records the destination of every sheet.
- Permutation composition convention is explicit.
- Generated subgroup is computed rather than inferred from visual size.
- Structural comparisons are made up to isomorphism.
Frequently asked questions
Is monodromy the same as the number of branches?
No. Branch count gives the degree of the permutation action; monodromy records which permutations are actually produced.
Can two different functions have the same monodromy group?
Yes. Monodromy is an invariant, not a complete description of the function.
Why do local loops suffice?
For the punctured plane configurations considered in the source, loops can be decomposed into motions around branch points, so their permutations are generated by the local ones.
Why is monodromy relevant to radical solvability?
Radical expressions can only produce soluble monodromy groups, while the generic degree-five root function produces a non-soluble one.
Source basis: this page is a handbook-style synthesis of the uploaded mathematics source, principally sections 2.12. It paraphrases the supplied material and does not reproduce source artwork or long source passages. Historical names, publisher details and personal details have been intentionally omitted.