Repository navigation
refactor(Combinatorics/SimpleGraph): reuse leaf connectivity proof - #45091
Fieldnote-Echo wants to merge 4 commits into
Conversation
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 Zulip and join the Lean community. |
PR summary d946308a98Import changes for modified filesNo significant changes to the import graph Import changes for all files
|
Co-authored-by: Jeremy Tan Jie Rui <54175463+Parcly-Taxel@users.noreply.github.com>
|
LLM-generated |
Co-authored-by: Snir Broshi <26556598+SnirBroshi@users.noreply.github.com>
Co-authored-by: Snir Broshi <26556598+SnirBroshi@users.noreply.github.com>
SnirBroshi
left a comment
There was a problem hiding this comment.
Thanks!
maintainer merge
|
🚀 Pull request has been placed on the maintainer queue by SnirBroshi. |
While reviewing the graph API, I noticed that the proof of
can be shortened using
The unique neighbor handles nonemptiness. This removes the duplicate proof and moves the lemma from
AcyclictoConnectivity.Connected. No API changes required, and the lemma can be imported withoutAcyclic.Discussed on Zulip: reusing the leaf-deletion proof.
AI assistance: Codex helped search the local API, adapt the proof, and run local checks.