Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Metadata
slug: minadiaz-rubin-2025-chebyshev-faber-equipotential
bibkey: minadiaz2025chebyshev
doi: null
url: https://arxiv.org/abs/2505.03967v1
triage: theorem
motivation_gids:
  - D5/S3/Analytic/Chebyshev/FaberEquipotentialRefutation.result

Miña-Díaz–Rubin’s Chebyshev–Faber equipotential question

Problem

E. Miña-Díaz and O. Rubin, Chebyshev polynomials on equipotential curves, arXiv:2505.03967v1, Section 2, Problem 2.2:

Suppose the compact set is such that for some , , where is the th monic Faber polynomial associated to the map that satisfies (1.2). Is it true then that for all ?

Here is the unbounded component of , , and , with . When is simply connected, . The equipotential curve is . The polynomial is the polynomial part of at infinity, , and is the unique monic degree- sup-norm minimizer on .

The Lean claim quantifies over exterior maps differentiable and injective on , a positive capacity , compact complement , and a bounded correction for . Its IsMonicFaber requires a monic degree- polynomial with at infinity. Its IsChebyshev compares every uniform real bound for every monic degree- competitor. For compact nonempty sets this expresses sup-norm minimization. The implication asks whether such an Chebyshev on remains Chebyshev on every , .

Motivation

Theorem 2.1 gives as . Equality at every finite radius is stronger than this limit. The declaration D5/S3/Analytic/Chebyshev/FaberEquipotentialRefutation.result proves ¬ claim with , and .

Gap

Preregistration #15412 identifies the tier-1 question and its refutation. Rubin’s Chebyshev polynomials in the complex plane and on the real line, arXiv:2411.14175v2, revised 2026-02-18, still lists it as Problem 5.6. Hübner–Rubin, arXiv:2405.05067, gives rotation-symmetric examples with preserved on equipotentials. Miña-Díaz–Rubin–Wennman, arXiv:2509.22588, concerns asymptotics and does not supply the fixed-degree propagation assertion.

Xiao–Qiu, Acta Mathematica Sinica, Chinese Series 53(2) (2010), 323–328, gives an example where Chebyshev polynomials on a Julia set and its equipotentials differ. Whether that example has on the Julia set is ASSUMED-UNVERIFIED because its full text was not available. The centre criterion is discussed in Triage. These references do not establish an exhaustive priority claim. The source note is Library/Geometry/minadiaz2025chebyshev.md.

Route

Take

For , the proof establishes

This proves injectivity on the closed exterior and two-sided bounds and . Differentiability and the complex open mapping theorem make the open exterior image open; the two-sided bounds make the closed exterior image closed. Connectedness of the exterior of a disc then gives and compactness. Injectivity on the closed exterior puts in . The two opposite endpoints force every degree-one monic competitor to have norm at least , so is Chebyshev on . Also , giving .

The private circle_bound proves, for every and ,

At the competitor therefore has norm at most . But lies on , so has strictly larger norm there. The exact gap is .

Falsifier

The single admissible exterior map, compact complement, degree-one Faber polynomial and radius-two competitor falsify the universal propagation assertion. A norm comparison without injectivity, compactness, the Faber normalization or the initial Chebyshev property would not address the source question; the proof supplies each. No classification of the minimizer on every outer curve is required for this radius-two contradiction.

Evidence

The module’s public definitions are IsChebyshev, IsMonicFaber and claim; its only public theorem is result : ¬ claim. Supporting declarations are private, including perturbation_lipschitz, injective_closed, exterior_bilipschitz, compact_complement, circle_algebra_bound, circle_complex_bound, circle_bound, chebyshev_of_disc and faber. The norm-square estimate in circle_algebra_bound controls the cross term and residual term on a normalized circle. The proof uses exact rational arithmetic, the frozen D5.S3.AnalyticClosure.ComplexPowerDifference.norm_pow_sub_pow_le at , and the pinned Mathlib topological and complex-analytic results. The consumed helpers powers_lipschitz, perturbation_lipschitz, injective_closed and exterior_bilipschitz are bind-only; the per-declaration inventory is in the Lean header. Its accepted axiom closure is ; there is no sorry or additional axiom.

The odd-cubic computation in Triage covers and , with agreement to . No experiment program or certified numerical error bound is available; this computed observation is separate from the Lean counterexample.

Triage

What the settlement shows

  1. Proved (Lean) — degree-one failure. The map above has , but is not Chebyshev on . The proof establishes Lipschitz injectivity, compactness and the enclosing-circle norm bound, including its general form.

  2. Open in Lean (analytic argument) — every radius. Write and . The enclosing-disc bound and identify the minimal enclosing circle as the circle of centre and radius . This gives for every . The full minimizer identification and universal failure are analytic consequences not stated as Lean theorems in this module.

  3. Open here (not formalized; analytic argument) — every degree. For each positive integer , set . Rotation averaging, or the Kamo–Borodin / Novello–Schiefermayr–Zinchenko composition rule, gives the proposed extension

    The Green-function normalization is ; hence radius for maps to radius for . The composition and Faber identifications are not formalized here.

  4. Open in Lean (analytic argument) — minimal-circle interpretation and centre drift for every . Degree-one minimization is the minimal enclosing circle problem. The perturbation , , contributes zero to the centre at and a positive for ; it need not vanish pointwise on the unit circle. Thus the initial equality does not fix the outer centres. Literature-attested (paper, Theorem 2.1; not formalized here) — the limiting statement survives. Since , the analytic family is consistent with .

  5. Open here (composition argument not formalized) — Julia-set criterion. For a monic polynomial , , and centre of the minimal enclosing circle of , the composition rule gives , while , for . A counterexample through these degrees therefore needs and an outer centre that drifts. A rotational symmetry of order at least two about that centre preserves it on equipotentials and prevents this mechanism. Computed — numerical Julia-set probe. For the odd cubics with on levels , the numerical probe found agreement to . There is no certified error bound; this is not a uniform result for all cubics.

  6. Open — additional hypotheses. Does equality propagate when has rotational symmetry of order greater than ? Does it propagate for an analytic boundary if for every ? These sufficient-condition questions are not settled by the Lean counterexample. The rotation-symmetric literature examples supply surviving special cases.

ASSUMED-UNVERIFIED

The full text of Xiao–Qiu (2010) was not available. Whether its example satisfies on the Julia set, equivalently the relevant enclosing-circle centre condition , was not determined. Its reported difference between Julia-set and equipotential Chebyshev polynomials alone does not settle Problem 2.2.

No DOI is recorded, and exhaustive priority is not established. Failure at every , the every-degree pullback extension, the Julia-set composition analysis and the additional- hypothesis questions have no Lean theorem here. The odd-cubic numerics have no experiment program or certified error bound.