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.

Proposed full disproof of the translated-annulus conjecture for subtree roots. The construction gives an infinite family of trees of diameter four with roots strictly inside the conjectured forbidden disk.

Files

Run the exact checks with python check.py.

The assertion disproved is Brown–Mol's Conjecture 4.2 (2018 preprint; 2020 publication), repeated as Conjecture 5.1 by Jin, Ma, and Wang in arXiv:2608.07898v2 (2026). Their theorem for the disk centered at zero is a distinct, established result.

An earlier ArtificialZeng archive result was checked and concerns trees of diameter at most three only. Its full arbitrary-tree problem is explicitly left open. The present counterfamily has diameter four for every parameter at least two. No claim is made about the conjecture's separate outer radius inequality.

Repository coordination: issue #210. Independent mathematical, root, and documented priority reviews passed. The argument remains unrefereed; internal review is not journal peer review. Lean checks the actual 1001-vertex counterexample and proves that all sufficiently large trees in the construction have diameter four and a nonzero subtree root in the forbidden disk, counting their actual connected induced vertex sets. Standalone strict source, axiom audit and kernel replay passed; the combined gate is pending. The current audit found no earlier full resolution within its documented coverage.