Repository navigation
Expand file tree
/
Copy pathindex.html
More file actions
479 lines (467 loc) · 93.7 KB
/
Copy pathindex.html
File metadata and controls
479 lines (467 loc) · 93.7 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
<!doctype html>
<html data-type="software" lang="zh-CN">
<head>
<meta charset="utf-8">
<meta name="page-type" content="software">
<meta name="site-kind" content="software">
<meta name="viewport" content="width=device-width, initial-scale=1">
<meta name="description" content="TheoremOS 数学研究与 Lean 证明工作台:输入自然语言、TeX 或单文件 Lean 草稿,核对陈述、探索证明,查看源码与独立验收记录。目前为白名单内测,平台免费,需自备模型 API Key。">
<meta name="theme-color" content="#faf9f5">
<meta property="og:title" content="TheoremOS | 从原题到 Lean 证明">
<meta property="og:description" content="TheoremOS 数学研究与 Lean 证明工作台:输入自然语言、TeX 或单文件 Lean 草稿,核对陈述、探索证明,查看源码与独立验收记录。目前为白名单内测,平台免费,需自备模型 API Key。">
<meta property="og:type" content="website">
<meta property="og:locale" content="zh_CN">
<meta property="og:image" content="https://theoremos.top/assets/social-preview.png">
<meta name="twitter:card" content="summary_large_image">
<link rel="alternate" hreflang="zh-CN" href="https://theoremos.top/">
<link rel="alternate" hreflang="en" href="https://theoremos.top/en/">
<link rel="icon" type="image/svg+xml" href="assets/mark.svg">
<link rel="stylesheet" href="replay.css">
<link rel="stylesheet" href="landing.css">
<script>document.documentElement.classList.add("m-enter");setTimeout(()=>document.documentElement.classList.add("m-enter-done"),2000)</script>
<link rel="stylesheet" href="assets/moments/counter-rolls/moment.css">
<title>TheoremOS | 从原题到 Lean 证明</title>
<link rel="stylesheet" href="smooth-scroll.css">
<link rel="stylesheet" href="scroll-effects.css">
<link rel="stylesheet" href="hero-parallax.css">
</head>
<body class="landing-page landing-refined landing-product-first">
<header class="site-header nav">
<div class="header-inner wrap">
<a class="skip-link" href="#main">跳到内容</a>
<a class="brand" href="index.html" aria-label="TheoremOS 首页"><img src="assets/mark.svg" alt="" width="31" height="31"><span class="brand-wordmark" aria-hidden="true"><span class="brand-letter">T</span><span class="brand-letter">h</span><span class="brand-letter">e</span><span class="brand-letter">o</span><span class="brand-letter">r</span><span class="brand-letter">e</span><span class="brand-letter">m</span><span class="brand-os"><span class="brand-letter">O</span><span class="brand-letter">S</span></span></span></a>
<nav class="desktop-nav" aria-label="主导航"><a href="#workbench-preview">工作台</a><a href="#demo">证明回放</a><a href="#proofs">证明档案</a><a href="#research-system">深度研究</a><a href="#community">社区共建</a></nav>
<div class="header-actions"><a class="lang-link" href="en/index.html" hreflang="en" lang="en" aria-label="English version">EN</a><a class="nav-start" href="#start" data-umami-event="request-access-nav">申请内测<i data-lucide="arrow-up-right"></i></a><button class="menu-toggle" type="button" aria-label="打开导航" aria-expanded="false" aria-controls="mobile-nav"><i data-lucide="menu"></i><i data-lucide="x"></i></button></div>
</div>
<nav class="mobile-nav wrap" id="mobile-nav" aria-label="手机导航" hidden><a href="#start">申请内测<i data-lucide="arrow-down-right"></i></a><a href="#workbench-preview">研究工作台<i data-lucide="arrow-down-right"></i></a><a href="#demo">验收回放<i data-lucide="arrow-down-right"></i></a><a href="#proofs">证明成果<i data-lucide="arrow-down-right"></i></a><a href="#research-system">深度研究<i data-lucide="arrow-down-right"></i></a><a href="#components">研究组件<i data-lucide="arrow-down-right"></i></a><a href="archive.html">证明档案<i data-lucide="arrow-up-right"></i></a><a href="#community">社区共建<i data-lucide="arrow-down-right"></i></a><a href="feedback.html">反馈与建议<i data-lucide="arrow-up-right"></i></a><a href="https://github.com/LikC1606/TheoremOS" target="_blank" rel="noreferrer">GitHub<i data-lucide="arrow-up-right"></i></a></nav>
</header>
<main id="main" tabindex="-1">
<section class="hero landing-section" id="workbench-preview" tabindex="-1" aria-labelledby="hero-title" data-enter>
<div class="hero-parallax-background" aria-hidden="true"></div>
<div class="wrap hero-product-layout">
<div class="hero-parallax-title">
<div class="hero-text"><div class="hero-copy">
<p class="hero-category">数学研究与 Lean 证明工作台 · 无需安装 Lean</p>
<h1 id="hero-title"><span class="hero-line"><span class="hero-name">把数学想法,</span></span><span class="hero-line"><span class="hero-name">一步步写成<em class="hero-focus">证明</em></span></span></h1>
<div class="hero-details">
<p class="hero-description">用自然语言、TeX 或 Lean 草稿提出问题。先核对陈述与计划,再探索证明,查看源码与独立验收记录。</p>
<div class="hero-actions"><a class="button button-dark" href="#start" data-umami-event="request-access-hero">申请内测<i data-lucide="arrow-up-right"></i></a><a class="button button-outline" href="https://app.theoremos.top/" data-umami-event="open-workbench-hero">已有资格?打开工作台</a></div>
<div class="hero-meta"><p class="hero-practice"><a class="text-link" href="#human-decision">先试试陈述核对<i data-lucide="arrow-down-right"></i></a></p><p class="hero-terms">白名单内测期间平台免费,自备模型 API Key。</p></div>
</div>
</div></div>
</div>
<div class="hero-parallax-media">
<div class="proof-stage hero-proof" id="hero-proof" data-hero-proof data-proof-current="4" data-proof-playing="false" role="group" aria-labelledby="hero-proof-title">
<div class="proof-window">
<div class="proof-chrome">
<div class="proof-title"><h2 id="hero-proof-title">三角展开,如何保持面的对应?</h2><span>TriangleFace · 真实研究回放</span></div>
<div class="hero-proof-controls" hidden><button type="button" data-proof-play aria-pressed="false">播放</button><button type="button" data-proof-restart>重播</button></div>
</div>
<div class="proof-deck">
<div class="proof-pane proof-feed-pane">
<h3 class="proof-pane-head">研究过程<span class="proof-pane-meta">4 个已归档检查节点</span></h3>
<div class="hero-proof-question"><span class="feed-who">原题</span><p>将度三顶点展开成三角形,构造匹配多面体的线性面对应,并保持最小面。</p></div>
<ol class="proof-feed hero-proof-feed">
<li data-proof-entry="1" data-check-id="check-7f3828b042eb20639aad"><span class="feed-who"><span>01 / 构造展开</span><span class="feed-status is-pass">已检查</span></span><p>先证明展开后的顶点能折叠回原顶点。</p></li>
<li data-proof-entry="2" data-check-id="check-91023ca5fd66be269b5b"><span class="feed-who"><span>02 / 刻画切面</span><span class="feed-status is-pass">已检查</span></span><p>把三角形边界的切质量写成原图边坐标之和。</p></li>
<li data-proof-entry="3" data-check-id="check-9cc7d934b222eb94861b"><span class="feed-who"><span>03 / 运输最小面</span><span class="feed-status is-pass">已检查</span></span><p>沿带有线性逆映射的面对应,运输每一点的最小面。</p></li>
<li data-proof-entry="4" data-check-id="check-eabf122f7f3f7b3fffab"><span class="feed-who"><span>04 / 完整原题验收</span><span class="feed-status is-pass">本地通过</span></span><p>合并面对应、互逆映射与最小面运输,完成全部结论。</p></li>
</ol>
</div>
<div class="proof-pane proof-explain-pane">
<h3 class="proof-pane-head">证明成果<span class="proof-pane-meta" data-proof-position>04 / 04</span></h3>
<div class="hero-proof-panel" id="hero-proof-panel-1" data-proof-panel="1" hidden>
<p class="hero-proof-theorem">collapse_reattach</p><h4>展开之后,仍能回到原图</h4><p>先给出折叠映射,验证重新连接后的顶点会回到原来的位置。</p>
<pre><code>triangleCollapse v (reattach v i w) = w</code></pre><a class="text-link" href="archive.html#proof=openai_triangle_face&tab=process&run=d77dc453-baf2-4ffd-9afa-ae2af96decba&entry=check:check-7f3828b042eb20639aad">查看这次检查 · L98–115<i data-lucide="arrow-up-right"></i></a>
</div>
<div class="hero-proof-panel" id="hero-proof-panel-2" data-proof-panel="2" hidden>
<p class="hero-proof-theorem">cutMass_triangleVertices</p><h4>找到展开图中对应的面</h4><p>把新三角形边界的切质量化为原图坐标,刻画切质量为 1 的面。</p>
<pre><code>∑ e : E, if G.Incident v e then y (Sum.inl e) else 0</code></pre><a class="text-link" href="archive.html#proof=openai_triangle_face&tab=process&run=d77dc453-baf2-4ffd-9afa-ae2af96decba&entry=check:check-91023ca5fd66be269b5b">查看这次检查 · L238–253<i data-lucide="arrow-up-right"></i></a>
</div>
<div class="hero-proof-panel" id="hero-proof-panel-3" data-proof-panel="3" hidden>
<p class="hero-proof-theorem">minFace_linear_image</p><h4>面对应,也保持最小面</h4><p>在线性映射及其逆映射之间,证明每一点所在的最小面一同对应。</p>
<pre><code>CanonicalFace198.minFace R (f x) =
f '' CanonicalFace198.minFace P x</code></pre><a class="text-link" href="archive.html#proof=openai_triangle_face&tab=process&run=d77dc453-baf2-4ffd-9afa-ae2af96decba&entry=check:check-9cc7d934b222eb94861b">查看这次检查 · L822–836<i data-lucide="arrow-up-right"></i></a>
</div>
<div class="hero-proof-panel" id="hero-proof-panel-4" data-proof-panel="4">
<p class="hero-proof-theorem">triangle_expansion_face</p><h4>从局部展开,到完整原题</h4><p>面对应、互逆映射与最小面运输合为完整结论,保存的源码通过本地验收。</p>
<pre><code>f '' G.polytope = Q</code></pre><a class="text-link" href="archive.html#proof=openai_triangle_face&tab=evidence">查看原题验收依据<i data-lucide="arrow-up-right"></i></a>
</div>
<div class="hero-proof-receipt"><span class="hero-proof-receipt-state" data-proof-receipt>完整原题 · 本地验收通过</span><span>1,233 行 Lean 源码</span><a class="text-link" href="#demo">逐步阅读源码<i data-lucide="arrow-down-right"></i></a></div>
</div>
</div>
<div class="hero-proof-steps" role="group" aria-label="选择解题动画的检查节点"><button type="button" data-proof-select="1" aria-controls="hero-proof-panel-1" aria-pressed="false" disabled><span>01</span>构造展开</button><button type="button" data-proof-select="2" aria-controls="hero-proof-panel-2" aria-pressed="false" disabled><span>02</span>刻画切面</button><button type="button" data-proof-select="3" aria-controls="hero-proof-panel-3" aria-pressed="false" disabled><span>03</span>运输最小面</button><button type="button" data-proof-select="4" aria-controls="hero-proof-panel-4" aria-pressed="true" disabled><span>04</span>原题验收</button></div>
</div>
</div>
</div>
</div>
</section>
<section class="research-section landing-section g2m" tabindex="-1" id="research-entry" aria-labelledby="research-title">
<div class="wrap">
<p class="section-eyebrow">01 / 陈述核对</p>
<div class="section-heading"><h2 id="research-title">先确认题意,再探索证明</h2><p class="heading-description">Lean 检查形式化命题的证明;其中的假设、量词和目标是否符合原意,需要你来确认。</p></div>
<div class="research-layout">
<div class="human-decision" id="human-decision" aria-labelledby="human-decision-title">
<div class="human-decision-copy"><h3 id="human-decision-title">试着核对这两个目标</h3><p>对照原题检查两个目标;需要调整时,直接修改并重新核对。</p><p class="decision-example-label">TriangleFace · 目标摘要。本地演练,不会启动研究。</p></div>
<div class="decision-example" data-human-decision data-ui>
<p class="decision-question" data-decision-question>给定有完美匹配的有限无自环图,将度三顶点展开成三角形。证明原匹配多面体与展开图中切质量为 1 的面线性对应,并保持最小面。</p>
<ul class="decision-targets"><li><code data-decision-theorem="0">collapse_reattach</code><span data-decision-goal="0">展开后的顶点折叠回原顶点。</span></li><li><code data-decision-theorem="1">triangle_expansion_face</code><span data-decision-goal="1">构造线性面对应,并运输每一点的最小面。</span></li></ul>
<div class="decision-actions" data-decision-controls hidden><button class="button button-dark" type="button" data-decision="confirm" aria-pressed="false">确认这两个目标<i data-lucide="check"></i></button><button class="text-link" type="button" data-decision="revise" aria-pressed="false" aria-controls="decision-edit" aria-expanded="false">陈述还需修改</button></div>
<div class="decision-feedback" data-decision-feedback role="status" aria-atomic="true" hidden><strong data-decision-status>等待你的确认</strong><p data-decision-description>尚未确认目标。确认后可查看证明回放。</p></div>
<form class="decision-edit" id="decision-edit" data-decision-edit hidden novalidate>
<div class="decision-edit-heading"><strong>修改这份陈述</strong><span>保存后重新核对两个目标。</span></div>
<div class="decision-field"><label for="decision-question">原题</label><textarea id="decision-question" rows="3" data-decision-field="question" aria-describedby="decision-question-error" required></textarea><p class="decision-field-error" id="decision-question-error" data-decision-error="question" hidden>请填写原题,不能只输入空格。</p></div>
<fieldset><legend>两个目标</legend><div class="decision-field"><label for="decision-goal-0">目标一</label><input id="decision-goal-0" type="text" data-decision-field="goal-0" aria-describedby="decision-goal-0-error" required><p class="decision-field-error" id="decision-goal-0-error" data-decision-error="goal-0" hidden>请填写目标一,不能只输入空格。</p></div><div class="decision-field"><label for="decision-goal-1">目标二</label><input id="decision-goal-1" type="text" data-decision-field="goal-1" aria-describedby="decision-goal-1-error" required><p class="decision-field-error" id="decision-goal-1-error" data-decision-error="goal-1" hidden>请填写目标二,不能只输入空格。</p></div></fieldset>
<div class="decision-edit-actions"><button class="button button-dark" type="submit">保存并重新核对<i data-lucide="check"></i></button><button class="text-link" type="button" data-decision="cancel-edit">取消修改</button></div>
</form>
<div class="decision-handoff" data-decision-handoff hidden><button class="text-link" type="button" data-decision-copy>复制修改稿<i data-lucide="copy"></i></button><p data-decision-copy-status role="status" aria-atomic="true">复制修改后的原题和两个目标,再粘贴到工作台。</p><textarea rows="6" readonly data-decision-export aria-label="可复制的修改稿" hidden></textarea></div>
<div class="decision-next" data-decision-next hidden><span data-decision-locked>确认后,可在下方逐步查看示例证明。</span><a class="text-link" href="#demo" data-decision-continue hidden>在本页查看证明回放<i data-lucide="arrow-down-right"></i></a><a class="text-link" href="https://app.theoremos.top/?lang=zh" target="_blank" rel="noreferrer" data-decision-workbench hidden>在新标签页打开工作台<i data-lucide="arrow-up-right"></i></a><button class="text-link decision-reset" type="button" data-decision="reset" hidden>恢复原始示例</button></div>
<noscript><p class="decision-fallback">在工作台选择“共同推进”时,先确认陈述并批准计划,再开始证明。陈述有误时可返回修改。<a class="text-link" href="archive.html#proof=openai_triangle_face&tab=process">查看这道题的研究记录<i data-lucide="arrow-up-right"></i></a></p></noscript>
</div>
</div>
</div>
<details class="research-start-options"><summary>带入自己的题目或 Lean 草稿<i data-lucide="chevron-down"></i></summary><div class="research-start-body">
<div class="research-scenarios" aria-labelledby="research-entry-title">
<div class="scenario-intro"><h3 id="research-entry-title">从已有的想法或草稿开始</h3><p>网页适合条件清楚、目标明确的单文件任务。</p></div>
<ul class="scenario-list">
<li><h4>写下数学命题</h4><p>用自然语言或 TeX 写明数学对象、假设和结论,再核对生成的 Lean 陈述。</p><a class="text-link" data-research-entry="statement" href="https://app.theoremos.top/?entry=statement&template=add-zero&environment=standard&lang=zh">准备命题草稿<i data-lucide="arrow-up-right"></i></a></li>
<li><h4>继续 Lean 草稿</h4><p>保留 import、定理声明和未完成的证明,在固定的 Mathlib 环境中继续补全、检查。</p><a class="text-link" data-research-entry="lean" href="https://app.theoremos.top/?entry=lean&template=polynomial&environment=mathlib&lang=zh">打开 Lean 模板<i data-lucide="arrow-up-right"></i></a></li>
</ul>
<details class="entry-scope"><summary>自定义依赖与多文件工程<i data-lucide="chevron-down"></i></summary><p class="scenario-boundary">需要自定义依赖、多文件 Lake 工程或特定工具链时,可先与团队<a href="mailto:liuzhenhao@westlake.edu.cn?subject=TheoremOS%20%E7%A0%94%E7%A9%B6%E5%90%88%E4%BD%9C">讨论适配</a>。<a href="https://github.com/LikC1606/TheoremOS/blob/main/docs/CAPABILITIES.zh-CN.md" target="_blank" rel="noreferrer">查看当前能力范围</a>。</p></details>
<p class="scenario-continuation">登录后会带入所选模板与环境,准备草稿不调用模型。</p>
</div>
<details class="source-disclosure" id="source">
<summary><span><strong id="source-title">Lean 源码与诊断</strong><span class="source-disclosure-note">原题与草稿 · 固定环境 · 编译反馈</span></span><i data-lucide="chevron-down"></i></summary>
<div class="source-layout"><ol class="source-copy workflow-steps"><li><h3>原题与草稿</h3><p>展开题目陈述与证明源码。</p></li><li><h3>固定证明环境</h3><p>使用 Lean 标准库或固定的 Mathlib。</p></li><li><h3>查看 Lean 诊断</h3><p>对照编译反馈,定位问题并继续修改。</p></li></ol><figure class="product-fragment source-fragment"><a href="assets/workbench-source-detail.png" target="_blank" rel="noreferrer" aria-label="放大查看 Lean 工作区"><picture><source media="(max-width: 600px)" srcset="assets/workbench-source-mobile.png" width="360" height="450"><img src="assets/workbench-source-detail.png" alt="Lean 工作区中三角展开问题的原始定理陈述,尚未提交验收。" width="850" height="450" loading="lazy"></picture><span class="preview-expand"><i data-lucide="maximize-2"></i></span></a></figure></div>
</details>
</div></details>
</div>
</section>
<section class="replay-section landing-section" tabindex="-1" id="demo" aria-labelledby="demo-title">
<div class="wrap">
<p class="section-eyebrow">02 / 证明回放</p>
<div class="replay-heading"><h2 id="demo-title">三角展开,如何保持面的对应?</h2><p>从图上的局部变换,到匹配多面体的线性对应。沿四个真实检查节点,查看构造、最小面运输与完整原题验收。</p><p class="example-context">组合优化 · 1,233 行 Lean 证明 · 2 个原题目标 <a href="archive.html#proof=openai_triangle_face&tab=source">阅读完整题目<i data-lucide="arrow-up-right"></i></a></p></div>
<div class="product-demo" aria-label="TheoremOS 三角展开研究回放"><div class="replay-window archived-example" data-ui data-replay-playing="false" data-replay-current="verified" data-replay-state="paused" data-example="openai_triangle_face" data-run-id="d77dc453-baf2-4ffd-9afa-ae2af96decba">
<div class="replay-sidebar"><div class="replay-tabs" role="tablist" aria-label="已归档证明的四个关键节点"><button type="button" role="tab" id="demo-candidate" aria-controls="stage-candidate" aria-selected="false" tabindex="-1" data-replay-stage="candidate" data-step-state="complete" disabled><span>构造展开</span><i data-lucide="arrow-right"></i></button><button type="button" role="tab" id="demo-feedback" aria-controls="stage-feedback" aria-selected="false" tabindex="-1" data-replay-stage="feedback" data-step-state="complete" disabled><span>刻画切面</span><i data-lucide="arrow-right"></i></button><button type="button" role="tab" id="demo-repair" aria-controls="stage-repair" aria-selected="false" tabindex="-1" data-replay-stage="repair" data-step-state="complete" disabled><span>运输最小面</span><i data-lucide="arrow-right"></i></button><button type="button" role="tab" id="demo-verified" aria-controls="stage-verified" aria-selected="true" tabindex="0" data-replay-stage="verified" data-step-state="current" disabled><span>完整原题验收</span><i data-lucide="arrow-right"></i></button></div></div>
<div class="replay-main"><div class="replay-chrome"><span class="replay-badge"><span class="status-dot"></span>TriangleFace · 已归档的研究过程</span></div>
<div class="replay-toolbar"><div class="replay-playback" hidden><button type="button" id="replay-play" aria-label="播放证明回放" title="播放证明回放" aria-pressed="false"><i data-lucide="play"></i><i data-lucide="pause"></i></button><button type="button" id="replay-prev" aria-label="回放上一步" title="回放上一步"><i data-lucide="chevron-left"></i></button><button type="button" id="replay-next" aria-label="回放下一步" title="回放下一步" disabled><i data-lucide="chevron-right"></i></button><button type="button" id="replay-restart" aria-label="重新播放" title="重新播放"><i data-lucide="rotate-ccw"></i></button></div><span class="replay-position"><span class="mono" id="replay-step-number">04 / 04</span><span id="replay-step-label">完整原题验收</span></span><span class="replay-state" id="replay-status" role="status" aria-live="polite" aria-atomic="true">已归档</span></div>
<div class="replay-progress" id="replay-progress" role="progressbar" aria-label="证明回放步骤" aria-valuemin="1" aria-valuemax="4" aria-valuenow="4" aria-valuetext="第 4 步,共 4 步:完整原题验收"><span class="replay-progress-fill"></span></div>
<div class="replay-layout"><div class="receipt-summary"><div class="receipt-status"><span class="receipt-check"><i data-lucide="check"></i></span><div><strong>完整原题通过本地验收</strong><span class="receipt-scope">2 个目标 · 独立 Lean 检查与原题比较</span></div></div><div class="receipt-links"><a href="archive.html#proof=openai_triangle_face&tab=process" class="receipt-link">查看完整研究过程<i data-lucide="arrow-up-right"></i></a><a href="data/proofs/openai_triangle_face/verification.json" class="receipt-link receipt-evidence" target="_blank" rel="noreferrer">原始验收记录<i data-lucide="file-json-2"></i></a></div></div><div class="replay-editor"><div class="replay-panel" id="stage-candidate" role="tabpanel" aria-labelledby="demo-candidate" tabindex="0" data-check-id="check-7f3828b042eb20639aad" data-source-digest="cc8d1eeaf402501497ee64b376bd205213e1d50fccfd96071e4c487a922396b4" data-source-start="98" data-source-end="115" hidden><div class="archived-stage-summary"><h3>构造展开</h3><p>把度三顶点替换成三角形。先证明展开后的顶点能折叠回原顶点。</p></div><details class="replay-source"><summary><span>展开已检查的 Lean 源码</span><span>L98–115<i data-lucide="chevron-down"></i></span></summary><div class="editor-heading"><span><i data-lucide="file-code-2"></i>Submission.lean</span><span>L98–115</span></div><pre class="demo-code" tabindex="0" role="region" aria-label="滚动查看已检查的源码"><code><span class="code-line" data-line="98"><span class="syntax-keyword">theorem</span> collapse_reattach (v : V) (i : Fin 3) (w : V) :</span><span class="code-line" data-line="99"> triangleCollapse v (reattach v i w) = w := <span class="syntax-keyword">by</span></span><span class="code-line" data-line="100"> by_cases h : w = v</span><span class="code-line" data-line="101"> · subst w</span><span class="code-line" data-line="102"> fin_cases i <;> simp [reattach,triangleTip,triangleCollapse]</span><span class="code-line" data-line="103"> · simp [reattach,h,triangleCollapse]</span><span class="code-line" data-line="104">​</span><span class="code-line" data-line="105">def triangleExpansion (G : LooplessGraph V E) (c : E → Fin 3) (v : V) :</span><span class="code-line" data-line="106"> LooplessGraph (V ⊕ Fin 2) (E ⊕ Fin 3) where</span><span class="code-line" data-line="107"> left := Sum.elim (fun e => reattach v (c e) (G.left e)) (fun i => triangleTip v (i + 1))</span><span class="code-line" data-line="108"> right := Sum.elim (fun e => reattach v (c e) (G.right e)) (fun i => triangleTip v (i + 2))</span><span class="code-line" data-line="109"> loopless := <span class="syntax-keyword">by</span></span><span class="code-line" data-line="110"> intro e h</span><span class="code-line" data-line="111"> rcases e with e | i</span><span class="code-line" data-line="112"> · have hh := congrArg (triangleCollapse v) h</span><span class="code-line" data-line="113"> <span class="syntax-keyword">exact</span> G.loopless e ((collapse_reattach v (c e) (G.left e)).symm.trans</span><span class="code-line" data-line="114"> (hh.trans (collapse_reattach v (c e) (G.right e))))</span><span class="code-line" data-line="115"> · fin_cases i <;> simp [triangleTip] at h</span></code></pre><p class="archived-check"><i data-lucide="check"></i>已检查的源码节选<a href="archive.html#proof=openai_triangle_face&tab=process&run=d77dc453-baf2-4ffd-9afa-ae2af96decba&mode=steps&step=check%3Acheck-7f3828b042eb20639aad&code=source&source=Submission.lean&sourceSha256=cc8d1eeaf402501497ee64b376bd205213e1d50fccfd96071e4c487a922396b4&line=98&endLine=115">查看该次检查<i data-lucide="arrow-up-right"></i></a></p></details></div><div class="replay-panel" id="stage-feedback" role="tabpanel" aria-labelledby="demo-feedback" tabindex="0" data-check-id="check-91023ca5fd66be269b5b" data-source-digest="3eee740c3fd216a46f0adc2322519e26d8db6a63e672ea54bdf79b6efc83b1a7" data-source-start="238" data-source-end="253" hidden><div class="archived-stage-summary"><h3>刻画切面</h3><p>把三角形边界上的切质量写成原图边坐标之和,定位要证明的面。</p></div><details class="replay-source"><summary><span>展开已检查的 Lean 源码</span><span>L238–253<i data-lucide="chevron-down"></i></span></summary><div class="editor-heading"><span><i data-lucide="file-code-2"></i>Submission.lean</span><span>L238–253</span></div><pre class="demo-code" tabindex="0" role="region" aria-label="滚动查看已检查的源码"><code><span class="code-line" data-line="238"><span class="syntax-keyword">theorem</span> cutMass_triangleVertices (G : LooplessGraph V E) (c : E → Fin 3) (v : V)</span><span class="code-line" data-line="239"> (y : E ⊕ Fin 3 → ℝ) :</span><span class="code-line" data-line="240"> MatchingEntropyBounds.LooplessGraph.cutMass (triangleExpansion G c v) y (triangleVertices v) =</span><span class="code-line" data-line="241"> ∑ e : E, if G.Incident v e then y (Sum.inl e) else 0 := <span class="syntax-keyword">by</span></span><span class="code-line" data-line="242"> classical</span><span class="code-line" data-line="243"> rw [MatchingEntropyBounds.LooplessGraph.cutMass, MatchingEntropyBounds.LooplessGraph.cut, Finset.sum_filter, Fintype.sum_sum_type]</span><span class="code-line" data-line="244"> have hnew : (∑ i : Fin 3,</span><span class="code-line" data-line="245"> (if MatchingEntropyBounds.LooplessGraph.Crosses (triangleExpansion G c v) (triangleVertices v) (Sum.inr i)</span><span class="code-line" data-line="246"> then y (Sum.inr i) else 0)) = 0 := <span class="syntax-keyword">by</span></span><span class="code-line" data-line="247"> apply Finset.sum_eq_zero</span><span class="code-line" data-line="248"> intro i _</span><span class="code-line" data-line="249"> simp [not_crosses_inr G c v i]</span><span class="code-line" data-line="250"> rw [hnew, add_zero]</span><span class="code-line" data-line="251"> apply Finset.sum_congr <span class="syntax-keyword">rfl</span></span><span class="code-line" data-line="252"> intro e _</span><span class="code-line" data-line="253"> by_cases h : G.Incident v e <;> simp [crosses_inl_iff, h]</span></code></pre><p class="archived-check"><i data-lucide="check"></i>已检查的源码节选<a href="archive.html#proof=openai_triangle_face&tab=process&run=d77dc453-baf2-4ffd-9afa-ae2af96decba&mode=steps&step=check%3Acheck-91023ca5fd66be269b5b&code=source&source=Submission.lean&sourceSha256=3eee740c3fd216a46f0adc2322519e26d8db6a63e672ea54bdf79b6efc83b1a7&line=238&endLine=253">查看该次检查<i data-lucide="arrow-up-right"></i></a></p></details></div><div class="replay-panel" id="stage-repair" role="tabpanel" aria-labelledby="demo-repair" tabindex="0" data-check-id="check-9cc7d934b222eb94861b" data-source-digest="7d45ff2be76a3dd3377b9b677b09906734e6202b670d53e5dac3a367cb79de62" data-source-start="822" data-source-end="836" hidden><div class="archived-stage-summary"><h3>运输最小面</h3><p>证明带有线性逆映射的面对应,会把每一点的最小面一同运输。</p></div><details class="replay-source"><summary><span>展开已检查的 Lean 源码</span><span>L822–836<i data-lucide="chevron-down"></i></span></summary><div class="editor-heading"><span><i data-lucide="file-code-2"></i>Submission.lean</span><span>L822–836</span></div><pre class="demo-code" tabindex="0" role="region" aria-label="滚动查看已检查的源码"><code><span class="code-line" data-line="822"><span class="syntax-keyword">theorem</span> minFace_linear_image {A B : Type*} [AddCommGroup A] [Module ℝ A]</span><span class="code-line" data-line="823"> [AddCommGroup B] [Module ℝ B] (P : Set A) (R : Set B) (f : A →ₗ[ℝ] B)</span><span class="code-line" data-line="824"> (g : B →ₗ[ℝ] A) (hP : Convex ℝ P) (hR : Convex ℝ R)</span><span class="code-line" data-line="825"> (hQext : IsExtreme ℝ R (f '' P)) (hgf : ∀ x, g (f x) = x)</span><span class="code-line" data-line="826"> (hfg : ∀ y, y ∈ f '' P → f (g y) = y) :</span><span class="code-line" data-line="827"> ∀ x, x ∈ P → CanonicalFace198.minFace R (f x) = f '' CanonicalFace198.minFace P x := <span class="syntax-keyword">by</span></span><span class="code-line" data-line="828"> intro x hx</span><span class="code-line" data-line="829"> classical</span><span class="code-line" data-line="830"> set Q : Set B := f '' P with hQdef</span><span class="code-line" data-line="831"> have hQext' : IsExtreme ℝ R Q := hQext</span><span class="code-line" data-line="832"> have hfinj : Function.Injective f := <span class="syntax-keyword">by</span></span><span class="code-line" data-line="833"> intro a b hab</span><span class="code-line" data-line="834"> calc a = g (f a) := (hgf a).symm</span><span class="code-line" data-line="835"> _ = g (f b) := <span class="syntax-keyword">by</span> rw [hab]</span><span class="code-line" data-line="836"> _ = b := hgf b</span></code></pre><p class="archived-check"><i data-lucide="check"></i>已检查的源码节选<a href="archive.html#proof=openai_triangle_face&tab=process&run=d77dc453-baf2-4ffd-9afa-ae2af96decba&mode=steps&step=check%3Acheck-9cc7d934b222eb94861b&code=source&source=Submission.lean&sourceSha256=7d45ff2be76a3dd3377b9b677b09906734e6202b670d53e5dac3a367cb79de62&line=822&endLine=836">查看该次检查<i data-lucide="arrow-up-right"></i></a></p></details></div><div class="replay-panel" id="stage-verified" role="tabpanel" aria-labelledby="demo-verified" tabindex="0" data-check-id="check-eabf122f7f3f7b3fffab" data-source-digest="1f05b4d19928f89030bbe1ef6430f9b06bcca2273e082c8e339f77e44cdcf450" data-source-start="1186" data-source-end="1229"><div class="archived-stage-summary"><h3>完整原题验收</h3><p>合并面对应、互逆映射与最小面运输,完成原题的全部结论。</p></div><details class="replay-source"><summary><span>展开已检查的 Lean 源码</span><span>L1186–1229<i data-lucide="chevron-down"></i></span></summary><div class="editor-heading"><span><i data-lucide="file-code-2"></i>Submission.lean</span><span>L1186–1229</span></div><pre class="demo-code" tabindex="0" role="region" aria-label="滚动查看已检查的源码"><code><span class="code-line" data-line="1186"><span class="syntax-keyword">theorem</span> triangle_expansion_face {V : Type uV} {E : Type uE}</span><span class="code-line" data-line="1187"> [Fintype V] [Fintype E] [DecidableEq V] [DecidableEq E] (G : LooplessGraph V E) (v : V)</span><span class="code-line" data-line="1188"> (hdeg : Fintype.card {e : E // G.Incident v e} = 3)</span><span class="code-line" data-line="1189"> (_hmatching : Nonempty G.Matching) :</span><span class="code-line" data-line="1190"> ∃ (c : E → Fin 3) (hc : LocalLabels G v c),</span><span class="code-line" data-line="1191"> let H := triangleExpansion G c v</span><span class="code-line" data-line="1192"> let f := localExtension G c v hc</span><span class="code-line" data-line="1193"> let Q := {y | y ∈ H.polytope ∧ H.cutMass y (triangleVertices v) = 1}</span><span class="code-line" data-line="1194"> f '' G.polytope = Q ∧</span><span class="code-line" data-line="1195"> Convex ℝ Q ∧ IsExtreme ℝ H.polytope Q ∧</span><span class="code-line" data-line="1196"> (∀ x, oldRestriction (f x) = x) ∧</span><span class="code-line" data-line="1197"> (∀ y ∈ Q, f (oldRestriction y) = y) ∧</span><span class="code-line" data-line="1198"> (∀ x e, f x (Sum.inl e) = x e) ∧</span><span class="code-line" data-line="1199"> (∀ x i, f x (Sum.inr i) = x (localEdge G c v hc i)) ∧</span><span class="code-line" data-line="1200"> (∀ x, (∀ e, x e = (1/3 : ℝ)) → ∀ e, f x e = (1/3 : ℝ)) ∧</span><span class="code-line" data-line="1201"> (∀ x ∈ G.polytope, CanonicalFace198.minFace H.polytope (f x) = f '' CanonicalFace198.minFace G.polytope x) := <span class="syntax-keyword">by</span></span><span class="code-line" data-line="1202"> classical</span><span class="code-line" data-line="1203"> obtain ⟨c, hc⟩ := existsLocalLabels G v hdeg</span><span class="code-line" data-line="1204"> refine ⟨c, hc, ?_⟩</span><span class="code-line" data-line="1205"> dsimp only</span><span class="code-line" data-line="1206"> have hfg : ∀ y ∈ {y | y ∈ (triangleExpansion G c v).polytope ∧</span><span class="code-line" data-line="1207"> MatchingEntropyBounds.LooplessGraph.cutMass (triangleExpansion G c v) y (triangleVertices v) = 1},</span><span class="code-line" data-line="1208"> localExtension G c v hc (oldRestriction y) = y := <span class="syntax-keyword">by</span></span><span class="code-line" data-line="1209"> intro y hy</span><span class="code-line" data-line="1210"> have hy' : y ∈ localExtension G c v hc '' G.polytope := <span class="syntax-keyword">by</span></span><span class="code-line" data-line="1211"> rw [← cut_one_image_eq G c v hc]</span><span class="code-line" data-line="1212"> <span class="syntax-keyword">exact</span> ⟨hy.1, <span class="syntax-keyword">by</span> rw [cutLinear_apply]; <span class="syntax-keyword">exact</span> hy.2⟩</span><span class="code-line" data-line="1213"> obtain ⟨x, -, <span class="syntax-keyword">rfl</span>⟩ := hy'</span><span class="code-line" data-line="1214"> <span class="syntax-keyword">rfl</span></span><span class="code-line" data-line="1215"> have hgf : ∀ x, oldRestriction (localExtension G c v hc x) = x := <span class="syntax-keyword">by</span></span><span class="code-line" data-line="1216"> intro x</span><span class="code-line" data-line="1217"> <span class="syntax-keyword">rfl</span></span><span class="code-line" data-line="1218"> refine ⟨?_, convex_polytope_cut_eq_one G c v, isExtreme_polytope_cut_eq_one G c v,</span><span class="code-line" data-line="1219"> hgf, hfg, ?_, ?_, ?_, ?_⟩</span><span class="code-line" data-line="1220"> · rw [← cut_one_image_eq G c v hc]</span><span class="code-line" data-line="1221"> <span class="syntax-keyword">rfl</span></span><span class="code-line" data-line="1222"> · intro x e</span><span class="code-line" data-line="1223"> <span class="syntax-keyword">rfl</span></span><span class="code-line" data-line="1224"> · intro x i</span><span class="code-line" data-line="1225"> <span class="syntax-keyword">rfl</span></span><span class="code-line" data-line="1226"> · intro x hx e</span><span class="code-line" data-line="1227"> cases e <;> simp [localExtension, hx]</span><span class="code-line" data-line="1228"> · <span class="syntax-keyword">exact</span> minFace_transport_consumer G c v hc (<span class="syntax-keyword">by</span> rw [← cut_one_image_eq G c v hc]; <span class="syntax-keyword">rfl</span>)</span><span class="code-line" data-line="1229"> (isExtreme_polytope_cut_eq_one G c v) hgf hfg</span></code></pre><p class="archived-check"><i data-lucide="check"></i>已检查的源码节选<a href="archive.html#proof=openai_triangle_face&tab=process&run=d77dc453-baf2-4ffd-9afa-ae2af96decba&mode=steps&step=check%3Acheck-eabf122f7f3f7b3fffab&code=source&source=Submission.lean&sourceSha256=1f05b4d19928f89030bbe1ef6430f9b06bcca2273e082c8e339f77e44cdcf450&line=1186&endLine=1229">查看该次检查<i data-lucide="arrow-up-right"></i></a></p></details></div></div>
<aside class="replay-receipt" aria-label="TriangleFace 完整原题验收">
<details class="receipt-details"><summary class="receipt-title"><i data-lucide="shield-check"></i><span>核对验收与来源</span><span class="receipt-local">LOCAL</span><i data-lucide="chevron-down"></i></summary><div class="receipt-targets"><div><i data-lucide="check"></i><span><strong>展开后折叠回原顶点</strong><code>OAI.MatchingEntropyBounds.Refined.collapse_reattach</code></span></div><div><i data-lucide="check"></i><span><strong>面对应及最小面运输</strong><code>OAI.TriangleFace198.triangle_expansion_face</code></span></div></div><dl class="receipt-facts"><div><dt>验收方式</dt><dd>独立 Lean 内核检查</dd></div><div><dt>最终源码</dt><dd>1,233 行</dd></div><div><dt>检查日期</dt><dd>2026-11-05 UTC</dd></div><div><dt>研究归属</dt><dd>TheoremOS · deepseek-flash</dd></div><div><dt>接受运行</dt><dd><code>d77dc453-baf2-4ffd-9afa-ae2af96decba</code></dd></div><div><dt>源码 SHA-256</dt><dd><code>1f05b4d19928f89030bbe1ef6430f9b06bcca2273e082c8e339f77e44cdcf450</code></dd></div></dl><p class="archived-attribution">TheoremOS 原生运行;当前接受运行未见外部数学编辑记录,保留已记录的历史续跑。</p></details></aside></div></div></div></div>
</div>
</section>
<section class="proofs-section landing-section g2m" tabindex="-1" id="proofs" aria-labelledby="proofs-title"><div class="wrap">
<p class="section-eyebrow">03 / 成果与证据</p>
<div class="section-heading proof-heading"><div><h2 id="proofs-title">查阅证明与验收依据</h2><p>官方通过与本地验收分开标注,原始研究归属与源码、证据一并保留。</p></div><div class="proof-totals" data-moment="counter-rolls"><a href="archive.html#status=accepted"><strong data-count>10</strong><span>Lean-Eval 官方通过</span></a><a class="campaign-results" href="archive.html#status=verified"><strong data-count>18</strong><span>OpenAI Math 本地验收</span></a></div></div>
<figure class="featured-proof" id="featured-proof" data-featured-proof="dimitrov" aria-labelledby="featured-proof-title">
<div class="featured-proof-sheet">
<div class="featured-problem"><h3 id="featured-proof-title">共轭最大模的下界</h3><p class="featured-statement">Dimitrov · 历史验收案例</p><p class="featured-question">对非零且非单位根的代数整数,证明其所有代数共轭的最大绝对值(house)的下界。</p><a class="text-link" href="archive.html#proof=dimitrov&tab=source">查看完整题目与源码<i data-lucide="arrow-up-right"></i></a></div>
<div class="featured-answer" data-ui><div class="featured-receipt"><p><i data-lucide="shield-check"></i>Lean-Eval 官方通过</p><a class="text-link" href="https://github.com/leanprover/lean-eval-submissions/issues/2143#issuecomment-6215093969" target="_blank" rel="noreferrer">核对官方结果<i data-lucide="arrow-up-right"></i></a></div><details class="featured-source" open><summary class="featured-code-heading"><span>Lean 证明体节选</span><span class="featured-file"><code>Submission.lean</code><i data-lucide="chevron-down"></i></span></summary><pre class="featured-code"><code>by
exact Helpers.rpow_from_nat_power (NumberField.house α) _
(NumberField.house_nonneg α) (Helpers.argument_card_pos α)
(Helpers.house_power_lower_bound α α_int α_ne_zero α_not_rootOfUnity)</code></pre></details></div>
</div>
<figcaption>历史成果 · 原始归属:DeepScientist Math + GPT-6.1 (gpt-6.1-sol)</figcaption>
</figure>
<details class="archive-case"><summary><span><strong>TriangleFace · 原始陈述与源码</strong><span>组合优化 · 1,233 行 Lean 证明 · 本地验收通过</span></span><i data-lucide="chevron-down"></i></summary>
<div class="hero-evidence" aria-labelledby="hero-evidence-title" data-ui data-enter-media>
<div class="hero-evidence-header"><span>真实研究档案 · TriangleFace</span><span class="hero-evidence-status"><i data-lucide="check"></i>完整原题 · 本地验收通过</span></div>
<div class="hero-evidence-body">
<div class="hero-evidence-question"><h3 id="hero-evidence-title">从三角展开,到面的对应</h3><p>在有完美匹配的有限无自环图中,将度三顶点展开成三角形,构造匹配多面体的线性面对应,并保持最小面。</p><ul><li><i data-lucide="check"></i><span>展开后折叠回原顶点</span></li><li><i data-lucide="check"></i><span>面对应与最小面运输</span></li></ul></div>
<details class="hero-evidence-source" data-hero-source open><summary><span>原始声明 · Submission.lean</span><span>L1186–1194<i data-lucide="chevron-down"></i></span></summary><pre tabindex="0" aria-label="滚动查看 TriangleFace 原始声明节选"><code><span class="code-line" data-line="1186"><span class="syntax-keyword">theorem</span> triangle_expansion_face {V : Type uV} {E : Type uE}</span><span class="code-line" data-line="1187"> [Fintype V] [Fintype E] [DecidableEq V] [DecidableEq E] (G : LooplessGraph V E) (v : V)</span><span class="code-line" data-line="1188"> (hdeg : Fintype.card {e : E // G.Incident v e} = 3)</span><span class="code-line" data-line="1189"> (_hmatching : Nonempty G.Matching) :</span><span class="code-line" data-line="1190"> ∃ (c : E → Fin 3) (hc : LocalLabels G v c),</span><span class="code-line" data-line="1191"> let H := triangleExpansion G c v</span><span class="code-line" data-line="1192"> let f := localExtension G c v hc</span><span class="code-line" data-line="1193"> let Q := {y | y ∈ H.polytope ∧ H.cutMass y (triangleVertices v) = 1}</span><span class="code-line" data-line="1194"> f '' G.polytope = Q ∧</span></code></pre></details>
</div>
<div class="hero-evidence-footer"><span>1,233 行 Lean 源码 · 4 个检查节点</span><a class="text-link" href="#demo">查看证明过程<i data-lucide="arrow-down-right"></i></a></div>
</div>
</details>
<nav class="case-guide" aria-labelledby="case-guide-title"><h3 id="case-guide-title">选择想了解的内容</h3><ul>
<li><a href="archive.html#proof=openai_triangle_face&tab=source" data-case-guide="intro"><strong><span class="case-guide-case">TriangleFace</span>三角展开的完整证明</strong><span>对照原始陈述,阅读全部 1,233 行源码。</span><span class="case-guide-action">原题与源码<i data-lucide="arrow-up-right"></i></span></a></li>
<li><a href="archive.html#proof=openai_triangle_face&tab=process" data-case-guide="route"><strong><span class="case-guide-case">TriangleFace</span>匹配多面体的证明路线</strong><span>沿证明路线,逐步对照推导与源码。</span><span class="case-guide-action">复杂路线<i data-lucide="arrow-up-right"></i></span></a></li>
<li><a href="archive.html#proof=dimitrov&tab=evidence" data-case-guide="evidence"><strong><span class="case-guide-case">Dimitrov</span>验收证据</strong><span>核对官方回执、本地检查与提交版本。</span><span class="case-guide-action">验收证据<i data-lucide="arrow-up-right"></i></span></a></li>
</ul></nav>
<details class="research-disclosure proof-reading-guide" id="proof-reading"><summary>这份成果证明了什么?<i data-lucide="plus"></i></summary><div class="research-disclosure-body"><p>先看它证明的是完整原题、辅助引理,还是增加了假设的条件命题,再核对验收标签。</p><table class="proof-reading-table"><caption class="sr-only">档案状态与证据范围</caption><thead><tr><th scope="col">档案标签</th><th scope="col">可以确认什么</th></tr></thead><tbody><tr><th scope="row"><a href="archive.html#status=accepted" data-proof-status="accepted">官方通过<i data-lucide="arrow-up-right"></i></a></th><td>原提交对应的外部基准已给出通过记录;可查看官方响应。</td></tr><tr><th scope="row"><a href="archive.html#status=verified" data-proof-status="verified">本地验收通过<i data-lucide="arrow-up-right"></i></a></th><td>项目已在记录的环境中检查形式化目标;不代表已获外部官方确认。</td></tr><tr><th scope="row"><a href="archive.html#status=progress" data-proof-status="progress">研究中<i data-lucide="arrow-up-right"></i></a></th><td>保留探索过程与候选源码,尚不构成最终验收。</td></tr></tbody></table><p>局部引理通过后,仍需检查合并源码是否覆盖完整原题。模型的完成消息不能代替验收。档案中的历史成果与外部协助,均保留原始归属。</p></div></details>
<div class="archive-footer"><div class="archive-actions"><a class="text-link" href="archive.html">浏览全部证明档案<i data-lucide="arrow-up-right"></i></a><div class="proof-register-slot"><button class="proof-register-open text-link" type="button" aria-haspopup="dialog" aria-controls="proof-register-dialog" hidden>查看全部官方验收记录<i data-lucide="arrow-up-right"></i></button><div class="proof-list"><h3>查看全部官方验收记录</h3><table class="proof-table" data-ui><caption class="sr-only">查看全部官方验收记录</caption><thead><tr><th scope="col">题目与领域</th><th scope="col">原始研究归属</th><th scope="col">验收与源码</th></tr></thead><tbody>
<tr class="proof-row" data-accepted-proof="annals_improved_bounds_sunflower_lemma">
<th scope="row"><h3><a href="archive.html#proof=annals_improved_bounds_sunflower_lemma">Sunflower lemma</a></h3><p class="proof-subtitle">向日葵引理的改进界<span class="proof-area"> · 组合数学</span></p></th><td class="proof-credit">DeepScientist Math + GPT-6.1 (gpt-6.1-sol)</td>
<td><div class="proof-links"><a data-proof-source href="archive.html#proof=annals_improved_bounds_sunflower_lemma&tab=source">Lean 源码<i data-lucide="arrow-right"></i></a><a class="official-link proof-pass" href="https://github.com/leanprover/lean-eval-submissions/issues/2144#issuecomment-6222767100" target="_blank" rel="noreferrer" aria-label="Sunflower lemma 官方验收记录"><i data-lucide="check"></i>官方通过<i data-lucide="arrow-up-right"></i></a></div></td>
</tr>
<tr class="proof-row" data-accepted-proof="annals_lorentzian_polynomials">
<th scope="row"><h3><a href="archive.html#proof=annals_lorentzian_polynomials">Lorentzian polynomials</a></h3><p class="proof-subtitle">Lorentzian 多项式<span class="proof-area"> · 代数组合</span></p></th><td class="proof-credit">DeepScientist Math + GPT-6.1 (gpt-6.1-sol)</td>
<td><div class="proof-links"><a data-proof-source href="archive.html#proof=annals_lorentzian_polynomials&tab=source">Lean 源码<i data-lucide="arrow-right"></i></a><a class="official-link proof-pass" href="https://github.com/leanprover/lean-eval-submissions/issues/2144#issuecomment-6222767100" target="_blank" rel="noreferrer" aria-label="Lorentzian polynomials 官方验收记录"><i data-lucide="check"></i>官方通过<i data-lucide="arrow-up-right"></i></a></div></td>
</tr>
<tr class="proof-row" data-accepted-proof="annals_optimal_moebius">
<th scope="row"><h3><a href="archive.html#proof=annals_optimal_moebius">Optimal paper Möbius band</a></h3><p class="proof-subtitle">纸带 Möbius 环的长宽比下界<span class="proof-area"> · 几何</span></p></th><td class="proof-credit">DeepScientist Math + GPT-6.1 (gpt-6.1-sol)</td>
<td><div class="proof-links"><a data-proof-source href="archive.html#proof=annals_optimal_moebius&tab=source">Lean 源码<i data-lucide="arrow-right"></i></a><a class="official-link proof-pass" href="https://github.com/leanprover/lean-eval-submissions/issues/2144#issuecomment-6222767100" target="_blank" rel="noreferrer" aria-label="Optimal paper Möbius band 官方验收记录"><i data-lucide="check"></i>官方通过<i data-lucide="arrow-up-right"></i></a></div></td>
</tr>
<tr class="proof-row" data-accepted-proof="annals_algebraic_integers">
<th scope="row"><h3><a href="archive.html#proof=annals_algebraic_integers">Algebraic integers</a></h3><p class="proof-subtitle">代数整数:λ_SSS 的上界<span class="proof-area"> · 代数数论</span></p></th><td class="proof-credit">DeepScientist Math + GPT-6.1 (gpt-6.1-sol)</td>
<td><div class="proof-links"><a data-proof-source href="archive.html#proof=annals_algebraic_integers&tab=source">Lean 源码<i data-lucide="arrow-right"></i></a><a class="official-link proof-pass" href="https://github.com/leanprover/lean-eval-submissions/issues/2144#issuecomment-6222767100" target="_blank" rel="noreferrer" aria-label="Algebraic integers 官方验收记录"><i data-lucide="check"></i>官方通过<i data-lucide="arrow-up-right"></i></a></div></td>
</tr>
<tr class="proof-row" data-accepted-proof="dimitrov">
<th scope="row"><h3><a href="archive.html#proof=dimitrov">Dimitrov</a></h3><p class="proof-subtitle">代数整数的 house 下界<span class="proof-area"> · 数论</span></p></th><td class="proof-credit">DeepScientist Math + GPT-6.1 (gpt-6.1-sol)</td>
<td><div class="proof-links"><a data-proof-source href="archive.html#proof=dimitrov&tab=source">Lean 源码<i data-lucide="arrow-right"></i></a><a class="official-link proof-pass" href="https://github.com/leanprover/lean-eval-submissions/issues/2143#issuecomment-6215093969" target="_blank" rel="noreferrer" aria-label="Dimitrov 官方验收记录"><i data-lucide="check"></i>官方通过<i data-lucide="arrow-up-right"></i></a></div></td>
</tr>
<tr class="proof-row" data-accepted-proof="hopf_rinow">
<th scope="row"><h3><a href="archive.html#proof=hopf_rinow">Hopf–Rinow</a></h3><p class="proof-subtitle">测地完备与度量完备<span class="proof-area"> · 微分几何</span></p></th><td class="proof-credit">DeepScientist Math + GPT-6.1 (gpt-6.1-sol)</td>
<td><div class="proof-links"><a data-proof-source href="archive.html#proof=hopf_rinow&tab=source">Lean 源码<i data-lucide="arrow-right"></i></a><a class="official-link proof-pass" href="https://github.com/leanprover/lean-eval-submissions/issues/2143#issuecomment-6215093969" target="_blank" rel="noreferrer" aria-label="Hopf–Rinow 官方验收记录"><i data-lucide="check"></i>官方通过<i data-lucide="arrow-up-right"></i></a></div></td>
</tr>
<tr class="proof-row" data-accepted-proof="annals_fractional_expectation_thresholds">
<th scope="row"><h3><a href="archive.html#proof=annals_fractional_expectation_thresholds">Fractional expectation thresholds</a></h3><p class="proof-subtitle">分数期望阈值<span class="proof-area"> · 概率组合</span></p></th><td class="proof-credit">DeepScientist Math + GPT-6.1 (gpt-6.1-sol)</td>
<td><div class="proof-links"><a data-proof-source href="archive.html#proof=annals_fractional_expectation_thresholds&tab=source">Lean 源码<i data-lucide="arrow-right"></i></a><a class="official-link proof-pass" href="https://github.com/leanprover/lean-eval-submissions/issues/2141#issuecomment-6197783762" target="_blank" rel="noreferrer" aria-label="Fractional expectation thresholds 官方验收记录"><i data-lucide="check"></i>官方通过<i data-lucide="arrow-up-right"></i></a></div></td>
</tr>
<tr class="proof-row" data-accepted-proof="annals_equiangular_lines_fixed_angle">
<th scope="row"><h3><a href="archive.html#proof=annals_equiangular_lines_fixed_angle">Equiangular lines</a></h3><p class="proof-subtitle">固定夹角等角线<span class="proof-area"> · 离散几何</span></p></th><td class="proof-credit">DeepScientist Math + GPT-6.1 (gpt-6.1-sol)</td>
<td><div class="proof-links"><a data-proof-source href="archive.html#proof=annals_equiangular_lines_fixed_angle&tab=source">Lean 源码<i data-lucide="arrow-right"></i></a><a class="official-link proof-pass" href="https://github.com/leanprover/lean-eval-submissions/issues/2135#issuecomment-6186332699" target="_blank" rel="noreferrer" aria-label="Equiangular lines 官方验收记录"><i data-lucide="check"></i>官方通过<i data-lucide="arrow-up-right"></i></a></div></td>
</tr>
<tr class="proof-row" data-accepted-proof="annals_rademacher_enflo_type">
<th scope="row"><h3><a href="archive.html#proof=annals_rademacher_enflo_type">Rademacher & Enflo type</a></h3><p class="proof-subtitle">Rademacher 型与 Enflo 型的一致性<span class="proof-area"> · 泛函分析</span></p></th><td class="proof-credit">DeepScientist Math + GPT-6.1 (gpt-6.1-sol)</td>
<td><div class="proof-links"><a data-proof-source href="archive.html#proof=annals_rademacher_enflo_type&tab=source">Lean 源码<i data-lucide="arrow-right"></i></a><a class="official-link proof-pass" href="https://github.com/leanprover/lean-eval-submissions/issues/2115#issuecomment-6161355838" target="_blank" rel="noreferrer" aria-label="Rademacher & Enflo type 官方验收记录"><i data-lucide="check"></i>官方通过<i data-lucide="arrow-up-right"></i></a></div></td>
</tr>
<tr class="proof-row" data-accepted-proof="annals_unit_conjecture">
<th scope="row"><h3><a href="archive.html#proof=annals_unit_conjecture">Unit conjecture</a></h3><p class="proof-subtitle">群环单位猜想<span class="proof-area"> · 代数</span></p></th><td class="proof-credit">DeepScientist + GPT-5.6</td>
<td><div class="proof-links"><a data-proof-source href="archive.html#proof=annals_unit_conjecture&tab=source">Lean 源码<i data-lucide="arrow-right"></i></a><a class="official-link proof-pass" href="https://github.com/leanprover/lean-eval-submissions/issues/1246#issuecomment-5380977645" target="_blank" rel="noreferrer" aria-label="Unit conjecture 官方验收记录"><i data-lucide="check"></i>官方通过<i data-lucide="arrow-up-right"></i></a></div></td>
</tr></tbody></table></div></div></div><p class="proof-provenance">档案保留前身 DeepScientist / DeepScientist Math 历史成果的原始归属、源码与验收记录。</p></div>
<dialog class="proof-register-dialog" id="proof-register-dialog" aria-labelledby="proof-register-title"><div class="proof-register-heading"><h2 id="proof-register-title">查看全部官方验收记录</h2><button class="proof-register-close" type="button" aria-label="关闭证明目录" autofocus><i data-lucide="x"></i></button></div><div class="proof-register-content"></div></dialog>
</div></section>
<section class="research-cases-section landing-section" tabindex="-1" id="research-cases" aria-labelledby="research-cases-title">
<div class="wrap">
<p class="section-eyebrow">04 / 研究专题</p>
<div class="section-heading"><h2 id="research-cases-title">从不同数学专题读懂证明</h2><p class="heading-description">从算子构造、几何覆盖到算法反例,展开题目,对照关键推导和经过检查的源码。</p></div>
<p class="research-cases-scope">以下案例通过本项目的 Lean 与原题比较器检查,尚未确认 OpenAI 官方评测结果。研究归属与续跑记录见各自档案。</p>
<div class="research-case-list">
<details class="research-case" name="research-case" data-research-case="anderson" open>
<summary><span class="research-case-name"><span>概率与谱论</span><strong>随机势下的算子谱</strong></span><span class="research-case-goal">ℤ² 上,h > 0,势在 [−h,h] 内独立均匀分布:谱几乎必然为 [−4−h,4+h]。</span><i data-lucide="plus"></i></summary>
<div class="research-case-body">
<div class="research-case-route"><h3>关键证明步骤</h3><ol><li>构造有界自伴的 Anderson 算子,用范数控制谱的范围。</li><li>在同一个满测度事件上,找到任意大的近常值方块。</li><li>构造截断平面波,控制边界误差,证明谱的反向包含。</li></ol><a class="text-link" data-case-walkthrough href="archive.html#proof=openai_planar_anderson_spectrum&tab=reading">阅读逐步推导<i data-lucide="arrow-up-right"></i></a></div>
<div class="case-source" data-ui data-case-proof="openai_planar_anderson_spectrum" data-case-source-sha256="2fd7e2d1c71eff673ce58cd82f694526f9d6ed0a4ace42f800b159b26482cfc7">
<div class="case-source-heading"><span>Submission.lean</span><span>1446–1449</span></div>
<pre aria-label="随机势下的算子谱 · Lean"><code><span data-case-source-line="1446">theorem anderson_spectrum_ae {h : ℝ} (hh : 0 < h) :</span>
<span data-case-source-line="1447"> ∀ᵐ v ∂disorderLaw h, ∃ H : Hilbert →L[ℂ] Hilbert,</span>
<span data-case-source-line="1448"> IsAndersonOperator v H ∧ IsSelfAdjoint H ∧ spectrum ℂ H = spectralInterval h := by</span>
<span data-case-source-line="1449"> exact anderson_spectrum_ae_sorry_free hh</span></code></pre>
<div class="case-source-result"><span><i data-lucide="check"></i>完整原题 · 本地验收通过</span><a data-case-evidence href="archive.html#proof=openai_planar_anderson_spectrum&tab=process&run=818b8243-22b1-4315-954c-d5610eff1e44&mode=steps&step=check%3Acheck-1d66afce6974559d0595&code=source&source=Submission.lean&sourceSha256=2fd7e2d1c71eff673ce58cd82f694526f9d6ed0a4ace42f800b159b26482cfc7&line=1446&endLine=1449">查看源码与验收<i data-lucide="arrow-up-right"></i></a></div>
</div>
</div>
</details>
<details class="research-case" name="research-case" data-research-case="coloring">
<summary><span class="research-case-name"><span>离散几何</span><strong>欧氏平面的七色着色</strong></span><span class="research-case-goal">构造七色着色,使距离恰为 1 的任意两点颜色不同。</span><i data-lucide="plus"></i></summary>
<div class="research-case-body">
<div class="research-case-route"><h3>关键证明步骤</h3><ol><li>为三角格点分配模 7 颜色,证明同色中心的分离下界。</li><li>在四个相邻格点中选出足够近的中心,覆盖整个平面。</li><li>让每点继承中心颜色,用距离估计排除单位距离同色。</li></ol><a class="text-link" data-case-walkthrough href="archive.html#proof=openai_plane_coloring&tab=reading">阅读逐步推导<i data-lucide="arrow-up-right"></i></a></div>
<div class="case-source" data-ui data-case-proof="openai_plane_coloring" data-case-source-sha256="3e842122e50547b602873e71db599cc6782414fec9c60a08c664d43586341d12">
<div class="case-source-heading"><span>Submission.lean</span><span>301–302</span></div>
<pre aria-label="欧氏平面的七色着色 · Lean"><code><span data-case-source-line="301">theorem properColoring_seven : ProperColoring 7 :=</span>
<span data-case-source-line="302"> ⟨triColor, proper_coloring⟩</span></code></pre>
<div class="case-source-result"><span><i data-lucide="check"></i>完整原题 · 本地验收通过</span><a data-case-evidence href="archive.html#proof=openai_plane_coloring&tab=process&run=58e5a793-5940-4b38-aa6a-2a71ae0cac3f&mode=steps&step=check%3Acheck-186cf3d786ab8ebb8f82&code=source&source=Submission.lean&sourceSha256=3e842122e50547b602873e71db599cc6782414fec9c60a08c664d43586341d12&line=301&endLine=302">查看源码与验收<i data-lucide="arrow-up-right"></i></a></div>
</div>
</div>
</details>
<details class="research-case" name="research-case" data-research-case="truffet">
<summary><span class="research-case-name"><span>热带优化</span><strong>终止程序中的非最优输出</strong></span><span class="research-case-goal">两步均具有唯一选择并正常终止,所得可行解成本为 1,另有成本为 0 的可行点。</span><i data-lucide="plus"></i></summary>
<div class="research-case-body">
<div class="research-case-route"><h3>关键证明步骤</h3><ol><li>给出具体 max-plus 系统,核对原题要求的交叉行约束。</li><li>跟踪两步强制消元,同时更新约束与目标函数。</li><li>重建输出并给出更优可行点,用 0 < 1 完成反例。</li></ol><a class="text-link" data-case-walkthrough href="archive.html#proof=openai_truffet_counterexample&tab=reading">阅读逐步推导<i data-lucide="arrow-up-right"></i></a></div>
<div class="case-source" data-ui data-case-proof="openai_truffet_counterexample" data-case-source-sha256="442334bfd22cf81c9582b071cd6b370f2b6969d961418e6b084a25cc87ae4a91">
<div class="case-source-heading"><span>Submission.lean</span><span>545–555</span></div>
<pre aria-label="终止程序中的非最优输出 · Lean"><code><span data-case-source-line="545">theorem finite_execution_not_optimal :</span>
<span data-case-source-line="546"> crossRowRestriction initial ∧</span>
<span data-case-source-line="547"> ForcedSingletonStep initial middle 0 1 ∧</span>
<span data-case-source-line="548"> ForcedSingletonStep middle finalState 1 0 ∧</span>
<span data-case-source-line="549"> (¬ ∃ j, finalState.remaining j) ∧ stop finalState ∧</span>
<span data-case-source-line="550"> feasible initial output ∧ feasible initial better ∧</span>
<span data-case-source-line="551"> output 2 = 0 ∧ better 2 = 0 ∧</span>
<span data-case-source-line="552"> (output 1 : Coeff) = eval (lowerForm initial 0 1) output ∧</span>
<span data-case-source-line="553"> (output 0 : Coeff) = eval (lowerForm middle 1 0) output ∧</span>
<span data-case-source-line="554"> eval initial.cost output = eval finalState.cost output ∧</span>
<span data-case-source-line="555"> eval initial.cost better < eval finalState.cost output := by</span></code></pre>
<div class="case-source-result"><span><i data-lucide="check"></i>完整原题 · 本地验收通过</span><a data-case-evidence href="archive.html#proof=openai_truffet_counterexample&tab=process&run=de7a57e9-becf-4f94-9276-2090ab3f2738&mode=steps&step=check%3Acheck-e921c5e179d84067ed74&code=source&source=Submission.lean&sourceSha256=442334bfd22cf81c9582b071cd6b370f2b6969d961418e6b084a25cc87ae4a91&line=545&endLine=555">查看源码与验收<i data-lucide="arrow-up-right"></i></a></div>
</div>
</div>
</details>
</div>
</div>
</section>
<section class="research-system-section landing-section" tabindex="-1" id="research-system" aria-labelledby="research-system-title">
<div class="wrap">
<p class="section-eyebrow">05 / 深度研究</p>
<div class="section-heading"><h2 id="research-system-title">组织复杂证明的研究过程</h2><p class="heading-description">把依赖关系、候选证明与检查反馈,组织成可以继续的研究过程。</p></div>
<div class="research-system-layout">
<ol class="research-capabilities">
<li><span class="research-capability-number" aria-hidden="true">01</span><div><h3>按引理分工协作</h3><p>把主问题拆成有依赖关系的子任务,分别探索、证明和审阅,再将证明合并,检查完整原题。</p></div></li>
<li><span class="research-capability-number" aria-hidden="true">02</span><div><h3>在固定环境中检查</h3><p>按当前目标检索定义和已有定理,用固定版本的 Lean 与 Mathlib 检查候选证明。</p></div></li>
<li><span class="research-capability-number" aria-hidden="true">03</span><div><h3>从保存的版本继续</h3><p>源码、笔记和检查记录随运行保存。继续时,可用选定版本的源码重新发起研究,沿用原题检查。</p></div></li>
<li><span class="research-capability-number" aria-hidden="true">04</span><div><h3>从结论查到依据</h3><p>对照结论查看原题、源码和检查回执,也可下载材料,在本地独立复核。</p></div></li>
</ol>
<div class="research-evidence">
<div class="research-task-map" data-ui aria-labelledby="research-task-title" aria-describedby="research-task-description">
<div class="research-task-header"><div><p>TriangleFace · 历史任务快照</p><h3 id="research-task-title">从引理到主定理</h3></div><time datetime="2026-11-05">2026.11.05</time></div>
<p class="sr-only" id="research-task-description">四个已检查任务的节选。折叠恒等式用于切质量分解;切质量分解与局部标号共同用于主定理。点击任务查看该轮记录。</p>
<ol class="research-task-grid">
<li><a href="archive.html#proof=openai_triangle_face&tab=process&run=46411529-fe40-4bb8-8fbb-071b6ecee757&task=collapse_reattach_goal"><span class="research-task-kind">结构引理<i data-lucide="arrow-up-right"></i></span><h4>折叠恒等式</h4><code>collapse_reattach</code><span class="research-task-status"><i data-lucide="check"></i>已检查</span></a><span class="research-task-arrow research-task-arrow-down" aria-hidden="true">↓</span></li>
<li><a href="archive.html#proof=openai_triangle_face&tab=process&run=46411529-fe40-4bb8-8fbb-071b6ecee757&task=local_labels_exists"><span class="research-task-kind">构造引理<i data-lucide="arrow-up-right"></i></span><h4>局部标号</h4><code>existsLocalLabels</code><span class="research-task-status"><i data-lucide="check"></i>已检查</span></a><span class="research-task-arrow research-task-arrow-down" aria-hidden="true">↓</span></li>
<li><a href="archive.html#proof=openai_triangle_face&tab=process&run=46411529-fe40-4bb8-8fbb-071b6ecee757&task=cutMass_triangleVertices"><span class="research-task-kind">定量引理<i data-lucide="arrow-up-right"></i></span><h4>切质量分解</h4><code>cutMass_triangleVertices</code><span class="research-task-status"><i data-lucide="check"></i>已检查</span></a><span class="research-task-arrow research-task-arrow-right" aria-hidden="true">→</span></li>
<li><a href="archive.html#proof=openai_triangle_face&tab=process&run=46411529-fe40-4bb8-8fbb-071b6ecee757&task=triangle_face_goal"><span class="research-task-kind">主定理<i data-lucide="arrow-up-right"></i></span><h4>建立面的对应</h4><code>triangle_expansion_face</code><span class="research-task-status"><i data-lucide="check"></i>已检查</span></a></li>
</ol>
<div class="research-task-footer"><span>4 个任务节选 · 依赖关系来自该轮记录</span><a class="text-link" href="archive.html#proof=openai_triangle_face&tab=process&run=46411529-fe40-4bb8-8fbb-071b6ecee757">查看完整任务图<i data-lucide="arrow-up-right"></i></a></div>
</div>
<div class="research-verification"><h3>合并证明后,验收完整原题</h3><p>辅助引理通过检查后,还需对合并源码和原题的全部目标进行独立验收。</p><a class="text-link" href="archive.html#proof=openai_triangle_face&tab=process&run=d77dc453-baf2-4ffd-9afa-ae2af96decba&mode=steps&step=check%3Acheck-eabf122f7f3f7b3fffab">查看最终独立验收<i data-lucide="arrow-up-right"></i></a></div>
</div>
</div>
<a class="text-link research-system-next" href="#knowledge-reuse">查看引理如何复用<i data-lucide="arrow-down-right"></i></a>
</div>
</section>
<section class="knowledge-section landing-section" tabindex="-1" id="knowledge-reuse" aria-labelledby="knowledge-title">
<div class="wrap">
<p class="section-eyebrow">06 / 引理与知识</p>
<div class="section-heading"><h2 id="knowledge-title">在新证明中复用已验证引理</h2><p class="heading-description">从已有证明中积累方法,让每次复用都带上来源与适用条件。</p></div>
<div class="research-content-layout">
<div class="research-content-copy">
<ol class="research-practices">
<li><h3>按目标查找引理</h3><p>在本账户的已验证引理目录中查找相关结果,同时保留完整声明、源码和来源。</p></li>
<li><h3>核对适用条件</h3><p>查看类型签名、证明源码和依赖环境,确认引理适用于当前数学对象。</p></li>
<li><h3>在新证明中重新检查</h3><p>新研究使用所选引理目录的固定快照。引理会在新环境中重新编译,完整原题另行验收。</p></li>
</ol>
<a class="text-link research-content-link" href="https://app.theoremos.top/library.html?lang=zh">打开知识库<i data-lucide="arrow-up-right"></i></a>
</div>
<article class="lemma-example" aria-labelledby="lemma-example-title">
<div class="lemma-intro"><p class="research-content-label">TriangleFace · 通用引理</p><h3 id="lemma-example-title">最小面沿线性映射运输</h3><p>在凸性与极面条件下,先证明一般的最小面对应,再用于图的三角展开。</p></div>
<div class="lemma-source" data-ui data-source-sha256="1f05b4d19928f89030bbe1ef6430f9b06bcca2273e082c8e339f77e44cdcf450">
<div class="lemma-source-heading"><span>Submission.lean</span><span>804–809</span></div>
<pre aria-label="minFace_linear_image 的完整引理声明"><code><span data-source-line="804">theorem minFace_linear_image {A B : Type*} [AddCommGroup A] [Module ℝ A]</span>
<span data-source-line="805"> [AddCommGroup B] [Module ℝ B] (P : Set A) (R : Set B) (f : A →ₗ[ℝ] B)</span>
<span data-source-line="806"> (g : B →ₗ[ℝ] A) (hP : Convex ℝ P) (hR : Convex ℝ R)</span>
<span data-source-line="807"> (hQext : IsExtreme ℝ R (f '' P)) (hgf : ∀ x, g (f x) = x)</span>
<span data-source-line="808"> (hfg : ∀ y, y ∈ f '' P → f (g y) = y) :</span>
<span data-source-line="809"> ∀ x, x ∈ P → CanonicalFace198.minFace R (f x) = f '' CanonicalFace198.minFace P x := by</span></code></pre>
<a class="lemma-source-link" data-lemma-source href="archive.html#proof=openai_triangle_face&tab=process&run=d77dc453-baf2-4ffd-9afa-ae2af96decba&mode=steps&step=check%3Acheck-eabf122f7f3f7b3fffab&code=source&source=Submission.lean&sourceSha256=1f05b4d19928f89030bbe1ef6430f9b06bcca2273e082c8e339f77e44cdcf450&line=804&endLine=809"><span><i data-lucide="check"></i>来自已验收的完整源码</span><span>查看证明<i data-lucide="arrow-up-right"></i></span></a>
</div>
<details class="research-disclosure"><summary>找到的引理能直接用吗?<i data-lucide="plus"></i></summary><p>先核对假设和依赖环境,再检查实际调用。找到引理不代表证明通过;环境不兼容时,也不能直接套用。这里展示的是已验收源码中的通用引理。</p></details>
</article>
</div>
</div>
</section>
<section class="collaboration-section landing-section" tabindex="-1" id="research-collaboration" aria-labelledby="collaboration-title">
<div class="wrap">
<p class="section-eyebrow">07 / 协作与交付</p>
<div class="section-heading"><h2 id="collaboration-title">围绕数学问题开展协作</h2><p class="heading-description">和同行讨论思路、复查证明,分享愿意公开的成果与依据,让研究经验在社区中继续积累。</p></div>
<div class="research-content-layout">
<div class="research-content-copy">
<ol class="research-practices">
<li><h3>先审阅题意与计划</h3><p>选择“共同推进”后,先确认陈述并批准初始计划,再展开证明。研究过程中可以补充意见、调整方案。</p></li>
<li><h3>围绕具体任务讨论</h3><p>讨论对应具体任务和版本,可查看意见是否送达、是否采纳,以及随后做了哪些修改和检查。</p></li>
<li><h3>设置成员与分享权限</h3><p>邀请合作者加入项目,分别设置内容可见范围和运行操作权限。成员授权与分享链接均可撤销。</p></li>
</ol>
<a class="text-link research-content-link" href="https://app.theoremos.top/theorems.html?lang=zh">打开协作项目<i data-lucide="arrow-up-right"></i></a>
</div>
<article class="research-delivery" aria-labelledby="delivery-title">
<p class="research-content-label">Dimitrov · 独立复核包</p>
<h3 id="delivery-title">让同行在本地复核</h3>
<p class="delivery-intro">同行可下载独立复核包,在本地使用固定环境检查证明,无需 TheoremOS 账号或模型 API Key。</p>
<div class="delivery-package" data-ui aria-label="Dimitrov 复核包文件">
<div class="delivery-package-heading"><i data-lucide="folder-open"></i><code>proof-kits/dimitrov</code></div>
<dl class="delivery-files">
<div><dt>原题与证明</dt><dd><a href="proof-kits/dimitrov/Challenge.lean" download><code>Challenge.lean</code></a><a href="proof-kits/dimitrov/Submission.lean" download><code>Submission.lean</code></a></dd></div>
<div><dt>工具链与依赖</dt><dd><a href="proof-kits/dimitrov/lean-toolchain" download><code>lean-toolchain</code></a><a href="proof-kits/dimitrov/lake-manifest.json" download><code>lake-manifest.json</code></a></dd></div>
<div><dt>校验与复核</dt><dd><a href="proof-kits/dimitrov/SHA256SUMS" download><code>SHA256SUMS</code></a><a href="proof-kits/dimitrov/verify.py" download><code>verify.py</code></a></dd></div>
</dl>
</div>
<a class="text-link delivery-guide" data-proof-kit href="https://github.com/HuggingMath/TheoremOS/tree/main/proof-kits/dimitrov" target="_blank" rel="noreferrer">查看复核包与说明<i data-lucide="arrow-up-right"></i></a>
<details class="research-disclosure" data-review-disclosure><summary>下载后,怎样复核?<i data-lucide="plus"></i></summary><div class="research-disclosure-body"><p>在包目录中核对文件,准备固定依赖,再运行 Lean 检查。需安装 Python 3、Git 和 Lean 工具链管理器 Elan。</p><pre><code>python3 verify.py --check-files
python3 verify.py --prepare --lean-only</code></pre><p>完整题面对照还需按包内说明配置上游比较器,再运行 <code>python3 verify.py</code>。</p></div></details>
<details class="research-disclosure" data-sharing-disclosure><summary>分享链接会公开哪些内容?<i data-lucide="plus"></i></summary><p>分享链接包括选定成果的原题、证明、结果和环境信息;如有题意核对记录,也会一并展示。API Key、邮箱和 Agent 对话不包含在内。撤销后链接失效,已下载的副本仍由接收者保留。 <a href="privacy.html">查看隐私与条款</a>。</p></details>
</article>
</div>
<div class="community-participation" id="community" tabindex="-1" aria-labelledby="community-title">
<div class="community-heading"><div><p class="research-content-label">社区共建</p><h3 id="community-title">从一个问题开始,一起推进</h3></div><a class="text-link" href="initiative.html">了解共建计划<i data-lucide="arrow-up-right"></i></a></div>
<ul class="community-paths">
<li><a href="initiative.html#participate"><i data-lucide="flask-conical"></i><span><strong>带来研究问题</strong><span>交流数学问题、未完成的草稿与使用反馈。</span></span><i data-lucide="arrow-up-right"></i></a></li>
<li><a href="archive.html"><i data-lucide="file-check-2"></i><span><strong>复查一段证明</strong><span>从原题、源码和验收依据,核对已有成果。</span></span><i data-lucide="arrow-up-right"></i></a></li>
<li><a href="https://github.com/HuggingMath/TheoremOS/issues" target="_blank" rel="noreferrer"><i data-lucide="git-fork"></i><span><strong>交流引理与工具</strong><span>分享愿意公开的方法,讨论工具需求与改进。</span></span><i data-lucide="arrow-up-right"></i></a></li>
</ul>
<p class="community-proof-kit">可从 <a href="https://github.com/HuggingMath/TheoremOS/tree/main/proof-kits/dimitrov" target="_blank" rel="noreferrer">Dimitrov 独立复核包</a>开始,按说明在本地检查证明。</p>
<p class="community-scope">是否公开研究记录由你决定;交流和复用时,保留原作者、来源与适用条件。</p>
</div>
<a class="text-link research-system-next" href="#components">了解可替换的研究组件<i data-lucide="arrow-down-right"></i></a>
</div>
</section>
<section class="components-section landing-section" tabindex="-1" id="components" aria-labelledby="components-title"><div class="wrap">
<p class="section-eyebrow">08 / 研究组件</p>
<div class="section-heading"><h2 id="components-title">比较不同证明策略</h2><p class="heading-description">在相同的题目、环境、模型和预算下,比较不同策略及协作方式的结果。</p></div>
<div class="component-layout"><div class="component-explorer"><h3 class="component-picker-title">五个决策组件</h3>
<div class="component-tabs" data-ui role="tablist" aria-label="五个研究组件" aria-orientation="vertical">
<button class="component-tab" type="button" id="tab-m1" role="tab" aria-selected="false" aria-controls="component-panel" tabindex="-1" data-component="m1"><span class="component-number">M1</span><strong>证明构造</strong><i data-lucide="arrow-up-right"></i></button>
<button class="component-tab" type="button" id="tab-m2" role="tab" aria-selected="false" aria-controls="component-panel" tabindex="-1" data-component="m2"><span class="component-number">M2</span><strong>检查反馈</strong><i data-lucide="arrow-up-right"></i></button>
<button class="component-tab" type="button" id="tab-m3" role="tab" aria-selected="true" aria-controls="component-panel" tabindex="0" data-component="m3"><span class="component-number">M3</span><strong>搜索决策</strong><i data-lucide="arrow-up-right"></i></button>
<button class="component-tab" type="button" id="tab-m4" role="tab" aria-selected="false" aria-controls="component-panel" tabindex="-1" data-component="m4"><span class="component-number">M4</span><strong>上下文选择</strong><i data-lucide="arrow-up-right"></i></button>
<button class="component-tab" type="button" id="tab-m5" role="tab" aria-selected="false" aria-controls="component-panel" tabindex="-1" data-component="m5"><span class="component-number">M5</span><strong>协作复用</strong><i data-lucide="arrow-up-right"></i></button>
</div>
<div class="component-panel" id="component-panel" role="tabpanel" tabindex="0" aria-labelledby="tab-m3">
<div class="module-details"><div><h3 id="module-title">决定下一步做什么</h3><p id="module-description">从就绪任务中选择下一步,结合研究路线和共享预算,决定继续、重试或停止。</p></div><dl><div><dt>输入</dt><dd id="module-input">研究状态 · 候选操作 · 共享预算</dd></div><div><dt>输出</dt><dd id="module-output">下一步操作 · 有序就绪任务</dd></div></dl><p class="module-contract" id="module-kicker">M3 · 搜索决策</p></div>
<div class="independent-check"><span>S3 始终独立验收完整原题。</span></div>
</div>
</div><div class="module-media"><figure class="module-showcase" aria-labelledby="module-preview-heading">
<div class="module-preview-toolbar"><h3 id="module-preview-heading" class="sr-only">模块图谱与方案库</h3><div class="module-preview-tabs" role="tablist" aria-label="模块视图" hidden><button type="button" id="module-preview-tab-modules" role="tab" aria-selected="true" aria-controls="module-preview-panel" data-module-preview="modules"><i data-lucide="network"></i>模块图谱</button><button type="button" id="module-preview-tab-library" role="tab" aria-selected="false" aria-controls="module-preview-panel" tabindex="-1" data-module-preview="library"><i data-lucide="folder-open"></i>方案库</button></div></div>
<div id="module-preview-panel" role="tabpanel" aria-labelledby="module-preview-tab-modules" tabindex="0">
<div class="module-graph" data-ui role="group" aria-label="交互式模块图谱" aria-describedby="module-graph-description">
<p class="sr-only" id="module-graph-description">M5 负责分工与复用。M3 选择任务,M4 整理上下文,M1 构造证明,M2 检查候选,再把反馈交回 M3。证明合并后,由 S3 对完整原题进行独立验收。</p>
<div class="module-graph-canvas">
<svg class="module-graph-edges" aria-hidden="true" focusable="false">
<defs><marker id="module-graph-arrow" viewBox="0 0 8 8" refX="7" refY="4" markerWidth="7" markerHeight="7" orient="auto"><path d="M1 1 L7 4 L1 7" fill="none" stroke="var(--muted)" stroke-width="1.4"></path></marker><marker id="module-graph-arrow-active" viewBox="0 0 8 8" refX="7" refY="4" markerWidth="7" markerHeight="7" orient="auto"><path d="M1 1 L7 4 L1 7" fill="none" stroke="var(--accent)" stroke-width="1.4"></path></marker></defs>
<path data-graph-from="m5" data-graph-to="m3" class="graph-coordination-edge" marker-end="url(#module-graph-arrow)"></path>
<path data-graph-from="m5" data-graph-to="m4" class="graph-coordination-edge" marker-end="url(#module-graph-arrow)"></path>
<path data-graph-from="m3" data-graph-to="m4" marker-end="url(#module-graph-arrow)"></path>
<path data-graph-from="m4" data-graph-to="m1" marker-end="url(#module-graph-arrow)"></path>
<path data-graph-from="m1" data-graph-to="m2" marker-end="url(#module-graph-arrow)"></path>
<path data-graph-from="m2" data-graph-to="m3" marker-end="url(#module-graph-arrow)"></path>
<path data-graph-from="m2" data-graph-to="s3" marker-end="url(#module-graph-arrow)"></path>
</svg>
<button type="button" class="graph-node graph-node-wide" data-graph-component="m5" aria-pressed="false" aria-controls="component-panel" disabled><span class="graph-node-id">M5</span><strong>协作复用</strong><i data-lucide="arrow-up-right"></i></button>
<div class="module-graph-loop">
<button type="button" class="graph-node" data-graph-component="m3" aria-pressed="true" aria-controls="component-panel" disabled><span class="graph-node-id">M3</span><strong>选择任务</strong><i data-lucide="arrow-up-right"></i></button>
<button type="button" class="graph-node" data-graph-component="m4" aria-pressed="false" aria-controls="component-panel" disabled><span class="graph-node-id">M4</span><strong>整理上下文</strong><i data-lucide="arrow-up-right"></i></button>
<button type="button" class="graph-node" data-graph-component="m1" aria-pressed="false" aria-controls="component-panel" disabled><span class="graph-node-id">M1</span><strong>构造证明</strong><i data-lucide="arrow-up-right"></i></button>
<button type="button" class="graph-node" data-graph-component="m2" aria-pressed="false" aria-controls="component-panel" disabled><span class="graph-node-id">M2</span><strong>检查候选</strong><i data-lucide="arrow-up-right"></i></button>
</div>
<details class="graph-verification">
<summary data-graph-terminal="s3"><span class="graph-node-id">S3</span><strong>独立验收</strong><i data-lucide="chevron-down"></i></summary>
<p>集成后的证明须在固定环境中通过 Lean 对完整原题的检查。局部检查与模型的完成消息均不构成最终验收。</p>
</details>
</div>
<p class="module-graph-route" id="module-graph-route" aria-live="polite" aria-atomic="true">M3 → M4 · 根据就绪任务,整理下一步所需的上下文。</p>
</div>
<div class="module-library" hidden><a class="module-preview-link" href="assets/workbench-library-desktop.png" target="_blank" rel="noreferrer" aria-label="查看方案库原始截图" title="查看原始截图"><picture><source media="(max-width: 600px)" srcset="assets/workbench-library-mobile.png" width="360" height="650"><img src="assets/workbench-library-desktop.png" alt="模块方案库:Mathlib 代数研究方案,启用两项自定义策略。" width="848" height="530" loading="lazy"></picture><span class="preview-expand"><i data-lucide="maximize-2"></i></span></a></div>
</div>
</figure><p class="sr-only"><span id="module-preview-caption" aria-live="polite">决策组件与独立验收</span></p></div>
</div>
<noscript><p class="no-script-note">M5 负责分工与复用。M3 选择任务,M4 整理上下文,M1 构造证明,M2 检查候选,再把反馈交回 M3。证明合并后,由 S3 对完整原题进行独立验收。</p></noscript>
</div></section>
</main>
<footer class="closing start-section landing-section" id="start" tabindex="-1" aria-labelledby="start-title"><div class="wrap">
<div class="closing-content">
<div class="closing-heading">
<h2 id="start-title">带一道题来试试</h2>
<div class="closing-action"><a class="button button-lime" data-umami-event="apply-github" href="https://github.com/LikC1606/TheoremOS/issues/new?template=early-access.yml" target="_blank" rel="noreferrer">申请内测<i data-lucide="arrow-up-right"></i></a></div>
</div>
<div class="start-layout">
<div class="start-copy"><p>工作台目前采用邮箱白名单内测。申请时请简要介绍研究用途,公开题目或单文件 Lean 链接可选填。</p><p class="access-cost">内测期间平台免费。使用你自己的 API Key 调用模型,费用由相应服务商收取。</p>
<div class="start-links"><a class="text-link" data-umami-event="apply-email" href="mailto:liuzhenhao@westlake.edu.cn?subject=TheoremOS%20%E5%86%85%E6%B5%8B%E7%94%B3%E8%AF%B7&body=%E7%A0%94%E7%A9%B6%E7%94%A8%E9%80%94%EF%BC%9A%0A%0A%E5%85%AC%E5%BC%80%E9%A2%98%E7%9B%AE%E6%88%96%20Lean%20%E9%93%BE%E6%8E%A5%EF%BC%88%E9%80%89%E5%A1%AB%EF%BC%89%EF%BC%9A%0A%0A%E8%AE%A1%E5%88%92%E4%BD%BF%E7%94%A8%E7%9A%84%E6%A8%A1%E5%9E%8B%E6%9C%8D%E5%8A%A1%EF%BC%88%E9%80%89%E5%A1%AB%EF%BC%89%EF%BC%9A">邮件申请</a><a class="text-link" href="initiative.html">了解社区共建<i data-lucide="arrow-up-right"></i></a></div>
<p class="start-note">GitHub 申请公开可见,请勿填写 API Key 或个人联系方式。</p>
<ol class="access-steps"><li><strong>提交申请</strong><p>在 GitHub Issue 或邮件中介绍研究用途。</p></li><li><strong>私下确认邮箱</strong><p>收到回复后,确认用于登录的邮箱。</p></li><li><strong>登录工作台</strong><p>加入白名单后,用邮箱验证码登录并连接模型。</p></li></ol>
<a class="text-link existing-access" href="https://app.theoremos.top/" data-umami-event="open-workbench">已有资格?打开工作台<i data-lucide="arrow-up-right"></i></a>
</div>
<div class="faq-section" aria-labelledby="faq-title"><h3 id="faq-title">使用前的几个问题</h3><div class="faq-list"><details name="faq"><summary>需要自己配置 Lean 吗?<i data-lucide="plus"></i></summary><p>不用。工作台在浏览器中运行,提供 Lean 标准库或固定的 Mathlib 环境,无需在本机安装 Lean 或 Docker。</p></details><details name="faq"><summary>Lean 通过后,还要核对什么?<i data-lucide="plus"></i></summary><p>Lean 内核检查形式化命题的证明。你仍需确认其中的假设、量词和目标是否准确表达原题;题意审核与证明验收会分别展示。</p></details><details name="faq"><summary>支持哪些 Key,如何保存?<i data-lucide="plus"></i></summary><p>支持 OpenAI 和平台已配置的网关。Key 默认临时使用;也可以选择加密保存到账号,并随时删除。「检查 Key 与模型」只读取模型列表,不会调用模型。</p></details><details name="faq"><summary>如何设置预算上限?<i data-lucide="plus"></i></summary><p>开始前,可以分别为形式化与证明阶段设置时间和 Token 上限。系统依据服务商已报告的用量停止,尚在执行的请求可能造成超额;Token 上限并非费用封顶。</p></details><details name="faq"><summary>研究记录会保存吗?<i data-lucide="plus"></i></summary><p>研究记录保存在账号下,可下载源码和报告。删除账号会立即清除在线内容;维护备份与用量标识的保留方式见 <a href="privacy.html">隐私与条款</a>。</p></details><details name="faq" data-continuation-faq><summary>已有证明思路,怎样带入?<i data-lucide="plus"></i></summary><p>在原题后补充已知引理、关键构造和想尝试的证明路线。如果已有单文件 Lean 草稿,可以保留声明和未完成的证明继续研究。开始前仍需核对题意与环境。</p></details><details name="faq" data-continuation-faq><summary>研究未完成,还能继续吗?<i data-lucide="plus"></i></summary><p>可以。在运行详情选择“从这一版继续”,用保存的源码重新发起研究,沿用原题并重新检查。源码、笔记和检查记录会保留,局部结果仍需通过整题验收。</p></details></div></div></div>
</div>
<div class="site-footer"><div class="footer-brand"><a class="brand" href="index.html">TheoremOS</a><p>数学研究与 Lean 证明工作台</p></div><nav aria-label="页脚链接"><a href="archive.html">浏览证明档案</a><a href="initiative.html">共建计划</a><a href="feedback.html">反馈</a><a href="privacy.html">隐私与条款</a><a href="https://github.com/LikC1606/TheoremOS" target="_blank" rel="noreferrer">GitHub</a></nav><span>© 2026 TheoremOS contributors</span></div>
</div></footer>
<dialog class="preview-dialog" id="workbench-dialog" aria-labelledby="preview-title" aria-describedby="preview-description">
<div class="preview-dialog-header"><div><strong id="preview-title">TheoremOS <span>研究工作台</span></strong><p id="preview-description">自然语言入口</p></div><div class="preview-dialog-actions"><button type="button" class="preview-zoom" aria-label="放大截图" aria-pressed="false" title="放大截图"><i data-lucide="zoom-in"></i><i data-lucide="zoom-out"></i></button><a class="preview-original" href="assets/workbench-full-desktop.png" target="_blank" rel="noreferrer" aria-label="打开原始截图" title="打开原始截图"><i data-lucide="external-link"></i></a><button type="button" class="preview-close" aria-label="关闭截图预览" title="关闭" autofocus><i data-lucide="x"></i></button></div></div>
<div class="preview-dialog-media" role="region" aria-label="研究工作台截图" tabindex="0"><picture><source media="(max-width: 600px)" srcset="assets/workbench-full-mobile.png" width="374" height="443"><img src="assets/workbench-full-desktop.png" alt="TheoremOS 原题输入区,展示三角展开题目与研究方式。" width="900" height="349" loading="lazy"></picture></div>
</dialog>
<script src="landing.js" defer></script>
<script src="assets/vendor/ScrollTrigger-3.15.0.min.js" defer></script>
<script src="hero-proof.js" defer></script>
<script src="assets/moments/preview-loader.js" defer></script>
<script src="assets/vendor/lenis-1.3.27.min.js" defer></script>
<script src="smooth-scroll.js" defer></script>
<script src="scroll-effects.js" defer></script>
<script src="hero-parallax.js" defer></script>
</body>
</html>