Branched Surfaces for Radicals and Composite Functions

Executive summary

Once surfaces for simple multi-valued functions are understood, the source develops formal construction rules for more complicated expressions. For sums, differences, products and quotients, begin with pairs of branches from the input functions and create a sheet for each resulting branch value; then identify sheets whose expressions actually coincide. Integer powers transform each existing branch and may likewise collapse equal sheets. Root extraction is different: every branch of the underlying function expands into a pack of new sheets, one for each root value. Movement between packs follows the old branching, while movement inside a pack is cyclic. These rules are the geometric precursor to the group-theoretic proof that radicals yield soluble monodromy.

What this handbook page teaches

Build a formal branch scheme for arithmetic combinations of multi-valued functions.
Identify coincident branches so the formal scheme becomes the actual scheme.
Transform a scheme under an integer power.
Expand each old sheet into a pack under root extraction.
Track branch-point transitions between and within packs.

Core concepts

Sheet 1 — one continuous branch

Sheet 2 — another continuous branch

Sheet 3… — further branches when required

Crossing an appropriate cut or continuing around a branch point may carry a value from one sheet to another.

Arithmetic combinations

Suppose f has branches f_i and g has branches g_j on the same cut domain. A formal scheme for f+g creates a sheet for every pair (i,j), carrying f_i+g_j. If a branch loop sends f_i→f_k and g_j→g_l, it sends the pair sheet (i,j)→(k,l).

The same construction applies to subtraction, multiplication and division where defined. It can over-count: two different pairs can produce the same branch function. Equal sheets must then be identified to obtain the actual surface.

Integer powers

For h=f^m, replace the label f_i on each sheet with f_i^m. Branch transitions initially follow those of f. If distinct original branches become equal after the power, identify the corresponding sheets. Powers can therefore reduce the number of distinct branches.

The necessity of identification is easy to see with a two-valued function whose branches are negatives of each other: squaring makes them identical. A formal two-sheet scheme would be wrong until those equal branches are collapsed.

Root extraction and packs

For h=f^(1/n), each branch f_i gives n root branches. Replace every original sheet by a pack of n sheets. If continuation of f moves from branch f_i to f_j, continuation of h moves the whole pack over i to the pack over j.

Inside a pack, the n branches differ by multiplication by the nth roots of unity. Once the destination of one sheet is known, the destinations of the others are determined by the same cyclic offset. This controlled cyclic behaviour later gives a commutative kernel in the monodromy extension.

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 common system of cuts for all input functions so their branch labels can be compared consistently.
For arithmetic operations, create formal pair sheets and derive loop transitions component-wise.
Evaluate whether two formal branch expressions are identically equal; merge their sheets if so.
For integer powers, transform every branch label and repeat the equal-branch check.
For an nth root, replace each old sheet by n root sheets and label their cyclic relationship.
Track one root sheet through each branch loop; infer the rest of the pack by cyclic symmetry and verify all branch-point transitions.

Why squaring can collapse a two-sheet function

Suppose a function has two branches f_1 and f_2=-f_1. Its square formally gives two sheets labelled f_1² and f_2². But f_2²=(-f_1)²=f_1², so both labels describe the same branch. The actual squared function is single-valued even if the original function is not.

This example explains why surface construction cannot be done solely by counting combinations. Formal branch pairs are a safe first stage because they preserve all possibilities, but equality relations can collapse them. The source repeatedly instructs the reader to identify sheets carrying equal values.

Root extraction has the opposite effect: it expands. If a single-valued non-zero branch is subjected to an nth root, it locally yields n branches arranged as a cyclic pack. The whole radical-expression theory alternates these expansion, pairing and identification operations.

Technical reasoning and deeper connections

The scheme depends on cuts, but the underlying group generated by continuation does not depend on the arbitrary numbering of sheets. This is why the later monodromy group is defined only up to isomorphism. Construction details matter for computation, while structural conclusions must be invariant under relabelling.

Formal combination schemes naturally produce subgroup relations. If the branch permutations of f form F and those of g form G, component-wise movement of pair sheets embeds the formal permutation group into a subgroup of F×G. Identifying equal sheets then gives a surjective image of that formal group.

Root extraction gives an extension rather than merely a direct-product subgroup. Forgetting the sheet position inside each pack maps the new permutation group onto the old group. The kernel performs cyclic shifts inside packs, and the source proves it is commutative. This is the exact structural mechanism behind preservation of solubility.

The visual multi-sheet diagrams in the source should be read as combinatorial aids. A practical digital article can replace literal source artwork with sheet stacks, pack labels and transition arrows, provided the branch identifications and loop actions are preserved accurately.

Quick-reference matrix

Operation	Formal construction	Correction step
`f±g`	One sheet per branch pair	Identify equal resulting branches.
`fg` or `f/g`	One sheet per branch pair	Exclude undefined denominators; identify equal branches.
`f^m`	Transform each existing sheet label	Merge branches made equal by the power.
`f^(1/n)`	Replace each sheet by an `n`-sheet pack	Track cyclic shifts and any later coincidences.
Change cuts	Recompute transition arrows	Underlying monodromy remains structurally equivalent.

Common mistakes

Multiplying the numbers of branches and assuming the result is always the true number of sheets.
Forgetting branch coincidences after arithmetic or powers.
Using different cut systems for inputs without reconciling their branch labels.
Treating all sheets inside a root pack as independent when their transitions are cyclically linked.
Ignoring points where a denominator or radicand creates an undefined value.
Assuming a surface scheme is canonical rather than dependent on cut and labelling choices.

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.

Input branch schemes use the same cut domain.
Formal pair or pack construction includes every possible local value.
Equal branch functions are identified.
Undefined points are excluded before continuation.
Loop transitions are determined for every branch point.
Sheet relabelling changes notation only, not the inferred group structure.

Frequently asked questions

Why use a formal scheme if it can contain too many sheets?

It guarantees no branch possibility is missed. Equality checks then reduce it to the actual scheme.

Does raising a multi-valued function to a power always reduce branches?

No. It may preserve the number of branches or collapse some, depending on whether powered branch values coincide.

Why does root extraction create packs?

Each existing value has n possible nth roots, related cyclically by roots of unity.

How does this lead to group theory?

Branch loops act as permutations of the formal pair sheets or root packs, producing direct-product subgroups, quotient maps and commutative kernels.

Source basis: this page is a handbook-style synthesis of the uploaded mathematics source, principally sections 2.10, 2.11 Theorems 8–10. 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.