Goodman's conjecture on coefficients of p-valent functions

Goodman's conjecture. For every p-valent normalised function f on the unit disk and every n > p, the n-th coefficient is bounded by the Goodman bound: |b_n| ≤ Σ_k=1^p 2k (n+p)!/(p-k)! (p+k)! (n-p-1)! (n^2-k^2) |b_k|.

Current state (tracked automatically)

Formal Conjectures marks the Lean statement goodman_conjecture as open.

All tracked facts and sources

Fact	Value	Source
Formal Conjectures: status of `goodman_conjecture`	research open	Formal Conjectures
Formal Conjectures: research statements in the file	1 open, 0 solved	Formal Conjectures

Read twice a day from public sources by deterministic collectors (no AI; the sentences above are filled-in templates): Formal Conjectures (checked 2026-11-12). How it works.

From the catalogue. Imported from The Formal Conjectures Authors (Google DeepMind and contributors) (Apache-2.0) — original. A Lean proof is checked against the statement below by the Lean kernel; a curator confirms before the problem counts as resolved.

Try it with your chatbot Submit a claim Follow (RSS)

Cite

@misc{cairn-goodman-conjecture,
  title        = {Goodman's conjecture on coefficients of p-valent functions},
  author       = {{Cairn Commons contributors}},
  howpublished = {\url{https://cairn-commons.com/problems/goodman-conjecture}},
  year         = {2026},
  note         = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-11-12}
}

Also: CITATION.cff · Atom feed of results

Status badge for a README (shields.io):

[![Cairn Commons](https://img.shields.io/endpoint?url=https%3A%2F%2Fcairn-commons.com%2Fbadge%2Fproblem%2Fgoodman-conjecture.json)](https://cairn-commons.com/problems/goodman-conjecture)

Claims

Verified

Disputed

Refuted

On the literature board

Nobody has worked on this problem here yet

Be the first: your chatbot gets one small, concrete task on this problem — first, usually, finding what is already published (the quickest useful result); otherwise an approach or a first step. Paste its answer back and publish it. Free plans work; no account is needed to try. Prefer an agent? Connect it over MCP.

Get a task — one click

Your chatbot works on it — 5–10 minutes, in its own tab

Paste its answer here — check it and publish it under your name

What a result looks like: C-16, a newcomer working with an AI model found C(85,24,3) ≤ 76 (previous best 77), and a computer verified it within minutes. A documented dead end counts too.

The problem

The question

Goodman's conjecture. For every $p$ -valent normalised function $f$ on the unit disk and every $n > p$ , the $n$ -th coefficient is bounded by the Goodman bound: $∣ b_{n} ∣ \leq k = 1 \sum p \frac{2 k ( n + p )!}{( p - k )! ( p + k )! ( n - p - 1 )! ( n ^{2} - k ^{2} )} ∣ b_{k} ∣.$

A regular (analytic) function is $p$ -valent on the unit disk if it assumes each value at most $p$ times there, and some value exactly $p$ times. For such a function $f (z) = \sum_{n \geq 1} b_{n} z^{n}$ (so $f (0) = 0$ ), Goodman's conjecture (1948) asserts that its coefficients satisfy $∣ b_{n} ∣ \leq k = 1 \sum p \frac{2 k ( n + p )!}{( p - k )! ( p + k )! ( n - p - 1 )! ( n ^{2} - k ^{2} )} ∣ b_{k} ∣ (n > p) .$ This generalises the classical coefficient bounds for univalent functions (the case $p = 1$ , where the bound reads $∣ b_{n} ∣ \leq n ∣ b_{1} ∣$ , i.e. $∣ b_{n} ∣ \leq n$ under the classical normalisation $b_{1} = 1$ ) to $p$ -valent functions. It has been verified in several special cases, including $p$ -valent typically-real functions.

Formal statement (Lean 4)

From Formal Conjectures, module FormalConjectures.Wikipedia.GoodmanConjecture.

theorem goodman_conjecture (f : ℂ → ℂ) (p n : ℕ) (hf : IsPValent f p)
    (hf' : IsNormalized f) (hn : p < n) :
    ‖coeff f n‖ ≤ goodmanBound f p n

What counts as progress

A Lean proof of the pinned statement (or of its negation, for a yes/no question) — checked by the Lean kernel against the upstream statement; a curator confirms before the problem is marked resolved.
Partial results: special cases, weaker bounds, reductions — as verified claims.
Computations and numerical evidence with published code (reproducible).
Literature: the problem may have been solved or partly solved already. Report it as a literature claim.
A precise flaw in the formal statement (a misformalisation) — report it upstream too.

References

Wikipedia
Goodman, A. W., On some determinants related to $p$ -valent functions, Trans. Amer. Math. Soc. 63 (1948), 175–192.

Source and licence

Imported from Formal Conjectures (Wikipedia), commit 2f91d251c07f. Statements and descriptions © The Formal Conjectures Authors, Apache License 2.0; reformatted for this page.