AI4Math

2core

16adjacent

71downweighted

0warnings

Today's Scan

Start with Autoformalizing Argumentative Material Inferences, then Transformed in Translation: Two-Stage Structural Uncertainty in LLM-Based Scientific Autoformalization. 18 fresh useful item(s) are inside the 21-day content window.

Source Mix

arXiv17
GitHub1

Best Use

Open only the first lane during a busy morning. Older recurring seeds are kept below the daily scan instead of competing with fresh items.

Start Here

The top few items most likely to matter for formal proof agents or Lean-facing AI4Math work.

core score 9.5 2026-09-15 arXiv

Autoformalizing Argumentative Material Inferences

Xin Quan, Reto Gubelmann, André Freitas

Natural language arguments are compelling before they are formally explicit. A premise supports a claim through defeasible warrants, background commitments, and exception conditions that the text leaves implicit. However, formal verification requires the op...

Why it matters Most relevant if you are tracking proof-search loops that use verifier feedback instead of treating Lean as a binary oracle.

Skim cue Skim which definitions entered Lean and whether the work adds reusable library surface.

Read if Read if you have 5 minutes and want a direct AI4Math signal.

autoformalizationverifier feedback

Open PDF Semantic Scholar

core score 6.5 2026-09-13 arXiv

Transformed in Translation: Two-Stage Structural Uncertainty in LLM-Based Scientific Autoformalization

Andre Panossian

Scientific autoformalization turns verbal accounts into executable mathematics, but executable code does not settle which model has been constructed. We examine two sources of structural uncertainty: the formalizer that generates a response law, and the rec...

Why it matters Most relevant if you are tracking proof-search loops that use verifier feedback instead of treating Lean as a binary oracle.

Skim cue Skim which definitions entered Lean and whether the work adds reusable library surface.

Read if Read if you have 5 minutes and want a direct AI4Math signal.

autoformalizationverifier feedback

Open PDF Semantic Scholar

adjacent score 4.9 2026-09-13 arXiv

The Colomo-Pronko conjecture for frozen-corner alternating sign matrices

Yinjie Li

We prove the Colomo-Pronko conjecture for alternating sign matrices with a prescribed square of zeros at a corner, for all matrix sizes and freezing parameters. A known multiple-integral formula for the frozen-corner count yields determinant representations...

Why it matters Direct Lean signal: likely relevant to the formalization or theorem-proving environment around AI4Math agents.

Skim cue Skim which definitions entered Lean and whether the work adds reusable library surface.

Read if Save for later unless the title matches your current proof-agent work.

AI math reasoningLean proof agents

Open PDF Semantic Scholar

Worth Opening

Good candidates after the first three. These are plausible paper-tab opens, not a mandatory reading list.

adjacent score 4.9 2026-09-12 arXiv

Golden-ratio growth of Conway's subprime closure

Romain Popescu

Let $s(m)$ be the Conway subprime function define the binary operation on the natural numbers $x \circ y= s(x + y)$, and denote by $C_n$, $n \ge 0$, the sequence of subsets of natural numbers defined by $C_0 = \{1\}$, and $C_{n+1} = C_n \cup (C_n \circ C_n)...

Why it matters Direct Lean signal: likely relevant to the formalization or theorem-proving environment around AI4Math agents.

Skim cue Skim which definitions entered Lean and whether the work adds reusable library surface.

Read if Save for later unless the title matches your current proof-agent work.

AI math reasoningLean proof agents

Open PDF Semantic Scholar

adjacent score 3.5 2026-09-15 arXiv

Palindromic Length in Free Groups: Reflections, Noncrossing Matchings, and Catalan Forms

Junjie Liao

Let $F=F(X)$ be a free group of finite rank, with palindromic length taken with respect to the fixed basis $X$. We embed $F$ as the index-two subgroup of the universal Coxeter group $W=F\rtimes_θ\langle t\mid t^2=1\rangle$, where $θ(x)=x^{-1}$ for $x\in X$,...

Why it matters Direct Lean signal: likely relevant to the formalization or theorem-proving environment around AI4Math agents.

Skim cue Skim which definitions entered Lean and whether the work adds reusable library surface.

Read if Save for later unless the title matches your current proof-agent work.

Lean proof agents

Open PDF Semantic Scholar

adjacent score 3.5 2026-09-15 arXiv

On complemented subspaces of $L_1[0,1]$

Antonio Acuaviva

We construct two complemented subspaces of $L_1[0,1]$. The first has the Schur property but fails the Radon--Nikodým property. The second contains a copy of $\ell_2$ but no copy of $L_1[0,1]$. Neither space is isomorphic to a Banach lattice. This gives a ne...

Why it matters Direct Lean signal: likely relevant to the formalization or theorem-proving environment around AI4Math agents.

Skim cue Skim which definitions entered Lean and whether the work adds reusable library surface.

Read if Save for later unless the title matches your current proof-agent work.

Lean proof agents

Open PDF Semantic Scholar

adjacent score 3.5 2026-09-15 arXiv

Formalization of Landau damping in the Vlasov--Poisson equations in Lean

Jacob Bedrossian

We present a formalization in Lean 4 of Mouhot and Villani's theorem on nonlinear Landau damping in $\mathbb T^d$ in all Gevrey regularity indices $s > 1/3$ for small backgrounds.

Why it matters Direct Lean signal: likely relevant to the formalization or theorem-proving environment around AI4Math agents.

Skim cue Skim which definitions entered Lean and whether the work adds reusable library surface.

Read if Save for later unless the title matches your current proof-agent work.

Lean proof agents

Open PDF Semantic Scholar

adjacent score 3.5 2026-09-15 arXiv

Certified Inference and Training for Deep Equilibrium Networks: A Continuation Framework with Polynomial Complexity Guarantees

Alex Borisevich

We develop a certified continuation framework for equilibrium computation and for training deep equilibrium networks (DEQs), with training formulated as interpolation to accuracy $2^{-b}$. For inference, compact input homotopy selects a unique branch from a...

Why it matters Direct Lean signal: likely relevant to the formalization or theorem-proving environment around AI4Math agents.

Skim cue Skim which definitions entered Lean and whether the work adds reusable library surface.

Read if Save for later unless the title matches your current proof-agent work.

Lean proof agents

Open PDF Semantic Scholar

adjacent score 3.5 2026-09-14 arXiv

Protected tails and polynomial-time enumeration of permutations avoiding a direct sum of an increasing pattern and 231

Henning Ulfarsson

We give an exact algorithm counting the permutations that avoid a fixed pattern from the following family: the direct sum of an increasing pattern and the pattern 231. The first members of the family are 1342 and 12453. For each member, the algorithm comput...

Why it matters Direct Lean signal: likely relevant to the formalization or theorem-proving environment around AI4Math agents.

Skim cue Skim which definitions entered Lean and whether the work adds reusable library surface.

Read if Save for later unless the title matches your current proof-agent work.

Lean proof agents

Open PDF Semantic Scholar

adjacent score 3.5 2026-09-14 arXiv

Fast Stencil Computations on a Single Arbitrarily Moving Interval

Aaron Gregory

A stencil computation repeatedly updates every cell of a grid from its neighbours' values at the previous timestep. Simulating T steps on N cells directly costs Theta(NT), and a line of work beginning with Ahmad et al. reduces this by composing many timeste...

Why it matters Direct Lean signal: likely relevant to the formalization or theorem-proving environment around AI4Math agents.

Skim cue Skim which definitions entered Lean and whether the work adds reusable library surface.

Read if Save for later unless the title matches your current proof-agent work.

Lean proof agents

Open PDF Semantic Scholar

adjacent score 3.5 2026-09-14 arXiv

A Lean Paper About Paper: A Formal Framework for Origami

Celio Boulay, Alexander Chai, Anthony Chang et al.

The mathematics of Origami have been well studied and shown to develop several interesting results. We use Lean 4 tactics and build on Mathlib to redefine the 7 Huzita operations as theorems instead of axioms and prove their existence. We develop proofs for...

Why it matters Infrastructure signal: this may improve premise discovery, dependency retrieval, or library navigation for agents.

Skim cue Skim which definitions entered Lean and whether the work adds reusable library surface.

Read if Save for later unless the title matches your current proof-agent work.

Lean proof agents

Open PDF Semantic Scholar

adjacent score 3.5 2026-09-12 arXiv

On the Number of Distinct Topological Bases of a Finite Set of Size $N$

Lars Warren Ericson

For a finite set $S$ with $\lvert S\rvert = N$, the number of families $\mathcal{B} \subseteq \mathcal{P}(S)$ that are topological bases is $\#(N) = \sum_{\mathcal{T} \in \operatorname{Top}(S)} 2^{\lvert\mathcal{T}\rvert - \lvert\mathcal{M}_{\mathcal{T}}\rv...

Why it matters Infrastructure signal: this may improve premise discovery, dependency retrieval, or library navigation for agents.

Skim cue Skim which definitions entered Lean and whether the work adds reusable library surface.

Read if Save for later unless the title matches your current proof-agent work.

Lean proof agents

Open PDF Semantic Scholar

Watch Later

Adjacent formalization or infrastructure signals. Keep them in peripheral vision unless they match an active project.

adjacent score 3.5 2026-09-12 arXiv

Mechanizing Gödel's Incompleteness Theorems and Provability Logic

Shogo Saitou, Mashu Noguchi

We mechanized proof of Gödel's first and second incompleteness theorems, Solovay's arithmetical completeness theorem of \mathbf{GL}, and related results in the Lean 4 theorem prover.

Why it matters Direct Lean signal: likely relevant to the formalization or theorem-proving environment around AI4Math agents.

Skim cue Skim which definitions entered Lean and whether the work adds reusable library surface.

Read if Save for later unless the title matches your current proof-agent work.

Lean proof agents

Open PDF Semantic Scholar

adjacent score 3.5 2026-09-12 arXiv

Gap Entropy and Almost Instance-Wise Optimal Best-Arm Identification

Jiarui Yao, Jiaxi Zhao, Xiangxin Zhou

In the best-arm identification problem, we are given $n$ stochastic arms with unknown means and wish to identify the arm with the largest mean with probability at least $1-δ$, using as few samples as possible. We consider independent Gaussian rewards with u...

Why it matters Direct Lean signal: likely relevant to the formalization or theorem-proving environment around AI4Math agents.

Skim cue Skim the reward construction and whether failures provide dense learning signal.

Read if Save for later unless the title matches your current proof-agent work.

Lean proof agents

Open PDF Semantic Scholar

adjacent score 3.5 2026-09-12 arXiv

Four-arm polyominoes in Golomb's hierarchy: A complete classification with Lean verification

Angel Ivanov Raychev

We classify the polyominoes obtained by adjoining four straight arms to a single square, allowing zero arm lengths, according to their ability to tile rectangles, half-strips, bent strips, quadrants, strips, half-planes, and the plane. We also classify thei...

Why it matters Direct Lean signal: likely relevant to the formalization or theorem-proving environment around AI4Math agents.

Skim cue Skim which definitions entered Lean and whether the work adds reusable library surface.

Read if Save for later unless the title matches your current proof-agent work.

Lean proof agents

Open PDF Semantic Scholar

adjacent score 2.0 2026-09-16 GitHub

leanprover-community/mathlib4: fix(Algebra/MonoidWithZeroHom): normalize to `.toMonoidWithZeroHom` (#43728)

Jiedong Jiang

Recent commit on leanprover-community/mathlib4.

Why it matters Infrastructure signal: this may improve premise discovery, dependency retrieval, or library navigation for agents.

Skim cue Skim only the changed subsystem and whether it affects your Lean workflow.

Read if Open only if you are debugging Lean or mathlib locally.

seed author: Jiedong Jiang

Open Semantic Scholar

adjacent score 1.9 2026-09-14 arXiv

Optimal entanglement-assisted source coding under a balanced-difference promise

Julius A. Zeiss

Entanglement can reduce the communication required for coding tasks, but establishing the minimum achievable cost is essential to understanding its limits. We address this question in a zero-error source-coding task where Alice receives a word and Bob knows...

Why it matters Adjacent signal: scan the abstract for a concrete connection to formal proof, verification, or proof-agent evaluation.

Skim cue Skim which definitions entered Lean and whether the work adds reusable library surface.

Read if Save for later unless the title matches your current proof-agent work.

AI math reasoning

Open PDF Semantic Scholar

adjacent score 1.9 2026-09-12 arXiv

A Bound Below 2.8 for Tuza's Conjecture

Sichen Wang

Let $ν(G)$ be the maximum number of edge-disjoint triangles in a graph $G$ and $τ(G)$ the minimum number of edges meeting every triangle. Tuza conjectured that $τ(G)\le 2ν(G)$. We prove that $τ(G)\le (165/59)ν(G)$. The constant $165/59\approx 2.797$ improve...

Why it matters Adjacent signal: scan the abstract for a concrete connection to formal proof, verification, or proof-agent evaluation.

Skim cue Skim the abstract first; open the paper only if the method touches proof agents or formal verification.

Read if Save for later unless the title matches your current proof-agent work.

AI math reasoning

Open PDF Semantic Scholar

Older but Useful

0 relevant item(s) are outside the 21-day content window. Keep them for context, but do not let them drive today's scan.

No older useful items were retained in this run.

Downweighted 71 low-priority match(es), folded for daily reading.

negative score 0.8 2026-09-16 GitHub

leanprover/lean4: fix: link the bundled Rust checkers against the toolchain's sysroot (#15173)

Sebastian Ullrich

Recent commit on leanprover/lean4.

Why it matters Toolchain signal: open only if the commit touches proof search, elaboration, tactics, Lake, or mathlib behavior you depend on.

Skim cue Skim only the changed subsystem and whether it affects your Lean workflow.

Read if Open only if you are debugging Lean or mathlib locally.

Open Semantic Scholar

negative score 0.8 2026-09-16 GitHub

leanprover/lean4: chore: update ci after mathlib renamed a file (#15184)

Garmelon

Recent commit on leanprover/lean4.

Why it matters Infrastructure signal: this may improve premise discovery, dependency retrieval, or library navigation for agents.

Skim cue Skim only the changed subsystem and whether it affects your Lean workflow.

Read if Open only if you are debugging Lean or mathlib locally.

Open Semantic Scholar

negative score 0.8 2026-09-16 GitHub

leanprover/lean4: chore: add downstream labels with app token (#15185)

Garmelon

Recent commit on leanprover/lean4.

Why it matters Toolchain signal: open only if the commit touches proof search, elaboration, tactics, Lake, or mathlib behavior you depend on.

Skim cue Skim only the changed subsystem and whether it affects your Lean workflow.

Read if Open only if you are debugging Lean or mathlib locally.

Open Semantic Scholar

negative score 0.8 2026-09-16 GitHub

leanprover-community/mathlib4: refactor(GroupTheory/Subgroup/Simple): make normality an instance argument in `IsSimpleGroup` (#43864)

Xavier Roblot

Recent commit on leanprover-community/mathlib4.

Why it matters Infrastructure signal: this may improve premise discovery, dependency retrieval, or library navigation for agents.

Skim cue Skim only the changed subsystem and whether it affects your Lean workflow.

Read if Open only if you are debugging Lean or mathlib locally.

Open Semantic Scholar

negative score 0.8 2026-09-16 GitHub

leanprover-community/mathlib4: fix(Tactic/Inclusion): record the module registering an inclusion family (#43784)

Kim Morrison

Recent commit on leanprover-community/mathlib4.

Why it matters Infrastructure signal: this may improve premise discovery, dependency retrieval, or library navigation for agents.

Skim cue Skim only the changed subsystem and whether it affects your Lean workflow.

Read if Open only if you are debugging Lean or mathlib locally.

Open Semantic Scholar

negative score 0.8 2026-09-16 GitHub

leanprover-community/mathlib4: feat: geometric series in `WithLp 1 (Unitization 𝕜 A)` are summable if they are in `A` (#42779)

Jireh Loreaux

Recent commit on leanprover-community/mathlib4.

Why it matters Infrastructure signal: this may improve premise discovery, dependency retrieval, or library navigation for agents.

Skim cue Skim only the changed subsystem and whether it affects your Lean workflow.

Read if Open only if you are debugging Lean or mathlib locally.

Open Semantic Scholar

negative score 0.8 2026-09-16 GitHub

leanprover-community/mathlib4: feat(TacticAnalysis): tag pass messages with the linter option name (#43399)

Jesse Alama

Recent commit on leanprover-community/mathlib4.

Why it matters Infrastructure signal: this may improve premise discovery, dependency retrieval, or library navigation for agents.

Skim cue Skim only the changed subsystem and whether it affects your Lean workflow.

Read if Open only if you are debugging Lean or mathlib locally.

Open Semantic Scholar

negative score 0.8 2026-09-16 GitHub

leanprover-community/mathlib4: feat(LinearAlgebra/ExteriorPower): add HodgeStar (#43140)

Kirill Kondrashov

Recent commit on leanprover-community/mathlib4.

Why it matters Infrastructure signal: this may improve premise discovery, dependency retrieval, or library navigation for agents.

Skim cue Skim only the changed subsystem and whether it affects your Lean workflow.

Read if Open only if you are debugging Lean or mathlib locally.

Open Semantic Scholar

Source Health

Warnings are preserved so failed sources do not silently disappear from the brief.

None