In mathematical research, formalizing arguments that combine operator spectral theory, probability spaces, and lattice limits requires resolving numerous low-level technical lemmas. TheoremOS is an AI mathematical research system built to collaborate with mathematicians: it accepts natural language,
This case study examines a complete formalization from our public archive: characterizing the almost-sure spectrum of the two-dimensional discrete Anderson Hamiltonian. Every definition, lemma, and kernel check discussed below can be inspected directly in the interactive proof archive and the process archive.
Consider the complex Hilbert space
where
In the formal problem specification Challenge.lean, the target theorem OAI.PlanarAnderson.anderson_spectrum_ae requires more than identifying the interval: one must prove that for almost every sample IsSelfAdjoint), and has its complex spectrum
On paper, the upper spectral inclusion follows from operator norm bounds, while the lower inclusion uses Weyl's approximate eigenvalue criterion (an approximate eigenvector argument) supported on large finite boxes where the random potential is nearly constant. Translating this into a sorry-free Lean 4 proof requires explicit measure-theoretic quantification and rigorous discrete boundary estimates.
In Submission.lean (1,454 lines), the system establishes the theorem across five main stages:
| Mathematical Stage | Key Lean Declarations (Source Links) | Formalized Content |
|---|---|---|
| 1. Operator Construction & Upper Bound |
anderson_operator_exists_selfAdjointanderson_spectrum_subset
|
Constructs adjacencyCLM + mulCLM hv, proves self-adjointness and |
| 2. Occurrence of Near-Constant Blocks | constant_block_occurrence |
Uses independence across disjoint finite boxes and positive uniform measure to show that for a fixed target |
| 3. Countable Intersection & Quantifier Exchange | ae_blocks_simultaneous |
Bridges pointwise almost-sure statements via rational approximation and countable intersections, yielding a single probability-one event on which near-constant blocks exist simultaneously for all required constants and scales. |
| 4. Cut-off Plane Waves & Lower Bound |
finite_box_approx_eigenvectorspectrum_lower_of_blocks_pos
|
Constructs normalized truncated plane waves approx_eigenvalue_mem_spectrum to conclude |
| 5. Main Theorem Assembly | anderson_spectrum_ae |
Preserves the exact type signature from the challenge file and closes the goal via the helper theorem exact anderson_spectrum_ae_sorry_free hh. |
A central technical hurdle appears in Stage 3 (ae_blocks_simultaneous). In informal expositions, one readily moves from "for every
Submission.lean resolves this by taking a countable intersection over triples
The process archive and process.json record the full task decomposition tree. Alongside the completed finite-box and approximate-eigenvector route, the public record also retains unfinished alternative branches—such as constant_potential_spectrum, constant-box-bridge, and weyl-fallback (marked blocked or pending)—which can be compared directly against the final proof.
The archived record includes historical continuations (with events recorded starting 2026-10-28). No external mathematical edits were found in the accepted run. When mathematicians use TheoremOS in their own research, this decomposition workflow serves as the point of collaboration: researchers can verify formal definitions before proof search begins, inspect competing branches to decide which analytical route merits further budget, or supply intermediate lemmas when a subgoal stalls.
As recorded in verification.json, the submission passed both the independent Lean 4 kernel check and the challenge comparator run by our verification pipeline:
- Verification Status:
status = evaluated_passed,kernelStatus = kernel_verified,comparatorExitCode = 0,reviewStatus = accepted. - Comparator Output: Includes
Lean default kernel accepts the solutionandYour solution is okay!. - Axiom Audit: According to
runs[0].review.summaryinprocess.json, the target theorem and its supporting lemmas depend solely on the standard Lean axiomspropext,Classical.choice, andQuot.sound, with nosorryAxor custom axioms.
Note on Evaluation Status: This proof has passed the Lean kernel and challenge comparator checks run by our project; official OpenAI evaluation results are not yet confirmed.
Artifact Links and SHA-256 Checksum
- Problem template (contains placeholder
sorryin the statement file):Challenge.lean - Complete formal proof:
Submission.lean(SHA-256:2fd7e2d1c71eff673ce58cd82f694526f9d6ed0a4ace42f800b159b26482cfc7, matching the verification record) - Kernel verification log:
verification.json - Process and run log:
process.json
- Raw Proof Artifacts: Challenge.lean · Submission.lean · verification.json · process.json
- Interactive Viewer: Proof Archive · Process View
- Getting Started & Local Verification: Follow the Getting Started Guide to run your first session on the cloud workbench, or see
VERIFY.mdto reproduce kernel checks locally. - Research Collaboration: See
ACCESS.mdfor access details, or contactliuzhenhao@westlake.edu.cnfor academic collaboration.