Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Cubic extremizers with critical values on the unit circle
This argument by Plasma AI concerns Problem 114 at the formulation and standing recorded there. It supplies a cubic inequality and its equality case at the tier-1 standing warranted by L144's whole-claim examination and distinct PASS grade; the all-degree question remains open.
The target is the length of the full level set of a monic complex polynomial of the same degree. The held Tao source's Theorem 1.1(iv) asserts the answer only for sufficiently large degrees; Remark 1.3 supplies effectiveness in principle, not a numerical cutoff usable by this argument. Neither an arbitrary finite degree check nor a fine numerical parameter grid completes the all-degree problem.
Tao's Proposition 1.2, citing Eremenko–Hayman Lemmas 5 and 6, supplies some maximizer with all critical values on the unit circle. It does not preserve the length of every polynomial under reduction. The source statements and Tao's short specialization were read. The proof of Eremenko–Hayman Lemma 5 was read in full against the corrected preprint's page images, pp. 5--7, for the deformation used in the uniqueness argument below. Lemma 4, which supplies continuity and existence, is used as a refereed source theorem; its proof is not reconstructed here.
There is a useful exact cubic specialization. Translate a monic cubic to . The operation preserves monicity and length; use it to make real. The critical values are . If both have modulus one, subtraction and addition of their squared moduli give
When , is purely imaginary. A rotation by an integer multiple of , which keeps fixed, makes purely imaginary. If there is no phase restriction on the rotation and the same normalization is possible. Thus one maximizer is isometric to a member of the real family
Conversely these polynomials have critical points and unit-modulus critical values. The parameter gives exactly the real family , , named on the Chatelet claim page. Therefore the family inequality for every would prove the cubic inequality for all complex cubics, using the existence of one extremizer. No assertion about arbitrary cubics having equal length to a family member is needed. This existential reduction alone supplies no family inequality or uniqueness classification. Those are separate obligations, addressed by the argument below. Existence of one specially normalized maximizer cannot by itself classify every maximizer.
The Chatelet claim's analytic chain and external development remain
uninspected. Its declared DomainReductionD3 has a stronger, false every-cubic
length identity, as the claim page records; the claimed formal theorem cannot
be used as evidence for the weaker correct reduction. Closed connected level
sets and connected open sublevel sets must also be distinguished: has
petals meeting on the boundary.
The family inequality and the composed argument
The family inequality is proved, by an argument independent of the Chatelet chain, in the independently graded claim L144: for the lemniscate of is strictly shorter than that of . The route is as follows.
- Writing , the lemniscate of is of the circle , which passes through both critical values . The roots of satisfy , and the substitution gives every reciprocal derivative in closed form. The length is a single integral over the circle with two explicit inverse-square-root singularities.
- The same integral for is , nondecreasing in and equal to the target length at . Scaling by writes the length of as , where integrates a fixed function over a circle through . For small it is enough that , and the tail of that integral has an explicit bound.
- Ball arithmetic bounds for and the length itself for larger , uniformly over parameter boxes covering the whole range, including the degenerate endpoint where the critical points merge.
Combined with the existential reduction above, this proves the degree-3 inequality for every monic complex cubic, at the standing recorded on the claim: tier 1 and computer-assisted, with the identified Eremenko–Hayman Lemmas 4 and 5 interfaces and the original Beltrami theorem boundary qualified in the verification record.
The small-parameter estimate resolves the singular scale directly. Under and , the inverse-derivative density becomes the fixed function , and the critical values remain at . The parameter dependence moves into the circle of integration. The head, critical window and tail bounds cover its limiting degeneration uniformly, without a positive lower cutoff on .
Uniqueness
The proof of Lemma 5 is stronger than its statement. For every extremal polynomial and every critical value off the unit circle, its quasiconformal deformation moves that critical value through a small disc, keeps the other critical values fixed, and keeps the length constant. For a cubic with two distinct critical values this lets one move them, at constant maximal length, to two distinct points of the circle; the limit is again a maximizer by continuity of length, and it is a family member with , which the family inequality excludes. A maximizer with a double critical point is , whose length or is maximal only at . Hence is, up to rotation and translation, the only cubic maximizer; Section 8 of the L144 proof gives the details. The deformation was read on the page images of the corrected preprint (pp. 5--7).
What remains
The degree-3 case has a whole-claim examination and distinct passing grade, covering the argument, its uniform ball-arithmetic program and uniqueness. The record retains its source boundaries, exposure rulings and failed auxiliary diagnostic predicates. The remaining intermediate degrees outside the range of Tao's preprint are not settled by this argument. The method uses the one-parameter cubic normalization; higher degrees require an additional uniform analysis.
Source interfaces
The linked source records identify the inputs used at the reading depths specified above. A result account is not a check of the source's proof.