-
Notifications
You must be signed in to change notification settings - Fork 67
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
Strict symmetrizations of binary relations #1025
Strict symmetrizations of binary relations #1025
Conversation
Just for clarity, I do want to write some good explainers for the files I'm developing here before this PR is merged, but my first priority is to find the right definitions. |
I'm adding a definition of "wide displayed large reflexive graphs", but I do not like the terminology usage "wide" here. I think "wide" should mean "equipped with a section of the family of vertices", but currently I take it to mean "contractible family of vertices". Would love naming suggestions. Basically, what I use it as is a displayed reflexive graph that only adds structure on the edges and keeps the same vertices. |
If we want to formalize this nice result about wild categories due to Jon Sterling and Mike Shulman for 1-coherent wild categories, we better require the wild identity relation to have an action on wild identifications. EDIT: On second thought, it may be more fitting to prove this result for extensional wild precategories |
I'm marking this one as ready for review. |
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.
Nice pull request! I just had a few minor comments.
By the way. We have three conflicting notions of "discreteness" in the library:
If we change a discrete precategory to be the precategory defined by the identity types of a 1-type, then item 2 and 3 would agree, but that still leaves item 1 as a distinct notion of discreteness. |
I've resolved your comments now |
src/foundation/outer-2-horn-filler-conditions-binary-relations.lagda.md
Outdated
Show resolved
Hide resolved
I improved a bit on how the concepts of the PR are organized by splitting |
I'm merging this PR, any lingering questions can be reconsidered again later. |
Defines the strict symmetrization of a binary relation, and proves some basic properties of these. Among these,
R -> S(R)
ifR
is reflexiveS(R) -> R
ifR
has extensions.This construction is useful in defining certain coherences for wild categories.