-
Notifications
You must be signed in to change notification settings - Fork 156
New notion of equivalence: Bijective relations #1252
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
base: master
Are you sure you want to change the base?
Conversation
…ons and functions I also proved `isContr→isSet'` to simplify the proofs of `isPropIsContr`, `isProp→isSet` and `isProp→isSet'`
…an hcomp while you hcomp
|
Now that I gave an explicit construction of |
|
So I tried it and it's not that much better. For |
|
@ecavallo this is ready to merge, please review |
| singlP A a = Σ[ x ∈ A i1 ] PathP A a x | ||
|
|
||
| singlP' : (A : I → Type ℓ) (a : A i1) → Type _ | ||
| singlP' A a = Σ[ x ∈ A i0 ] PathP A x a |
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.
Do we really need all of this duplication of singlP?
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.
I needed contrSinglP' to define isBijectivePathP; I could instead define contrSinglP' by transporting the proof of contrSinglP but I don't think there is a way to do that which computes as nicely?
IMO, cubically this is a very natural notion of equivalence, because from any path
p : A ≡ Bwe get a bijective relationPathP λ i → P ias a primitive notion of cubical. The inverse of a bijective relation is also very easy to define and it is definitionally involutive;I also prove that this is equivalent to the usual notion of equivalence