Skip to content

Conversation

@jarlg
Copy link
Collaborator

@jarlg jarlg commented Jan 14, 2024

We prove Proposition 2.19 of BCFR and use it to strengthen Freudenthal's theorem for H-spaces. To do this, we define the Hopf construction (but don't prove much about it) and add some minor things that we needed.

@jarlg jarlg requested a review from jdchristensen January 14, 2024 19:53
Copy link
Collaborator

@jdchristensen jdchristensen left a comment

Choose a reason for hiding this comment

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

Thanks for this! I've got to run now, but I'll continue looking at it later.

Comment on lines +56 to +59
Proposition freudenthal_hspace `{Univalence}
{n : nat} {X : pType} `{IsConnected n X}
`{IsHSpace X} `{forall a, IsEquiv (a *.)}
: IsEquiv (fmap (pPi (n + n).+1) (loop_susp_unit X)).
Copy link
Collaborator

Choose a reason for hiding this comment

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

Another way to state this is that loop_susp_unit is a (2n+1)-equivalence, i.e., it is sent to an equivalence by Tr (n+n).+1. There's lots of material in ReflectiveSubuniverse about such maps --- search for O_inverts. Maybe it's worth having this statement in this more abstract form? I'm not sure if the connection between being inverted by Tr k and inducing an iso on Pi n for n <= k is in the library.

Copy link
Collaborator

@jdchristensen jdchristensen left a comment

Choose a reason for hiding this comment

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

Thanks for this! LGTM, once the minor changes are done.

@Alizter
Copy link
Collaborator

Alizter commented Jan 15, 2024

I would also like to take a look a bit later.

@jdchristensen
Copy link
Collaborator

@Alizter I forget if I mentioned this earlier, but with this PR, we have basically reproved the licata_finster lemma that you formalized, using more general principles instead of the encode-decode argument, and have also generalized it to any truncation level. A followup PR will do the last bit that's needed. Do you think we should keep the encode-decode argument as well, or just replace it with the new argument?

The extension to any truncation level implies, for example, that the loop_susp map π_5(S^3 ) → π_6(S^4) is an equivalence (once you have the H-space structure on S^3).

@Alizter
Copy link
Collaborator

Alizter commented Jan 15, 2024

@jdchristensen I think its fine to replace. We always have git history if we want to see it again. The isomorphisms that you get are pretty cool, hopefully once we get a spectral sequence started we can start to use them in computations.

@jdchristensen
Copy link
Collaborator

@jarlg Do you want me to push a commit with my suggested changes?

@jarlg
Copy link
Collaborator Author

jarlg commented Jan 16, 2024 via email

@jdchristensen
Copy link
Collaborator

@Alizter Let me know if you still want to look at this before merging.

@Alizter
Copy link
Collaborator

Alizter commented Jan 16, 2024

@jdchristensen I didn't get to read it in full just yet, but I think it is fine to merge. I'll leave comments afterwards if I find anything.

@jdchristensen jdchristensen merged commit 246167f into HoTT:master Jan 16, 2024
@jarlg jarlg deleted the prop-2.19 branch January 17, 2024 07:12
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

4 participants