Skip to content
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(order/galois_connection): formula for upper_bounds (l '' s) #8478

Closed
wants to merge 3 commits into from

Conversation

urkud
Copy link
Member

@urkud urkud commented Jul 31, 2021

  • upgrade galois_connection.upper_bounds_l_image_subset and
    galois_connection.lower_bounds_u_image to equalities;
  • prove bdd_above (l '' s) ↔ bdd_above s and
    bdd_below (u '' s) ↔ bdd_below s;
  • move galois_connection.dual to the top and use it in some proofs;
  • use order_iso.to_galois_connection to transfer some of these
    results to order_isos;
  • rename rel_iso.to_galois_insertion to order_iso.to_galois_insertion.

Open in Gitpod

* upgrade `galois_connection.upper_bounds_l_image_subset` and
  `galois_connection.lower_bounds_u_image` to equalities;
* prove `bdd_above (l '' s) ↔ bdd_above s` and
  `bdd_below (u '' s) ↔ bdd_below s`;
* move `galois_connection.dual` to the top and use it in some proofs;
* use `order_iso.to_galois_connection` to transfer some of these
  results to `order_iso`s;
* rename `rel_iso.to_galois_insertion` to `order_iso.to_galois_insertion`.
@urkud urkud added the awaiting-review The author would like community review of the PR label Jul 31, 2021
@@ -67,6 +67,11 @@ lemma monotone_intro (hu : monotone u) (hl : monotone l)

include gc

protected lemma dual [pα : preorder α] [pβ : preorder β]
{l : α → β} {u : β → α} (gc : galois_connection l u) :
@galois_connection (order_dual β) (order_dual α) _ _ u l :=
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Shouldn't l and u be composed with to_dual?

Copy link
Member Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I moved this lemma without touching the code. I mostly use order_dual for @dual_lemma (order_dual α) _ _ proofs, so I don't care about to_dual. Feel free to add it if you want to. I guess, something like

Suggested change
@galois_connection (order_dual β) (order_dual α) _ _ u l :=
galois_connection (order_dual.to_dual ∘ u ∘ order_dual.of_dual)
(order_dual.to_dual ∘ l ∘ order_dual.of_dual) :=

should work.

Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Oh, I missed that this lemma was moved. Yeah, that's basically what I was thinking . You'll need to import order.order_dual, but that seems like a good change to make to me.

Copy link
Member

@eric-wieser eric-wieser left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

bors d+

@bors
Copy link

bors bot commented Jul 31, 2021

✌️ urkud can now approve this pull request. To approve and merge a pull request, simply reply with bors r+. More detailed instructions are available here.

@github-actions github-actions bot added delegated The PR author may merge after reviewing final suggestions. and removed awaiting-review The author would like community review of the PR labels Jul 31, 2021
@urkud
Copy link
Member Author

urkud commented Aug 1, 2021

bors merge

@github-actions github-actions bot added the ready-to-merge All that is left is for bors to build and merge this PR. (Remember you need to say `bors r+`.) label Aug 1, 2021
bors bot pushed a commit that referenced this pull request Aug 1, 2021
…8478)

* upgrade `galois_connection.upper_bounds_l_image_subset` and
  `galois_connection.lower_bounds_u_image` to equalities;
* prove `bdd_above (l '' s) ↔ bdd_above s` and
  `bdd_below (u '' s) ↔ bdd_below s`;
* move `galois_connection.dual` to the top and use it in some proofs;
* use `order_iso.to_galois_connection` to transfer some of these
  results to `order_iso`s;
* rename `rel_iso.to_galois_insertion` to `order_iso.to_galois_insertion`.
@bors
Copy link

bors bot commented Aug 1, 2021

Pull request successfully merged into master.

Build succeeded:

@bors bors bot changed the title feat(order/galois_connection): formula for upper_bounds (l '' s) [Merged by Bors] - feat(order/galois_connection): formula for upper_bounds (l '' s) Aug 1, 2021
@bors bors bot closed this Aug 1, 2021
@bors bors bot deleted the gc-bounds-image branch August 1, 2021 05:08
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
delegated The PR author may merge after reviewing final suggestions. ready-to-merge All that is left is for bors to build and merge this PR. (Remember you need to say `bors r+`.)
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

2 participants