Conversation
and define `Order(Add)MonoidIso.symm` bringing along a copy of lemmas from MulEquiv clean up the simps
…nd projections into prod of ordered groups with a TODO about creating the associated categories
PR summary 124c4b2dbcImport changes for modified filesNo significant changes to the import graph Import changes for all files
|
can't have the `fst_comp_inr` without a "send everything to one except zero" hom
Factored out from #22420
…ro.map'` (leanprover-community#25660) factored out of leanprover-community#22420 Co-authored-by: Yaël Dillies <yael.dillies@gmail.com>
…ro.map'` (leanprover-community#25660) factored out of leanprover-community#22420 Co-authored-by: Yaël Dillies <yael.dillies@gmail.com>
YaelDillies
left a comment
There was a problem hiding this comment.
Thanks!
maintainer delegate
| @[to_additive (attr := simps!) "Given ordered additive monoids M, N, the natural inclusion ordered | ||
| homomorphism from N to the lexicographic M ×ₗ N."] | ||
| def inrₗ : β →*o (α ×ₗ β) where | ||
| __ := (Prod.Lex.toLexOrderHom).comp (inr α β) |
There was a problem hiding this comment.
Which is the evil part?
There was a problem hiding this comment.
I would have expected
| __ := (Prod.Lex.toLexOrderHom).comp (inr α β) | |
| __ := Prod.Lex.toLexOrderHom.comp (inr α β) |
| The product of ordered monoids `α × β` is an ordered monoid itself with both natural inclusions | ||
| and projections, making it the coproduct as well. | ||
|
|
||
| TODO: Create the "OrdCommMon" category. |
There was a problem hiding this comment.
| TODO: Create the "OrdCommMon" category. | |
| ## TODO | |
| Create the "OrdCommMon" category. |
| rfl | ||
|
|
||
| @[simp] | ||
| lemma comp_coe_orderMonoidHom (f : β →*₀o γ) (g : α →*₀o β) : |
There was a problem hiding this comment.
I would suggest
| lemma comp_coe_orderMonoidHom (f : β →*₀o γ) (g : α →*₀o β) : | |
| lemma toOrderMonoidHom_comp (f : β →*₀o γ) (g : α →*₀o β) : |
for clarity
| simp | ||
|
|
||
| theorem inlₗ_mul_inrₗ_eq_coe_toLex {m : α} {n : β} (hm : m ≠ 0) (hn : n ≠ 0) : | ||
| (inl α β m * inr α β n) = toLex (Units.mk0 _ hm, Units.mk0 _ hn) := by |
There was a problem hiding this comment.
| (inl α β m * inr α β n) = toLex (Units.mk0 _ hm, Units.mk0 _ hn) := by | |
| inl α β m * inr α β n = toLex (Units.mk0 _ hm, Units.mk0 _ hn) := by |
Is there no inrₗ_mul_inlₗ version?
There was a problem hiding this comment.
Not sure what that would give differently, since this is over a commgroup
|
🚀 Pull request has been placed on the maintainer queue by YaelDillies. |
|
bors d+ |
|
✌️ pechersky can now approve this pull request. To approve and merge a pull request, simply reply with |
|
bors r+ |
…d projections of prod of ordered groups (#22420)
|
This PR was included in a batch that successfully built, but then failed to merge into master (it was a non-fast-forward update). It will be automatically retried. |
…d projections of prod of ordered groups (#22420)
|
Pull request successfully merged into master. Build succeeded: |
…d projections of prod of ordered groups (leanprover-community#22420)
…ro.map'` (leanprover-community#25660) factored out of leanprover-community#22420 Co-authored-by: Yaël Dillies <yael.dillies@gmail.com>
…d projections of prod of ordered groups (leanprover-community#22420)
WithZero.map'#25660