feat: 158 new lemmas discovered by a weightless verifier-mediated learner#41508
feat: 158 new lemmas discovered by a weightless verifier-mediated learner#41508jeremiahrthompson wants to merge 1 commit into
Conversation
…earning Adds 158 lemmas that are the dual (order-dual / left-right / preimage-image) counterparts of existing results but were missing from the library. Each is the natural symmetric partner of a lemma already in mathlib, verified to compile against current master. Discovered by a verifier-mediated learning architecture described in 'Manifold Destiny: Continuous Learning by Consumption of Truth-Verified Structure from the Zero-Information Floor' (Thompson & Horowitz). Paper: https://github.com/sumofagents/manifold-destiny Contact: @jeremyrt on X, jeremiah@jeremiahai.com
Welcome new contributor!Thank you for contributing to Mathlib! If you haven't done so already, please review our contribution guidelines, as well as the style guide and naming conventions. In particular, we kindly remind contributors that we have guidelines regarding the use of AI when making pull requests. We use a review queue to manage reviews. If your PR does not appear there, it is probably because it is not successfully building (i.e., it doesn't have a green checkmark), has the If you haven't already done so, please come to https://leanprover.zulipchat.com/, introduce yourself, and mention your new PR. Thank you again for joining our community. |
PR summary 32848d7ba8Import changes for modified filesNo significant changes to the import graph Import changes for all files
|
|
LLM-generated |
|
@jeremiahrt please take a look at this. In particular, your PR description looks very AI generated, which is against the rules. |
felixpernegger
left a comment
There was a problem hiding this comment.
See my comment on the lemma I selected for more.
This PR is not suitable for a variety of reasons, among others that you add hundreds of unrelated lemmas in a variety of fields (many of which I suspect to be preexisting).
Further, this PR and the docstrings seem very much like an advertisment/announcement, which is not suitable.
If you think you made something novel, maybe post in on the "AI and Lean" channel on zulip, that would be much better.
For now I recommend you close this PR.
|
|
||
|
|
||
| -- Dual/order lemmas discovered by the Manifold Destiny verifier-mediated learner. | ||
| -- Paper: https://github.com/sumofagents/manifold-destiny | ||
| section | ||
| theorem NNReal.iInf_div : ∀ {ι : Sort u_3} (f : ι → NNReal) (a : NNReal), (⨅ i, f i) / a = ⨅ i, f i / a := by | ||
| open NNReal Function Set Real in | ||
| intro ι f a | ||
| simp only [div_eq_mul_inv, iInf_mul] | ||
|
|
||
| end |
There was a problem hiding this comment.
There are several style issues with this (this basically applies to all other lemmas you added).
You shouldnt open namespaces in a proof normally, the forall quantifier is not good, simp only shouldnt be at the end of a proof (just simp instead), wrong format for the docstring (ought to use /-- ... -/), I see not reason why you wrap the theorem in a section, wrong indentation, one empty line too much, ....
Take a look at https://leanprover-community.github.io/contribute/style.html
But most importantly, the docstring isnt informative (a docstring wouldnt be needed for something trivial like this) and in fact just an advertisment.
|
awaiting-author |
|
@felixpernegger It is not LLM generated. It is LLM assisted. It is not slop. I will review your recommendations and resubmit. Thank you very much for your feedback. Some words of preparation, prepare for a lot more formal unsolved proofs. Did you read the associated white paper? https://github.com/sumofagents/manifold-destiny/blob/main/paper/main.pdf |
|
Closing this PR and proceeding with the proper formal steps to integrate this with the established process. Building and changing now. |
The description for the LLM-generated says "PRs with substantial input from LLMs". I think it is fair to say this pplies here. Note we often merge such PRs anyways
Before making a new PR please review sytel guide and notwworthyness etc, and keep it limited to one area (or even file) please. |
|
You got it. I am going to post and introduce myself on Zulip and then post in the #AI and lean section to introduce this work. I am also reformulating the proofs so they compile CI. They will be ready for formal PR when the community is ready to accept. Please accept my apology, I am new here. |
|
@felixpernegger In Zulip in '#AI and Lean' there is not a sub section that covers this contribution. There is "Machine Learning for Theorem Proving only. This is not, by definition ML. It does not train, it does not guess, it is not a probabilistic model. Does this change your suggestion? |
|
I dont think it is very helpful to argue about semantics. If you really want to, you can post it to Project announcements, but I recommend to stick to the ML thread. |
|
Not trying to argue. Just don't want to make mistake again and follow protocol from here. How about I post in "AI Authored Projects"? |
|
sure |
|
Closing. PR is ready now to pass CI. the engineer details have been fixed. Closing this PR to wait for community feedback on this work. |
What this is
This PR adds 158 new lemmas across 86 files that are the missing dual (order-dual / left-right / preimage-image) counterparts of existing results. They were not hand-written. They were discovered and proven by a learning architecture with no neural network, no training data, and no parameters — the principles of which are described in our paper.
Each lemma is the natural symmetric partner of a lemma already in mathlib. The system detected the symmetry gap, constructed the missing statement, transported the sibling's proof through the duality, and the Lean kernel independently certified it. Every one compiles against current master (verified at b9a56a6, toolchain v4.32.0-rc1), uses only standard axioms (propext, Classical.choice, Quot.sound), and is non-trivial.
Why we're submitting it
The paper, "Manifold Destiny: Continuous Learning by Consumption of Truth-Verified Structure from the Zero-Information Floor" (Thompson & Horowitz), describes a verifier-mediated learning architecture in which a bounded grammar hypothesizes candidate abstractions and a hard truth-checker accepts or rejects each — no weights, no gradients, no fitting. The same mechanism that produced these lemmas is demonstrated on three domains in the paper: formal mathematics (Lean 4.31.0 kernel), synthetic GF(2) problems, and quantum measurements on real entanglement data (CHSH violation on a 156-qubit superconducting processor).
We are submitting this PR partly as content and partly because we believe the community should look at the mechanism. We invite the scrutiny. Each of the 158 is independently reproducible.
Verification
Every lemma was dual-verified by two independent systems (Claude Fable + OpenAI GPT-5.5) against the Lean kernel, then re-verified against current master:
Each entry records the sibling lemma it is the dual of and the transport axis used, so reviewers can verify quickly.
Contents (by area)
Notes