-
Notifications
You must be signed in to change notification settings - Fork 1k
[Merged by Bors] - feat(RingTheory/Ideal): generalize Submodule.colon to sets #33390
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
[Merged by Bors] - feat(RingTheory/Ideal): generalize Submodule.colon to sets #33390
Conversation
…alization * Update IsTwoSided instance to apply only to submodules via coercion to sets. * Normalize statements to use Set.univ (avoiding ⊤) and fix monotonicity arguments accordingly. * Remove colon_inf_left in favor of direct use of iInf_colon_iSup. * Rework colon_inf_eq_left_of_le to use the generalized API. * Add colon_bot' (CommSemiring): identify ⊥.colon S with the annihilator of span S. * Tidy annihilator lemmas (Submodule.top_coe) and related rewrites.
PR summary 19e41d0839Import changes for modified filesNo significant changes to the import graph Import changes for all files
|
|
-WIP |
|
Sorry didn't notice this because it was tagged WIP 😅 |
…_eq_top_of_subset
…pt proof to iUnion
…on_span_singleton
|
-awaiting-author |
…em_colon_singleton
erdOne
left a comment
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 otherwise
Thanks!
maintainer merge
|
🚀 Pull request has been placed on the maintainer queue by erdOne. |
|
Thanks! bors d+ |
|
✌️ farmanb can now approve this pull request. To approve and merge a pull request, simply reply with |
|
Thanks! bors r+ |
This PR generalizes `Submodule.colon` to arguments of type `Set M` in the second slot and updates the surrounding API accordingly. Main changes * Generalize `Submodule.colon` to take `S : Set M` rather than `P : Submodule R M`. * Normalize theorems/lemmas to use `Set.univ` instead of `⊤` where appropriate. * Strengthen `iInf_colon_iSup` by removing an unnecessary commutativity assumption. * Update monotonicity and inclusion lemmas (e.g. `_root_.Ideal.le_colon`) to use set inclusions. * Add `colon_bot'` (`CommSemiring`): identify `⊥.colon S` with the annihilator of `Submodule.span R S`. * Adjust annihilator-related proofs to account for the generalized colon, using explicit coercions such as `Submodule.top_coe`. Co-authored-by: blake-farman <blake.farman@gmail.com>
|
Build failed (retrying...): |
This PR generalizes `Submodule.colon` to arguments of type `Set M` in the second slot and updates the surrounding API accordingly. Main changes * Generalize `Submodule.colon` to take `S : Set M` rather than `P : Submodule R M`. * Normalize theorems/lemmas to use `Set.univ` instead of `⊤` where appropriate. * Strengthen `iInf_colon_iSup` by removing an unnecessary commutativity assumption. * Update monotonicity and inclusion lemmas (e.g. `_root_.Ideal.le_colon`) to use set inclusions. * Add `colon_bot'` (`CommSemiring`): identify `⊥.colon S` with the annihilator of `Submodule.span R S`. * Adjust annihilator-related proofs to account for the generalized colon, using explicit coercions such as `Submodule.top_coe`. Co-authored-by: blake-farman <blake.farman@gmail.com>
|
Pull request successfully merged into master. Build succeeded: |
This adapts IdealFilter to the generalized Submodule.colon API introduced in leanprover-community#33390.
…r-community#33390) This PR generalizes `Submodule.colon` to arguments of type `Set M` in the second slot and updates the surrounding API accordingly. Main changes * Generalize `Submodule.colon` to take `S : Set M` rather than `P : Submodule R M`. * Normalize theorems/lemmas to use `Set.univ` instead of `⊤` where appropriate. * Strengthen `iInf_colon_iSup` by removing an unnecessary commutativity assumption. * Update monotonicity and inclusion lemmas (e.g. `_root_.Ideal.le_colon`) to use set inclusions. * Add `colon_bot'` (`CommSemiring`): identify `⊥.colon S` with the annihilator of `Submodule.span R S`. * Adjust annihilator-related proofs to account for the generalized colon, using explicit coercions such as `Submodule.top_coe`. Co-authored-by: blake-farman <blake.farman@gmail.com>
…r-community#33390) This PR generalizes `Submodule.colon` to arguments of type `Set M` in the second slot and updates the surrounding API accordingly. Main changes * Generalize `Submodule.colon` to take `S : Set M` rather than `P : Submodule R M`. * Normalize theorems/lemmas to use `Set.univ` instead of `⊤` where appropriate. * Strengthen `iInf_colon_iSup` by removing an unnecessary commutativity assumption. * Update monotonicity and inclusion lemmas (e.g. `_root_.Ideal.le_colon`) to use set inclusions. * Add `colon_bot'` (`CommSemiring`): identify `⊥.colon S` with the annihilator of `Submodule.span R S`. * Adjust annihilator-related proofs to account for the generalized colon, using explicit coercions such as `Submodule.top_coe`. Co-authored-by: blake-farman <blake.farman@gmail.com>
…r-community#33390) This PR generalizes `Submodule.colon` to arguments of type `Set M` in the second slot and updates the surrounding API accordingly. Main changes * Generalize `Submodule.colon` to take `S : Set M` rather than `P : Submodule R M`. * Normalize theorems/lemmas to use `Set.univ` instead of `⊤` where appropriate. * Strengthen `iInf_colon_iSup` by removing an unnecessary commutativity assumption. * Update monotonicity and inclusion lemmas (e.g. `_root_.Ideal.le_colon`) to use set inclusions. * Add `colon_bot'` (`CommSemiring`): identify `⊥.colon S` with the annihilator of `Submodule.span R S`. * Adjust annihilator-related proofs to account for the generalized colon, using explicit coercions such as `Submodule.top_coe`. Co-authored-by: blake-farman <blake.farman@gmail.com>
This PR generalizes
Submodule.colonto arguments of typeSet Min the second slot and updates the surrounding API accordingly.Main changes
Submodule.colonto takeS : Set Mrather thanP : Submodule R M.Set.univinstead of⊤where appropriate.iInf_colon_iSupby removing an unnecessary commutativity assumption._root_.Ideal.le_colon) to use set inclusions.colon_bot'(CommSemiring): identify⊥.colon Swith the annihilator ofSubmodule.span R S.Submodule.top_coe.