Brown–Mol's conjecture

What Lean checks

Lean proves the explicit 1001-vertex counterexample and that all sufficiently large members of the literal tree family have diameter four and a nonzero subtree root in the forbidden disk. It counts actual connected induced vertex sets and establishes the infinite family through local analytic inverses and logarithmic derivatives. Strict standalone compilation, all-owned axiom audit and stock-kernel replay passed; the combined repository gate is pending.

Status: complete proposed counterfamily; independent mathematical, root, and documented priority reviews passed. The proof remains unrefereed. Date: 21 November 2026.

The conjecture

Brown and Mol's Conjecture 4.2 in On the roots of the subtree polynomial, arXiv:1810.08655v1 (2018), published in European Journal of Combinatorics 89 (2020), 103181, asserts that every zero of the subtree polynomial of a tree of order n≥2n\ge2 belongs to

{z∈ℂ:12≤|z+12|≤12+(n−1)1/(n−1)}.\left\{z\in\mathbb C: \frac12\le\left|z+\frac12\right| \le\frac12+(n-1)^{1/(n-1)}\right\}.

The subtree polynomial counts nonempty connected induced vertex sets by their order. The conjecture is repeated, still open, as Conjecture 5.1 on printed page 16 of Jin, Ma, and Wang's Proof of a Brown–Mol conjecture on subtree roots, arXiv:2608.07898v2 (14 August 2026). That paper proves the distinct disk bound centered at zero; it does not prove this translated annulus assertion.

Primary sources:

We construct trees whose subtree polynomials have zeros strictly inside the forbidden inner disk. This disproves the full universal annulus conjecture once. No claim is made here about its outer bound.

A family of trees

For every positive integer rr, let TrT_r have a central vertex vv, adjacent to vertices u1,…,uru_1,\ldots,u_r, with four further leaves adjacent to each uju_j. There are no other edges. Thus TrT_r is a tree of order 5r+15r+1.

Put

a(z)=1+z(1+z)4,b(z)=(1+z)4+4.a(z)=1+z(1+z)^4,\qquad b(z)=(1+z)^4+4.

The subtree polynomial is exactly

ΦTr(z)=z(a(z)r+rb(z)).\Phi_{T_r}(z)=z\bigl(a(z)^r+r b(z)\bigr). \tag{1}

Indeed, a subtree containing vv makes an independent choice in each branch: either omit that whole branch, or include uju_j and any subset of its four leaves. This gives za(z)rz a(z)^r. A subtree avoiding vv lies within one of the rr copies of K1,4K_{1,4}. Each copy has polynomial z(1+z)4+4z=zb(z)z(1+z)^4+4z=z b(z), giving the other term in (1).

A regular point inside the forbidden disk

Let t0t_0 be the unique real solution in (0,1/12)(0,1/12) of

(t+14)4+3t−14=0.\left(t+\frac14\right)^4+3t-\frac14=0. \tag{2}

Existence follows because the left side is −63/256-63/256 at zero and 1/811/81 at 1/121/12. Uniqueness follows from its strictly positive derivative 4(t+1/4)3+34(t+1/4)^3+3 on that interval. Define

z0=−12+it0.z_0=-\frac12+i\sqrt{t_0}.

This point satisfies |z0+1/2|=t0<1/12<1/2|z_0+1/2|=\sqrt{t_0}<1/\sqrt{12}<1/2.

For z=−1/2+iyz=-1/2+iy, write t=y2t=y^2 and q=t+1/4q=t+1/4. Since z=−1+z¯z=-\overline{1+z},

z(1+z)4=−q(1+z)3,|a(z)|2−1=q(q4+3t−14).z(1+z)^4=-q(1+z)^3, \qquad |a(z)|^2-1 =q\left(q^4+3t-\frac14\right). \tag{3}

Equations (2)–(3) give |a(z0)|=1|a(z_0)|=1. Moreover,

a′(z)=(1+z)3(1+5z),a'(z)=(1+z)^3(1+5z),

so a′(z0)≠0a'(z_0)\ne0, because z0z_0 is nonreal. Finally,

|(1+z0)4|=(t0+1/4)2<19<4,|(1+z_0)^4|=(t_0+1/4)^2<\frac19<4,

and therefore b(z0)≠0b(z_0)\ne0.

Local zero lemma

The general phenomenon that competing exponential terms produce limiting zeros is established prior mathematics. Brown and Otto's 2025 generalized Beraha–Kahane–Weiss theorem permits coefficients polynomial in the sequence index; its published applications concern other graph polynomials. The short local argument below is included for completeness, with the nonzero derivative hypothesis stated explicitly. The new application here is the tree family and the interior point above, not a claim to a new zero-limit principle. See SOURCES.md and ALGEBRA_PRIOR_AUDIT.md for the precise comparison.

Lemma. Let a,ba,b be holomorphic near a point z0z_0. Suppose

|a(z0)|=1,a′(z0)≠0,b(z0)≠0.|a(z_0)|=1,\qquad a'(z_0)\ne0,\qquad b(z_0)\ne0.

Then, for every sufficiently large positive integer rr, the function a(z)r+rb(z)a(z)^r+r b(z) has a zero zrz_r, and the zeros can be chosen so that zr→z0z_r\to z_0.

Proof. Choose a holomorphic branch h(z)=loga(z)h(z)=\log a(z) near z0z_0, with h(z0)=iθh(z_0)=i\theta for some real θ\theta. Since h′(z0)=a′(z0)/a(z0)≠0h'(z_0)=a'(z_0)/a(z_0)\ne0, the holomorphic inverse function theorem gives an inverse z=ψ(u)z=\psi(u) near u0=iθu_0=i\theta.

Choose δ>0\delta>0 small enough that ψ\psi is holomorphic on a neighborhood of the closed disk D={|u−u0|≤δ}D=\{|u-u_0|\le\delta\} and b(ψ(u))b(\psi(u)) has no zeros there. The simply connected disk therefore has a holomorphic logarithm

L(u)=log(−b(ψ(u))).L(u)=\log\bigl(-b(\psi(u))\bigr).

Let M=maxD|L(u)|M=\max_D|L(u)|. For each rr, choose an integer krk_r with |2πkr−rθ|≤π|2\pi k_r-r\theta|\le\pi, and put

ur0=logr+2πikrr.u_r^0=\frac{\log r+2\pi i k_r}{r}.

For all sufficiently large rr,

rδ−logr−π>M.r\delta-\log r-\pi>M. \tag{4}

On the boundary of DD we then have

|r(u−ur0)|≥rδ−logr−π>M≥|L(u)|.|r(u-u_r^0)|\ge r\delta-\log r-\pi>M\ge|L(u)|.

Rouché's theorem shows that r(u−ur0)−L(u)r(u-u_r^0)-L(u) has exactly one zero uru_r in the disk, since ur0u_r^0 is inside it by (4). At that zero,

erur=exp(logr+2πikr+L(ur))=−rb(ψ(ur)).e^{r u_r} =\exp(\log r+2\pi i k_r+L(u_r)) =-r b(\psi(u_r)).

Thus zr=ψ(ur)z_r=\psi(u_r) is a zero of a(z)r+rb(z)a(z)^r+r b(z). Moreover,

|ur−u0|≤logr+π+Mr→0,|u_r-u_0| \le\frac{\log r+\pi+M}{r}\longrightarrow0,

so zr→z0z_r\to z_0. This proves the lemma.

Disproof

Apply the lemma to the polynomials a,ba,b above and the point z0z_0 from (2). Since the open disk |z+1/2|<1/2|z+1/2|<1/2 contains z0z_0, it also contains zrz_r for every sufficiently large rr. These points are nonzero because their limit z0z_0 is nonzero. Equation (1) makes them subtree roots of the trees TrT_r.

Consequently, for every sufficiently large positive integer rr, the tree TrT_r violates the inner inequality in Brown–Mol's annulus conjecture. The construction is an infinite counterfamily to the entire universal assertion.

The proof uses exact identities and a local analytic argument. Numerical root approximations are unnecessary for its validity. The phrase “sufficiently large” is an ordinary quantified existence statement proved by (4); no computational search or unproved numerical threshold is used.

Supplementary exact finite witness

The preceding argument already proves the infinite counterfamily. For a separate concrete witness, take r=200r=200, so T200T_{200} has 10011001 vertices. Let

P(z)=a(z)200+200b(z),c=−2340+1750i,ρ=11000.P(z)=a(z)^{200}+200b(z),\qquad c=-\frac{23}{40}+\frac{17}{50}i,\qquad \rho=\frac1{1000}.

All the following checks are rational and are reproduced by check.py:

|P(c)|<25,|P′(c)|>61000.|P(c)|<25,\qquad |P'(c)|>61000. \tag{5}

For the first inequality the verifier bounds the modulus by the sum of the absolute real and imaginary parts. For the second it bounds the modulus below by the larger absolute component. The values of P(c)P(c) and P′(c)P'(c) are evaluated as exact Gaussian rationals, without root approximation.

On |z−c|≤ρ|z-c|\le\rho, elementary squared-modulus checks and the triangle inequality give

|1+z|<1120,|1+5z|<135,|2+5z|<2,|a(c)|<517500.|1+z|<\frac{11}{20},\quad |1+5z|<\frac{13}{5},\quad |2+5z|<2,\quad |a(c)|<\frac{517}{500}.

Using a′(z)=(1+z)3(1+5z)a'(z)=(1+z)^3(1+5z), a″(z)=4(1+z)2(2+5z)a''(z)=4(1+z)^2(2+5z), and b″(z)=12(1+z)2b''(z)=12(1+z)^2, set

d1=1730340000,d2=12150,α=4137730340000000.d_1=\frac{17303}{40000},\quad d_2=\frac{121}{50},\quad \alpha=\frac{41377303}{40000000}.

Then |a′|<d1|a'|<d_1, |a″|<d2|a''|<d_2, and |a(z)|<α|a(z)|<\alpha on this disk. Consequently,

|P″(z)|<200⋅199α198d12+200α199d2+200⋅12(11/20)2<7000000.|P''(z)| <200\cdot199\,\alpha^{198}d_1^2 +200\alpha^{199}d_2 +200\cdot12(11/20)^2 <7000000. \tag{6}

The last comparison is again an exact rational inequality. The Taylor remainder bound from (6) gives, on |z−c|=ρ|z-c|=\rho,

|P(z)−P′(c)(z−c)|≤|P(c)|+12sup|P″|ρ2<25+72=572<61<|P′(c)(z−c)|.|P(z)-P'(c)(z-c)| \le |P(c)|+\frac12\sup|P''|\rho^2 <25+\frac72=\frac{57}{2}<61 <|P'(c)(z-c)|.

Rouché's theorem therefore gives exactly one zero of PP in this disk. Finally,

|c+12|2=484940000<(720)2,720+ρ<12.\left|c+\frac12\right|^2=\frac{4849}{40000} <\left(\frac7{20}\right)^2, \qquad \frac7{20}+\rho<\frac12.

The entire certificate disk lies strictly inside the forbidden inner disk and does not contain zero. Hence this zero is a subtree root of T200T_{200} violating the conjecture. The verifier also checks the subtree identity by independent connected-set enumeration for r=1,2,3r=1,2,3 and checks (3) as a formal polynomial identity. These finite checks support the construction; the infinite-family conclusion rests on the analytic proof above.