arXiv AI By Yupei Li, Philipp Borchert, Gerasimos Lampouras

TopoAlign: A Framework for Aligning Code to Math via Topological Decomposition

Read the original on arXiv AI →

The paper introduces TopoAlign, a framework that repurposes code repositories to train Math LLMs by decomposing code into docstrings, main functions, and dependency functions and reassembling them into structures that mirror formal mathematical statements. Using this approach, the authors train three state‑of‑the‑art models—DeepSeek‑Math, Qwen‑3, and Herald—and evaluate them on MiniF2F, Putnam, and ProofNet benchmarks. TopoAlign yields significant performance gains, notably a 17.77% improvement on BEq@10 and a 68.82% boost on typecheck@10 for DeepSeek‑Math, while also providing modest gains for Herald.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Jul 23

Euclean: Automated Geometry Problem Formalization with Unified Verification in Lean

arXiv:2607. 19374v1 Announce Type: new Abstract: Recent formal reasoning systems have reached IMO-level performance, yet they leave a fragmented landscape: algebra and number theory are handled in Lean, while geometry still relies on domain-specific languages with limited formal guarantees.

By Linbin Tang, Jingyan You, Zilin Kang, Hanzhang Liu, Sophia Zhang, Zenan Li, Chenrui Cao, Liangcheng Song, Jiaao Wu, Xian Zhang, Fan Yang
arXiv AI
Aug 17

MathForm: Scaling Mathematical Autoformalization with Knowledge Retrieval and Verification-Guided Refinement

arXiv:2608. 14221v1 Announce Type: new Abstract: Autoformalization is commonly framed as translating natural-language mathematical statements into machine-verifiable formal languages such as Lean 4.

By Lushi Pu, Weiming Zhang, Xinheng Xie, Zixuan Fu, Bingxiang He, Hengyu Zhao, Hongya Lyu, Xin Li, Jie Zhou, Yudong Wang
arXiv AI
Jun 16

Formalize Once, Edit the Rest: Efficient Lean-Based Answer Selection for Math Reasoning

arXiv:2606. 15972v1 Announce Type: cross Abstract: With large language models (LLMs) increasingly applied to mathematical reasoning, formal proof assistants such as Lean can be leveraged to verify reasoning outputs with machine-checkable rigor, enabling use cases such as answer selection in test-time scaling with K sampled candidate answers.

By Ji Feng, Zhouxing Shi
arXiv AI
Sep 30

Sage: Formalization with Semantic Correction

arXiv:2609.35790v1 Announce Type: cross Abstract: While neural theorem provers have achieved impressive milestones in formal mathematics, they largely operate on the assumption that faithful Lean 4 f...

By Thomas Hirtz, Farzad Jafarrahmani, Abdelmouksit Sagueni, Xiang Zhou, Wengping Deng, Liang Zhang