可探索的定理:通过将其基于形式化表示来使书面定理可探索
Explorable Proofs: Making Written Proofs Explorable by Grounding Them in Formal Representations
AI总结:
本文提出可探索的定理系统,利用LLM将定理和证明转化为Lean语言,使用户能交互式地逐步验证证明并测试例子,提升数学理解。
摘要:
LLM生成的解释可以提高技术内容的可访问性,但交互能力存在上限。由于LLM输出是静态文本,无法执行或逐步追踪。我们主张通过形式化表示来支撑解释,以实现超越静态文本的交互功能。我们为数学证明理解实例化这一想法,提出可探索的定理系统,利用LLM将定理及其书面证明翻译成Lean,一种用于机器验证证明的编程语言,并将书面证明与Lean代码链接。读者可以以步骤级粒度逐步验证证明,测试自定义例子或反例,并追踪连接每个步骤的逻辑依赖关系。每个完成的步骤都是通过在Lean证明上执行该示例并提取其中间状态生成的。一项用户研究(n=16)显示了这种方法的潜力:在证明阅读任务中,拥有提供的可探索性功能的参与者在回答理解问题时给出了更准确、更详细的答案,展示了对基础数学的更强整体理解。
英文摘要:
LLM-generated explanations can make technical content more accessible, but there is a ceiling on what they can support interactively. Because LLM outputs are static text, they cannot be executed or stepped through. We argue that grounding explanations in a formalized representation enables interactive affordances beyond what static text supports. We instantiate this idea for mathematical proof comprehension with explorable theorems, a system that uses LLMs to translate a theorem and its written proof into Lean, a programming language for machine-checked proofs, and links the written proof with the Lean code. Readers can work through the proof at a step-level granularity, test custom examples or counterexamples, and trace the logical dependencies bridging each step. Each worked-out step is produced by executing the Lean proof on that example and extracting its intermediate state. A user study ($n = 16$) shows potential advantages of this approach: in a proof-reading task, participants who had access to the provided explorability features gave better, more correct, and more detailed answers to comprehension questions, demonstrating a stronger overall understanding of the underlying mathematics.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。