AFTD Auto-Formalizing Theoretical Domains

What Lean accepted, period by period

Summary Reports

The theorems Lean accepted over a week or a month, told in about ten minutes: what was settled, in which fields, from which papers, and what is still open. Every theorem a report names links to its Lean proof.

7 reports

Weekly2026-W452–8 Nov 202613 min read中文版

Unweighted network games cycle indefinitely, oriented half-covers hold, and ternary zero-sums settled

This week resolved several open questions in network games, directed graphs, fair resource allocation, and additive combinatorics. An explicit network game proved that players can cycle forever through profitable moves even without edge weights and with minimal teams. In graph theory, researchers established half-neighborhood coverage for oriented graphs with kernels in non-neighborhoods and disproved a conjectured cluster partition bound on subcubic networks. Other settled problems include a sharp threshold for three-dimensional zero-sum vector sequences and improved guarantees for dividing indivisible chores between two people.

Proved Unweighted network cut games admit endless cycles of minimal coalitional deviations

Proved Non-neighborhood kernels guarantee weighted half-neighborhood coverage in oriented graphs

Disproved Möbius ladder refutes component-order partition conjecture for subcubic graphs

Partial Minimal zero-sum sequence length in three-dimensional ternary space equals 13

Weekly2026-W4426 Oct – 1 Nov 202613 min read中文版

Social Optima Vulnerable to Coalitions, Latin Tableaux Formula, and Spectral Bounds Refuted

A question in game theory was settled when researchers disproved the conjecture that socially optimal network colorings are always immune to group defections, exhibiting a 182-vertex counterexample. In combinatorics, an exact counting formula for staircase Latin tableaux was proved, and perfect Mondrian partitions were ruled out for all two-prime tile areas. In quantum theory, a proposed universal spectral bound was refuted in all dimensions three and above. Further results proved wild-number formulas and new fairness guarantees.

Disproved Socially optimal cut colorings can fail to be strong equilibria

Partial Conjectured wild number formula proved for all large complete graphs

Proved Exact counting formula proved for Latin tableaux with double-three tails

Proved No integer square admits a perfect rectangle tiling of two-prime area

Disproved Universal spectral bound fails for positive trace-preserving maps in dimension three

Monthly2026-10October 20265 min read中文版

Optimal Graph Partitions, Quantum Parity Bounds, and Tableau Enumeration Settled

This month settled open questions across discrete mathematics. Optimal graph cuts were shown to fail coalitional stability. Exact parity bounds for line cubic circuits were proved. A Latin tableau enumeration formula was established, and squares resist two-prime tile partitions.

Disproved Unweighted Max-3-Cut games can fail to admit any optimal strong equilibrium

Proved Line cubic quantum syndrome has exact size 2n + 1 parity representation

Proved Latin tableaux with double-three tail numbered by closed formula

Partial Squares have no perfect partitions with two-prime tile areas

Weekly2026-W4319–25 Oct 20268 min read中文版

Minimal turn-taking failures, cycle power covering bounds, and negative stamp bases

Key questions were settled across game theory, number theory, and graph algorithms. Strategic turn-taking among three participants was proved fair up to one item for seven items, showing that eight items is the minimal failure point. A problem on covering cycle powers by equivalence graphs was bounded for power seven. New gap and classification results settled the behavior of three-stamp bases with negative denominations, and line cubic syndrome representations were constructed uniformly for all dimensions.

Proved Round-Robin pure Nash equilibria are EF1 for three agents and seven goods

Proved Line cubic syndrome has a parity representation of 2n plus 1 supports

New result Unit gap for negative-allowed three-stamp bases occurs exactly when h is 9 modulo 12

Partial Seventh cycle power requires at least five equivalence subgraphs when eight does not divide n

Weekly2026-W4212–18 Oct 202610 min read中文版

Negative stamp values extend postage range, and mutual information subadditivity fails

This week settled several open problems across discrete mathematics and information theory. It was established that allowing negative denominations strictly increases the consecutive integers reachable by postage stamp combinations. In information theory, subadditivity of mutual information was refuted for Hellinger distance and quarter-power divergences. In graph theory, new findings classified when spectral bounds on clique numbers hold, answered questions about permutation groups generated by graph hops, and established exact covering numbers for powers of cycle graphs.

Proved Four stamps with one negative value reach 99 consecutive postage amounts

Proved Equivalence covering number of cycle cubes equals 4 when length is 2 modulo 4

Proved Complete classification of strong spectral clique bounds for five-block graphs

Disproved Mutual information subadditivity fails for Hellinger divergence and quarter-power divergences

Weekly2026-W415–11 Oct 202614 min read中文版

Pairwise fairness limits for chores, exact poset query complexity, and refuted conjectures

Fair division saw the resolution of several open questions: dividing chores fairly among three people using pairwise shares is impossible in general, the exact welfare guarantee from maximizing product utilities for two people was pinned down, and a graph-connectivity conjecture failed. In algorithms, finding minimal elements in two-chain posets was proved to require strictly more comparisons than conjectured. In mechanism design, counterexamples disproved a dictatorship conjecture for facility location with scaling and refuted two published claims in agency and matching.

Proved PMMS allocations of chores can fail to exist for three agents

Proved Price of maximum Nash welfare for two agents equals 27/23

Disproved Graph linkedness conjecture for two-agent price of connectivity is false

Disproved Deterministic query complexity for minimal elements of width-two posets is 2n − 3

Disproved Dictatorship conjecture for facility location with scaling fails for known scaling functions

Weekly2026-W4028 Sep – 4 Oct 202611 min read中文版

Voting games rigidity, persuasion constants, and limits of strategic stopping rules

This week settled questions across game theory, fair division, and voting. In voting games, swing tables were proved to determine weighted systems uniquely. In Bayesian persuasion, the optimal receiver-utility ratio was fixed at 3/2. In chore division, the worst-case cost of fair allocations was shown to stay strictly below one-half for two people. In strategic games, uniqueness of equilibria failed for publication choice, and static stopping rules failed to remain robust against disguised rewards. Four open implications among discrete fairness criteria were also resolved.

Proved Weighted voting games are uniquely determined by their swing table

Proved The receiver-utility constant in bit-string persuasion is 3/2

Disproved The Publication Choice Problem can have multiple pure-strategy equilibria

Partial Hollow-Shell market has at most ⌊(n−1)²/4⌋ blocking pairs