This repository has been archived by the owner on Jul 24, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 297
[Merged by Bors] - feat(ring_theory): factorize a non-unit into irreducible factors without multiplying a unit #13682
Closed
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
multiset.prod_erase
eric-wieser
reviewed
Apr 27, 2022
semorrison
approved these changes
Apr 28, 2022
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
LGTM
If @eric-wieser has no further comments can I get a bors d+? |
ocfnash
reviewed
Apr 29, 2022
Thanks! bors d+ |
✌️ alreadydone can now approve this pull request. To approve and merge a pull request, simply reply with |
bors r+ |
bors bot
pushed a commit
that referenced
this pull request
Apr 29, 2022
…out multiplying a unit (#13682) Used in https://proofassistants.stackexchange.com/a/1312/93. Also adds simp lemma `multiset.prod_erase` used in the main proof and the auto-generated additive version, which is immediately analogous to [list.prod_erase](https://leanprover-community.github.io/mathlib_docs/data/list/big_operators.html#list.prod_erase). Also removes some extraneous namespace prefix.
Pull request successfully merged into master. Build succeeded: |
bors bot
pushed a commit
that referenced
this pull request
May 12, 2022
+ Shorten the proof of `exists_irreducible_factor` using `well_founded.has_min` instead of `well_founded.fix`. + Remove use of `simp` in `induction_on_irreducible`; now a pure term-mode proof except for the classical instance. + Change the proof of `not_unit_iff_exists_factors_eq` (just added in [#13682](#13682)) to use induction. The new proof doesn't require the `multiset.prod_erase` introduced in [#13682](#13682), but is about as complex as the old one, so I might change it back if reviewers prefer.
Sign up for free
to subscribe to this conversation on GitHub.
Already have an account?
Sign in.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Used in https://proofassistants.stackexchange.com/a/1312/93. Also adds simp lemma
multiset.prod_erase
used in the main proof and the auto-generated additive version, which is immediately analogous to list.prod_erase. Also removes some extraneous namespace prefix.