Global-Data Problems: Monodromy, Basis Changes, and Resonance
The chapter has spent seven pages separating objects that are often denoted by the same letter: monodromy matrices, Stokes factors, connection coefficients, boundary Wronskians, and several determinant constructions. This capstone asks whether those distinctions survive an actual calculation. The problems progress from convention checks to resonant limits, operator domains, and a reproducible hypergeometric computation.
Complete solutions are provided for the closed problems. The computational lab gives pseudocode and acceptance criteria rather than software-specific output, and the final research problem gives milestones rather than pretending that every model has a universal closed-form answer.
The convention card
Section titled “The convention card”Use the chapter conventions throughout:
The path product traverses first and then , so
For a scalar equation in monic form,
the book’s Wronskian and Abel identity are
Every answer involving a connection coefficient should name its ordered bases, direction, branches, and continuation path. Every spectral answer should additionally name the Hilbert space or resonance sheet and the operator domain or asymptotic boundary condition.
| Problem | Level | Principal audit |
|---|---|---|
| 1 | Core | Requested datum and missing hypotheses |
| 2 | Core | Based-loop order and conjugacy |
| 3 | Intermediate | Four different transformations |
| 4 | Intermediate | Connection cocycle and boundary entry |
| 5 | Intermediate | A commuting Riemann–Hilbert reconstruction |
| 6 | Advanced | Wild factorization and residual gauge |
| 7 | Advanced | Coalescing bases and Jordan monodromy |
| 8 | Advanced | Hurwitz moves and marked trace data |
| 9 | Advanced | Robin boundary function and Fredholm ratio |
| 10 | Advanced | Resonant Legendre quantization |
| 11 | Computational lab | Exact and near-resonant numerical audits |
| 12 | Research | A complete global-data dossier |
Monodromy words and frame dependence
Section titled “Monodromy words and frame dependence”1. Name the datum before calculating
Section titled “1. Name the datum before calculating”For each request below, identify the primary mathematical object and at least one datum or hypothesis that must be added before the request is well posed.
- Continue a normalized germ once around a puncture.
- Compare unit-leading Frobenius bases at two singular points.
- Measure the jump between two lateral asymptotic sums at an irregular singularity.
- Find the values of a parameter for which a left-selected solution also satisfies a right endpoint condition.
- Evaluate .
- Evaluate .
Solution
The objects and their minimum ledgers are:
| Request | Primary object | Data or hypothesis still required |
|---|---|---|
| Continued germ | A based monodromy matrix, or its representation class | Base point, based homotopy class, ordered frame, loop orientation, and path-composition convention |
| Two local bases | A path-labelled connection matrix | Exact basis normalizations, matrix direction, branches, and continuation path |
| Lateral asymptotic jump | A Stokes factor inside wild monodromy data | Formal normal form, sector labels, lateral summation directions, and orientation of the crossing |
| Two-end condition | A selected connection entry or boundary Wronskian | Hilbert space and operator domain for eigenvalues, or time convention, asymptotic condition, and sheet for resonances |
| A Fredholm determinant, or possibly a regularized determinant | A trace-class hypothesis for the ordinary determinant; if only , the appropriate must be declared | |
| A zeta-regularized operator determinant | A closed operator with suitable discrete spectral behavior, a spectral cut when needed, a summability half-plane, and regular continuation to the evaluation point |
The first four objects arise directly from solution spaces and analytic continuation. The last two are operator constructions with separate existence theorems. A boundary Wronskian is not promoted to a Fredholm or zeta determinant merely because its zeros are spectral.
2. A based-loop product in an explicit frame
Section titled “2. A based-loop product in an explicit frame”Let
The distinguished loops obey in the book’s convention.
- Compute .
- Verify the full product and its determinant.
- Change the common base frame by . Compute the new and , and identify a quantity built from that survives.
Solution
Because the representation respects the declared path product,
Now
whose determinant is one. Therefore
Direct multiplication gives . Each matrix has determinant one, so the determinant relation is also satisfied.
The frame change acts by simultaneous conjugation:
Hence
The separate off-diagonal entries depend on the frame, but their product does not. Equivalently,
is a simultaneous-conjugacy invariant. The loop relation itself is also preserved:
3. Four transformations that should not be conflated
Section titled “3. Four transformations that should not be conflated”For a flat frame , a connection matrix , and a boundary function built from selected solution lines, compare the following operations:
- a constant change of the common global frame;
- independent changes of normalized local bases;
- a single-valued invertible left gauge ;
- a multivalued scalar gauge with .
State how monodromy and connection data transform, and which spectral information in is invariant under a nowhere-zero analytic renormalization.
Solution
A constant global frame change gives
Thus traces, determinants, Jordan form, and all simultaneous-conjugacy invariants survive, while individual entries generally do not.
Independent local changes
give the two-sided law
This is not usually a conjugation because the two endpoint normalizations are independent. If and preserve the selected boundary lines and rescale their generators by nowhere-zero analytic factors, then the associated scalar boundary function changes by a nowhere-zero analytic factor. Its zero set and zero multiplicities are unchanged.
For a single-valued invertible left gauge,
analytic continuation gives
The numerical right monodromy matrices are unchanged when the same solution frame is retained. Consistently gauged local frames also retain the same connection matrices.
A multivalued scalar gauge instead yields
It twists the representation by a character. Projective monodromy is unchanged, but traces and determinants of a chosen lift generally are not. These four operations coincide only in special circumstances and should never be inferred from the visual similarity of their formulas.
Connection groupoids and reconstruction
Section titled “Connection groupoids and reconstruction”4. A cocycle, a path change, and one boundary zero
Section titled “4. A cocycle, a path change, and one boundary zero”Suppose three normalized frames satisfy
-
Find in .
-
Let . Verify the transformed cocycle.
-
If a new comparison path replaces the endpoint frames by and , find the new .
-
Write
If the first solution at zero is required to lie in the first selected solution line at infinity, identify the boundary equation. Explain why diagonal, nowhere-zero analytic renormalizations preserve it.
Solution
Composition gives
so
The two factors transform as
Their product is
and the middle normalization cancels exactly as a cocycle requires.
For the changed endpoint branches, solve
This yields
Finally, the first column says
Requiring to lie in the line spanned by is therefore the boundary equation
Diagonal rescalings multiply by nonzero analytic factors from the source and target normalizations, so its zeros and their orders survive. A general nondiagonal basis change can mix the selected line with its complement and describes a different boundary condition.
Reconstruction, wild data, and marked representations
Section titled “Reconstruction, wild data, and marked representations”5. A commuting Riemann–Hilbert reconstruction
Section titled “5. A commuting Riemann–Hilbert reconstruction”Let
and consider the prescribed local monodromies
- Construct a Fuchsian system on with these monodromies.
- Determine its residue and local monodromy at infinity.
- Show that the same monodromy representation does not determine unique residue logarithms.
- Explain geometrically what the ambiguity changes.
Solution
Because and commute, chosen branches of the matrix powers give
It is a fundamental matrix of
A positive loop about zero adds to and gives ; the analogous loop about one gives .
In the local coordinate , the residue at infinity is
Therefore
and the based product holds. Here commutativity removes the ordering difficulty; it does not remove the need to state the distinguished loop system.
Now choose traceless integral diagonal matrices
Then
The single-valued meromorphic gauge
shifts the finite residues by and while leaving the local system on the punctured sphere unchanged. Thus the representation determines the exponents only modulo integers. Choosing particular logarithms amounts to choosing how the flat bundle is extended across the punctures—a logarithmic lattice, such as a Deligne extension after a preferred strip for the real parts has been fixed.
This example is deliberately abelian. In a noncommuting reconstruction, existence of a logarithmic connection with a prescribed pole structure is an additional Riemann–Hilbert problem; one cannot obtain it by choosing three unrelated matrix logarithms.
6. Wild factors hidden by ordinary monodromy
Section titled “6. Wild factors hidden by ordinary monodromy”At a rank-two irregular singularity, assume that the formal exponential type has two distinct, labelled one-dimensional blocks. Block swaps are not allowed: residual formal gauges must preserve this exponential grading. Take
with . In the orientation and fixed-frame convention of the wild-monodromy page, the actual local monodromy is
- Compute , its determinant, and its trace.
- Determine how and transform under the residual formal-frame change .
- Which combination of the two Stokes multipliers can be recovered from when is known?
- Explain precisely what ordinary monodromy forgets.
Solution
The inverse Stokes factors give
so
Consequently,
Because preserves the exponential grading—and commutes with —it is a residual normalization of the formal eigenlines. Conjugation gives
Thus and are framed quantities, whereas is invariant under this centralizer action. If and the trace are known, then
Even this invariant does not reconstruct the direction-labelled factorization. For example, if and , the cases
all have ordinary monodromy conjugate to , provided the displayed nonzero multiplier is allowed. The three wild data sets differ: one has no jump, and the other two place a jump in different Stokes groups. Ordinary conjugacy retains only the product matrix; wild monodromy retains the formal monodromy, ordered singular directions, sector normalizations, and Stokes factors.
Resonant limits and marked monodromy
Section titled “Resonant limits and marked monodromy”7. Coalescing Euler modes and Jordan monodromy
Section titled “7. Coalescing Euler modes and Jordan monodromy”For , consider
on the slit plane with a chosen . A nonresonant basis is
- Explain why this basis becomes defective as .
- Construct a basis with a finite, nonzero Wronskian limit.
- Transform the monodromy into that basis and take the limit.
- Check the answer directly from the limiting differential equation.
Solution
The Wronskian of the raw pair is
which tends to zero because both columns tend to . The singularity is in the chosen basis, not in the two-dimensional solution space.
Set
Then
and . If
then
In the raw basis, positive continuation around zero is
The right monodromy in the convergent basis is therefore
Taking the limit gives the nontrivial Jordan matrix
At , the equation is and the limiting basis is . Since a positive loop sends to , the direct continuation gives the same matrix. Taking the limit of the diagonal eigenvalues alone would have produced the identity and lost the logarithmic extension data.
8. A Hurwitz move on marked character data
Section titled “8. A Hurwitz move on marked character data”Let a four-puncture monodromy tuple satisfy , with
where , and set . Perform the Hurwitz move
- Verify that the product constraint survives and that the first two local conjugacy classes are exchanged.
- Compute the three pair traces , , and before the move.
- Compute the corresponding traces after the move.
- Why is this a change of marking rather than an ordinary simultaneous conjugation?
Solution
Write
Then
so . Moreover, is the old , while is conjugate to the old ; hence their local conjugacy classes are exchanged.
Before the move,
Direct calculation gives
Therefore the new pair traces are
The last value differs from both old traces under the stated assumptions. A simultaneous conjugation preserves every trace of every labelled word, so it cannot produce this change. The Hurwitz move instead changes the distinguished generators of the punctured-sphere fundamental group. It is a braid or mapping-class action on the marked character variety: local conjugacy classes and the total product remain compatible, but the trace coordinates attached to labelled loop words transform.
Boundary functions and quantization
Section titled “Boundary functions and quantization”9. A Robin boundary function and a Fredholm ratio
Section titled “9. A Robin boundary function and a Fredholm ratio”Fix and . Let
in , with
Let and use the entire-in- left-normalized solution
- Construct an entire boundary function and identify its zeros.
- Prove directly that its eigenvalue zeros are simple.
- When is its normalized ratio an ordinary Fredholm determinant?
- What fails at the exceptional value ?
Solution
Applying the right boundary functional gives
Both apparent functions of have power series in , so is entire. Its zeros are exactly the eigenvalues of the specified self-adjoint domain: the left-normalized solution then also satisfies the Robin condition.
Differentiate
with respect to , writing . The Wronskian identity is
At an eigenvalue , the left normalization gives zero Wronskian at , while the Robin condition gives
Hence
The endpoint value cannot vanish, since the Robin condition would then force both Cauchy data at to vanish. The integral is positive, so .
At zero,
If , then is invertible. Its inverse is trace class, because the eigenvalues of grow quadratically. Since has order as an entire function of , its normalized genus-zero factorization is
The same convergent product defines the Fredholm determinant, so
This equality uses the declared domain, trace-class inverse, growth, and normalization; it does not follow from the zero set alone.
For , the function satisfies both boundary conditions. Thus zero is an eigenvalue, , and neither the displayed quotient nor exists. The unnormalized boundary function remains valid. One may factor out the zero mode or normalize at a shifted spectral parameter, but that is a different determinant statement. An absolute zeta determinant would require its own continuation, normalization, and, for a non-self-adjoint problem, spectral-cut data.
10. Resonant Legendre quantization
Section titled “10. Resonant Legendre quantization”Let
and begin with the maximal domain
Consider the endpoint-regular self-adjoint restriction of defined by
in , with the separated conditions
Write and choose the solution regular at ,
- Show that the hypergeometric equation is zero-balanced at .
- Compute the coefficient of the logarithmic branch there.
- Derive the spectrum selected by regularity at both endpoints.
- Explain why “the equation is resonant” is not itself a quantization condition.
Solution
Set
The hypergeometric parameters are
Thus the exponent difference at , corresponding to , is zero for every . For , the zero-balanced continuation formula has leading term
because . Euler’s reflection formula gives
Therefore, as ,
The logarithmic coefficient extends to integer by the parameter limit, even though the two gamma factors in the intermediate formula then have poles. The endpoint-regular domain removes the logarithmic branch, so
Using the symmetry , choose . The eigenvalues and eigenfunctions are
The singular point was resonant for every value of ; most of those values produce a logarithm. Quantization occurs only when the parameter-dependent logarithmic connection coefficient vanishes. At integer , the hypergeometric series terminates and the limiting solution is a Legendre polynomial. This is the distinction between a local exponent collision and a global two-end boundary condition.
Computational synthesis
Section titled “Computational synthesis”11. Reproduce a hypergeometric global-data audit
Section titled “11. Reproduce a hypergeometric global-data audit”Build one high-precision computation with
Use the unit-leading bases and upper/lower phase conventions from the hypergeometric benchmark. Your computation must do all of the following:
- form and the four path-labelled matrices , for from gamma quotients;
- verify the connection cocycle and the three exact determinant targets;
- assemble the lower- and upper-stem based monodromy products;
- repeat with and compare the raw basis with its logarithmic recombination as .
Solution and acceptance criteria
The exact determinant targets are
The upper matrices must obey
With the lower stem, transport the three diagonal local matrices into the zero frame and check
With the upper stem and its corresponding infinity matrix, check instead
Testing the wrong word against the right matrices is expected to fail.
A language-neutral implementation can follow this outline:
set working precision P and guard digits Gdefine gamma quotients A_f, A_g, B_f, B_gconstruct C10 and Cinf0(s), Cinf1(s) for s = -1, +1record every logarithm branch and every lateral phase
for each claimed identity: compute a scale-aware matrix residual repeat at P, 2P, and 4P digits compare determinants separately with their exact targets
construct D0, D1, Dinftransport them with the declared connection matricestest the lower word and the upper word independently
for epsilon in 10^(-2), 10^(-4), 10^(-6), ...: set c = a + b + epsilon form the raw C10(epsilon) set S = [[1, 1], [0, epsilon]] form Chat(epsilon) = S * C10(epsilon) record condition numbers of C10 and Chat compare Chat with its gamma–digamma limitThe numerical report passes only if:
- relative determinant errors and scaled matrix residuals decrease as the working precision increases;
- the upper cocycle and both correctly ordered monodromy words converge to zero residual;
- the raw near-resonant condition number grows on the scale , while the transformed matrix remains bounded and converges when ;
- an independent check—Wronskian evaluation, direct ODE integration along the declared paths, or overlapping local series—agrees with the matrix calculation;
- the report records software and version, precision, branch conventions, path geometry, matrix norm, and all parameter values.
A table of residual versus precision is evidence; a single string of machine digits is not. Near resonance, evaluate the recombined expressions directly or with sufficient guard digits, since subtracting two terms at ordinary precision recreates the instability that the basis change was meant to remove.
Research extension
Section titled “Research extension”12. Build a complete global-data dossier
Section titled “12. Build a complete global-data dossier”Choose one nontrivial model: a Bessel, Airy, Whittaker, Heun, or compactly-supported Schrödinger equation is suitable. Formulate one global question—connection, scattering, bound-state, resonance, or quasinormal-mode—and answer it as completely as the model permits.
Your dossier must separate the following layers:
- differential equation, parameter domain, and singularity types;
- normalized local or asymptotic bases, including branches and sectors;
- base point, path system, and ordinary or wild monodromy data;
- the connection entry or boundary Wronskian that answers the question;
- Hilbert space and operator domain, or time convention, outgoing condition, and resonance sheet;
- the status of any Fredholm, zeta, or canonical-product determinant;
- at least two independent analytic or numerical checks;
- a ledger marking each statement as proved, numerically supported, or conjectural.
Guidance and known milestones
A successful dossier is reproducible before it is ambitious. Begin with a one-page convention ledger. Normalize every basis by a leading coefficient or Cauchy datum; draw or describe every cut and path; and reserve different symbols for local monodromy, Stokes factors, connection matrices, and spectral functions.
Then meet these milestones:
- Derive local exponents or formal exponential parts directly from the equation.
- Compute at least one connection quantity in two independent ways, such as a Wronskian ratio and numerical continuation.
- Transport every local monodromy matrix to one base frame before testing the global product.
- If an irregular point is present, give the ordered Stokes factorization and its residual centralizer action.
- Derive the spectral condition from the stated domain or asymptotics, rather than importing a familiar spectrum from another realization.
- State separately whether the resulting scalar function is merely a boundary function, a canonical product, a Fredholm determinant, or a zeta determinant. Cite the comparison theorem for every asserted equality.
- Include machine-readable parameters and a precision-convergence table. One check should be structurally different from the formula being tested.
For a Bessel model, the integer-order logarithmic limit is a natural resonance test. Airy supplies a clean Stokes audit. Whittaker combines regular and irregular singularities. Heun exposes accessory-parameter dependence, while a compactly-supported Schrödinger model makes the distinction between physical and nonphysical sheets unavoidable. A negative result—such as proving that the available data do not determine a claimed determinant—is a valid research conclusion when the missing hypothesis is identified precisely.
References
Section titled “References”- NIST Digital Library of Mathematical Functions, §15.10: Hypergeometric Differential Equation fixes standard solutions and connection formulae for the Gauss equation; §15.8 records the transformations and limiting cases used in the resonant problems.
- NIST Digital Library of Mathematical Functions, Chapter 14: Legendre and Related Functions gives the Legendre normalizations and endpoint behavior used in Problem 10.
- A. A. Bolibrukh, “The Riemann–Hilbert problem”, Russian Mathematical Surveys 45 (1990), 1–58, explains why prescribed monodromy and a prescribed Fuchsian realization are distinct questions.
- P. Deligne, Équations différentielles à points singuliers réguliers, Lecture Notes in Mathematics 163, Springer, 1970, develops the regular-singular correspondence and logarithmic extensions.
- K. Iwasaki, H. Kimura, S. Shimomura, and M. Yoshida, From Gauss to Painlevé, Vieweg, 1991, treats marked monodromy, braid actions, and hypergeometric connection data.
- W. Wasow, Asymptotic Expansions for Ordinary Differential Equations, Dover, 1987, develops formal solutions, sectors, Stokes matrices, and irregular monodromy.
- B. Simon, Trace Ideals and Their Applications, second edition, American Mathematical Society, 2005, gives the operator-theoretic hypotheses for Fredholm determinants.
- A. Zettl, Sturm–Liouville Theory, American Mathematical Society, 2005, treats self-adjoint domains, endpoint classification, and separated boundary conditions.