Metraipolis › archive › dc_726dcd0549b3

SemantEq: Faithful Bidirectional Equivalence of Formal Statements — arXiv:2610.32919

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.32919
License (as archived)
CC0-1.0
Archived
2026-10-26T19:50:49.756Z
SHA-256 of the archived text
d8fe4d7defdb3be78909b989a485b0d14df560ad3d78e30d0c21ab1c5ad73c99
Stable URL of this page
https://metraipolis.com/documento/dc_726dcd0549b3

How to cite

SemantEq: Faithful Bidirectional Equivalence of Formal Statements — arXiv:2610.32919 — arXiv (en), https://arxiv.org/abs/2610.32919 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_726dcd0549b3 (Metraipolis archive dc_726dcd0549b3, sha256 d8fe4d7defdb3be78909b989a485b0d14df560ad3d78e30d0c21ab1c5ad73c99)
BibTeX
@misc{dc726dcd0549b3,
  title = {SemantEq: Faithful Bidirectional Equivalence of Formal Statements — arXiv:2610.32919},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.32919},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_726dcd0549b3; sha256 d8fe4d7defdb3be78909b989a485b0d14df560ad3d78e30d0c21ab1c5ad73c99},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.32919. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Statement autoformalization translates mathematics from natural language into a proof assistant such as Lean 4, and models now do it at scale. As provers get stronger, the burden of correctness shifts from the proof to the statement, that is, to whether the formal statement faithfully translates its source. Given a trusted reference formalization, the natural test is logical equivalence, and it proves too much. $P \leftrightarrow Q$ holds trivially for any two statements $P$ and $Q$ that the library proves, because a prover can prove each separately and pass through $P \leftrightarrow \mathrm{True} \leftrightarrow Q$. The stronger the prover, the more unrelated pairs pass. Earlier methods restrict the prover and check that each proof names the other statement. We introduce SemantEq, a more principled relation that instead requires each statement to turn into the other only through a chain of allowed steps, such as logical rearrangement and rewriting with the library's own equations. Our programs judge a proof by the proof term Lean checks, not by its tactic script. SemantEq-Eval, a search without a model, reaches 100% precision and 65.6% recall on the ProofNetVerif test split under our adjudicated labels, against 95.8% and 61.8% for BEq+, and an 8.9-fold increase in its CPU time adds at most three pairs. A language model finds more proofs, but under two of four prompts it proves both directions of about two in five of the non-equivalent pairs. SemantEq-ProofAudit audits each model-written proof under a policy derived from the relation and accepts none of the 104 non-equivalent pairs, and it raises recall on 407 equivalent pairs from 65.4% to 81.1% under the best prompt. Separating the generation of equivalence proofs from their acceptance lets a stronger prover raise recall without changing what an acceptance means. We release code and data at: this https URL

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno).
Categorie arXiv: Artificial Intelligence (cs.AI) ; Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2610.32919 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-26T19:45:33.340Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).