Papers › Autoformalizing Euclidean Geometry

Autoformalizing Euclidean Geometry

27 May 2024arXiv:2405.17216archive 2025-07-28

Logan Murphy, Kaiyu Yang, Jialiang Sun, Zhaoyu Li, Anima Anandkumar, Xujie Si

Autoformalization involves automatically translating informal math into formal theorems and proofs that are machine-verifiable. Euclidean geometry provides an interesting and controllable domain for studying autoformalization. In this paper, we introduce a neuro-symbolic framework for autoformalizing Euclidean geometry, which combines domain knowledge, SMT solvers, and large language models (LLMs). One challenge in Euclidean geometry is that informal proofs rely on diagrams, leaving gaps in texts that are hard to formalize. To address this issue, we use theorem provers to fill in such diagrammatic information automatically, so that the LLM only needs to autoformalize the explicit textual steps, making it easier for the model. We also provide automatic semantic evaluation for autoformalized theorem statements. We construct LeanEuclid, an autoformalization benchmark consisting of problems from Euclid's Elements and the UniGeo dataset formalized in the Lean proof assistant. Experiments with GPT-4 and GPT-4V show the capability and limitations of state-of-the-art LLMs on autoformalizing geometry problems. The data and code are available at https://github.com/loganrjmurphy/LeanEuclid.

PaperPDFCodeCode Syntology ranMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 13 code samples harvested from 1 repository linked to this paper: 9 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 2 violated, 1 with no contract checked; 5 where Syntology's instrument failed) · 4 unverified. Where Syntology's instrument failed: 5 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 13 samples from 1 repository, 9 ran (4 with no instrument failure; 5 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-22 and 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

loganrjmurphy/leaneuclid officialmentioned in papermentioned on GitHubSyntology: 13 samples, 9 ran (5 instrument-failed) · 4 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

13 samples harvested: 9 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 2 violated, 1 with no contract checked; 5 where Syntology's instrument failed) · 4 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · honoured contract
2ran · violated contract
5ran · our draft was wrong
1ran
4unverified

Licence: 0 of the 13 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from loganrjmurphy/leaneuclid. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

loganrjmurphy/leaneuclid official repository 13 samples, 9 ran (5 instrument-failed) · 4 unverified
PermutationStruct E3/Engine/choosePerms.py ran · metamorphic tier: deterministic MIT (permissive) · b17a3745345f3d22 · report fixture: returned bool · level recorded 2026-09-22
checkPerm E3/Engine/choosePerms.py ran · honoured contract MIT (permissive) · f93e2527f3540da6 · report fixture: signature names:list/1/str, target:str/0/str, reference:str/0/str, guarded:list/1/str · returned float · level recorded 2026-09-24
choosePermutations E3/Engine/choosePerms.py ran · our draft was wrong MIT (permissive) · 9ccf4b01d9d2129a · report fixture: signature ground:PropData/0/?, test:PropData/0/?, univ:PermutationStruct/0/?, exist:PermutationStruct/0/?, target:str/0/str, reference:str/0/str, N:int/0/int · returned tuple · level recorded 2026-09-22
has_match E3/Engine/choosePerms.py ran · violated contract MIT (permissive) · e9a46f8957968943 · report fixture: signature x:PropData/0/?, y:PropData/0/? · returned bool · level recorded 2026-09-22
has_permutation E3/Engine/choosePerms.py ran · violated contract MIT (permissive) · 4f18707c98469c94 · report fixture: signature x:QuantifierData/0/?, y:QuantifierData/0/? · returned bool · level recorded 2026-09-22
is_permutation E3/Engine/choosePerms.py ran · our draft was wrong MIT (permissive) · fdfee91915c790f0 · report fixture: signature list1:list/1/int, list2:list/1/int · returned bool · level recorded 2026-09-24
removeGuards E3/Engine/choosePerms.py ran · our draft was wrong MIT (permissive) · cb6fe1699a17fcb6 · report fixture: signature data:list/1/str · returned list · level recorded 2026-09-22
remove_all_guards E3/Engine/choosePerms.py ran · our draft was wrong MIT (permissive) · 76c240a8d6747abf · report fixture: signature x:PropData/0/? · returned PropData · level recorded 2026-09-22
replaceGuards E3/Engine/choosePerms.py ran · our draft was wrong MIT (permissive) · 78112d3724540dc8 · report fixture: signature data:list/1/str · returned list · level recorded 2026-09-22
NameMap E3/Engine/choosePerms.py unverified MIT (permissive) · bb00132b7cffb7fb · report
PropData E3/Engine/choosePerms.py unverified MIT (permissive) · 1160a348cb5575f9 · report
QuantifierData E3/Engine/choosePerms.py unverified MIT (permissive) · 3e48503267b317e0 · report
checkAndInsert E3/Engine/choosePerms.py unverified MIT (permissive) · 63f2931afa6efafd · report

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it.

1 assembly on this paper: 1 harvested, 0 generated.

harvested Assembly for neuro-symbolic framework for autoformalizing Euclidean geometry (graph method: neuro-symbolic framework for autoformalizing Euclidean geometry). 13 bricks; individually on a fixture: 9 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 2 violated, 1 with no contract checked; 5 where Syntology's instrument failed) · 4 unverified. The assembly has not been run end-to-end.

  1. choosePermutations entry · level 1 · ran · our draft was wrong · 9ccf4b01d9d2129a
  2. NameMap helper · level 0 · unverified · bb00132b7cffb7fb
  3. PermutationStruct helper · level 1 · ran · b17a3745345f3d22
  4. PropData helper · level 0 · unverified · 1160a348cb5575f9
  5. checkAndInsert helper · level 0 · unverified · 63f2931afa6efafd
  6. checkPerm helper · level 1 · ran · honoured contract · f93e2527f3540da6
  7. has_match helper · level 1 · ran · violated contract · e9a46f8957968943
  8. remove_all_guards helper · level 1 · ran · our draft was wrong · 76c240a8d6747abf
  9. replaceGuards helper · level 1 · ran · our draft was wrong · 78112d3724540dc8
  10. QuantifierData helper · level 0 · unverified · 3e48503267b317e0
  11. has_permutation helper · level 1 · ran · violated contract · 4f18707c98469c94
  12. removeGuards helper · level 1 · ran · our draft was wrong · cb6fe1699a17fcb6
  13. is_permutation helper · level 1 · ran · our draft was wrong · fdfee91915c790f0

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2405.17216") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Math

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Absolute Position EncodingsAdamAttentionBPEDense ConnectionsDropoutGPT-4Label SmoothingLayer NormalizationLinear LayerMulti-Head AttentionPosition-Wise Feed-Forward LayerResidual ConnectionSoftmaxTransformer

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections