Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Derivations
Reading: the complete supplied statement and proof, the complete supplied
checker, and the supplied Eremenko–Hayman text through Lemma 6 and its
bibliography; text-only source inspection. These derivations examine the
mathematics frozen on 2026-10-15, preserved under assets/subject/ beside
the report. Original project mathematics is credited to
Plasma AI; the external deformation and extremal-existence results are due
to Eremenko and Hayman.
1. Does an existential extremal reduction classify every maximizer?
This is the strongest attempted refutation. Lemma 5's statement alone supplies one suitable extremizer and cannot exclude other maximizers. The extracted proof instead uses a property of its construction. The required local property does follow from the supplied construction, at the external theorem boundaries specified below.
Let be any monic cubic whose length is the global maximum . Suppose its two critical values are distinct and . Choose a disc about with closure disjoint from and , and a smooth function supported in it with . For sufficiently small complex , is a quasiconformal homeomorphism. The smallness condition can be strengthened to keep away from and .
For , the Wirtinger chain rule gives, away from the finitely many zeros of ,
Changing this coefficient at those finitely many points changes no Beltrami equation. Its support is compact, because is proper, and it depends holomorphically on with locally uniform norm less than one. The external input is the normalized existence and analytic-parameter dependence theorem for the Beltrami equation invoked in the supplied source: it supplies at infinity with this coefficient. The usual straightening property for equal Beltrami coefficients makes
entire. Near infinity is the identity and , so . An entire function with this growth is a monic cubic. Thus the normalization preserves the precise optimization class; it does not merely preserve degree up to an uncontrolled scale factor.
Homeomorphisms preserve local topological degree. The two simple critical points of have local degree two, so their images are again simple critical points of . Their values are exactly and . In particular, this deformation cannot silently replace two simple critical points by a double critical point.
The support of the Beltrami coefficient stays away from . Hence is conformal on a fixed neighborhood of , and gives
Analytic dependence on , together with conformality in on that fixed neighborhood, makes holomorphic in . On compact parameter subdiscs its modulus is uniformly bounded for on the compact finite-length curve. Integrating its subharmonic modulus therefore gives a subharmonic length function. It is at most and equals at , so the subharmonic maximum principle makes it constant. This argument applies to any maximizer with the stated isolated off-circle value, not only to the extremizer selected in Lemma 5's conclusion.
The remaining possible obstruction is failure to continue all the way to the circle. It is important that the cubic proof uses compactness, rather than assuming that infinitely many local moves finish. Choose a simple arc from to , lying off until its endpoint and avoiding . Either component of the complement of the circle remains path connected after removal of one point, so such an arc exists. Let consist of its nonterminal points for which a monic maximizer has critical values . Local deformation proves that is relatively open and contains the starting point.
To prove relative closedness, translate each such cubic to depressed form . Its critical-value pair gives
If , these coefficients are bounded. A convergent subsequence of gives a monic cubic whose critical values are . One can choose the sign of so ; alternatively the unordered pair is enough. The limit values stay distinct because the arc avoids . Lemma 4's coefficient continuity preserves length . Thus is relatively closed; connectedness of the nonterminal arc yields every one of its points. The same boundedness and continuity argument at the terminal point supplies a maximizer with critical values .
If is off the circle, repeat with an endpoint different from . The result has two distinct critical values on , hence normalizes to the positive- family and contradicts its strict inequality. This closes both the potential collision and coefficient-escape objections. There is no need to choose one globally continuous branch of the cubic parameter or to rule out monodromy separately.
If the depressed cubic has , its length is for and for . The positive nonconstant binomial series for proves strict increase on , so equality is possible only at . Finally, for , the substitution changes to and preserves arclength. The converse equality cases are therefore present in precisely the stated monic convention.
The source's Beltrami existence/dependence theorems are external premises, not proved here. Their original books were not supplied. The source's local construction and the cubic continuation above were read and checked through those explicit boundaries. Merely citing the statement of Lemma 5 would leave a gap, but that is not what the frozen proof does.
2. Can small positive parameters or a singular window escape the estimate?
Write , , and . The circle in the scaled plane is . On its near branch,
The rationalized expression is defined also at , as . For the positive parameters actually used in the circle integral, the checked inequalities and , with , ensure that this branch covers every point of modulus less than . On the other branch ; outside the displayed height interval . Thus the complement really is covered by the tail estimate, including the far branch at small heights.
Here is an independent derivation of the tail constant. Choose a root of with , put using any cube root in this expression, and set . With , the three-point average satisfies
Indeed, the real parts of the three perturbations sum to zero. For , write ; then , by applying with .
The exact difference is
An upper bound for the bracket is
A lower bound for it is
Multiplying by proves the displayed bound. All terms used for increase with . Also , so and . This justifies both the substitution of the endpoint value of and the uniform bound over the tail.
Parameterize the unscaled circle by . If , its excluded near arc has . On its complement, and . Consequently
The factor of two comes from the two tails; integrating contributes the other factor absorbed by . This calculation checks the potentially consequential normalization constants.
The proof's numerical sentence that the tail is at most can also be checked with simple rational overestimates, without relying on a sampled tail. At the small-parameter endpoint . Since , the first expression for is less than and the second is smaller. One obtains
For example, to see the estimate for the first expression, use , , and . Their resulting sum is below . These are conservative rational bounds, not a new computational leg.
At the head , let be a bound for . For the actual real parameters the weight is at least one, and gives
Subtracting this lower bound has the correct direction. No value of the singular negative power at zero is evaluated. At the same head formula integrates ; it does not assert that the scaled circle exists there.
For , the distances satisfy and . If bounds the numerator times weight divided by , then the positive part of the window integral is bounded by
Writing , the subtracted part is at least , again because the weight is at least one. The code subtracts precisely this conservative lower bound. Conjugation doubles the head, regular pieces, and window; the tail bound above already covers both tails. None is counted with a missing or extra symmetry factor.
All thirteen parameter boxes feed their full balls into these expressions. The successful full run bounds above by a negative number on every box. Since and , this proves a strict inequality even as tends to zero. A positive uniform lower cutoff on has not been used.
3. Do branch choices, endpoint extensions, or stopping rules invalidate the balls?
For , a root of is nonzero. If , expansion of gives . Multiplying by the three cube roots of unity gives all three roots, counted with multiplicity: their sum is zero, their pairwise-product sum is , and their product is , so their product polynomial is exactly . Away from the critical values they are distinct: the factorization
identifies precisely the critical-value obstruction. The other quadratic root is and its cube roots can be chosen as ; these produce exactly the same . Thus either resolvent root and any starting cube root give the same symmetric numerator. The formula extends continuously for that numerator at a simple critical value, even though the density is infinite there.
The code's rotated square root squares to , and its rotated cube root cubes to . The midpoint-based selection chooses one of two permitted resolvent roots; it is not used as an estimate of the root. Branch discontinuity does not invalidate pointwise enclosures. The argument needs the documented enclosing semantics of arb/acb, including branch-cut enclosures, but never calls an analytic complex quadrature rule. The independent prescribed-root diagnostic tests this interface using quadratic division instead of Cardano, including real and imaginary cut crossings and near-critical points. Its finite scope is stated in the report.
Let a routine enclose an actual integrand on a piece by and the
nonnegative exact piece width by . An upper rectangle bound is
when , and when . A lower rectangle
bound is when , and when . These four
cases are exactly piece_bound. Ball evaluation of the products and sums
then encloses the chosen scalar bounds. Taking an upper endpoint at the end
preserves an upper inequality. For a returned lower-bound ball, its lower
endpoint is a valid scalar lower bound. The rounded lower control stated in
the proof and the conservative one in the report lie below that endpoint;
the entire displayed ball is not asserted to be a scalar lower bound.
The adaptive integration routine starts with ordered exact dyadic endpoints.
Its midpoint is representable at the working precision and lies between the
two representable endpoints; subdivision therefore preserves the interval
union. All initial endpoints have the working precision or fewer significant
bits. Even if further subdivision ceases to shorten a piece, an accepted
finite rectangle remains a bound. The tolerance and the floating number
0.8 occur only in subdivision decisions. Acceptance at the depth cap does
not claim an error tolerance: it retains that same rectangle bound. A
nonfinite enclosure at the cap raises ArithmeticError. In the parameter
cover, an unresolved box narrower than instead records a failed
obligation. Neither route turns an unresolved enclosure into success.
In the large-parameter window, write . For in ,
For any interval containing ,
The code's coefficient encloses the numerator divided by . Multiplication by is therefore an upper bound over the whole window. The inclusion and interior tests are essential and are executed for every accepted box.
The upper regular integral ends at , whereas the lower
control ends at and discards the window. Nonnegativity gives
the stated directions. The upper extension cannot inadvertently cross the
second critical angle. Indeed, the accepted test w_hi < PI means
, while its construction gives
with positive spread.
It follows that , so
throughout the box. The same window tests keep
strictly between zero and . This also justifies the
small auxiliary extension of the parameter cover past :
stays positive, and with still places the
critical values on the circle. No assumption is imported into this
regime.
The initial parameter endpoints are increasing dyadic roundings of a linear grid. Bisection preserves their order. A successful box is accepted only if its enclosing upper length is strictly below the enclosed ; successive accepted endpoints are explicitly checked to match and the final one must be the upper endpoint. The separate overlap checks connect this closed cover to the small- cover. The printed minimum-margin summary is not needed for this implication: the strict comparison has already been made on each accepted box.
The four failed diagnostic calibration assertions
The retained diagnostic tests four endpoint identities that are stronger than
these enclosure requirements. For example, it expects the upper and lower
bounds of the ball constructed as arb(3, 1) to be exactly and .
The supplied API documentation expressly permits upward rounding of a
constructor radius. For a radius the correct interval is
, and the rectangle code is required to
preserve these enclosing endpoints, not to replace them by .
Similarly, if the negative test value is and its width is , the correct upper product is and the lower product is . They need not equal . The positive and sign-changing cases have the same issue. The endpoint inequalities just proved remain valid for outward radii.
The executed diagnostic reported four failed equalities and did not print the actual endpoint values. Therefore this record does not claim a measured value for or , or a confirmed numerical diagnosis of each failure. It identifies the logical defect in those calibration assertions and does not use them as successful checks. Their failure alone supplies no counterexample to an enclosing rectangle bound. The exact driver is preserved unchanged, with its nonzero outcome. A corrected and instrumented calibration would be a new diagnostic record; it was not run in this examination.