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

Formalizing Devalapurkar & Haine #1147

Open
9 of 11 tasks
Trebor-Huang opened this issue Aug 10, 2024 · 0 comments
Open
9 of 11 tasks

Formalizing Devalapurkar & Haine #1147

Trebor-Huang opened this issue Aug 10, 2024 · 0 comments

Comments

@Trebor-Huang
Copy link
Contributor

Trebor-Huang commented Aug 10, 2024

I'm making some headway in formalizing the paper

And I'd like to contribute this to the cubical library. But before that I want to confirm I'm not repeating work, and that these are suitable for the library. Here's a list of things to prove:

  • Main results:
    • Fundamental James Splitting: ΣΩΣX ≃ ΣX ∨ (X ∧ ΣΩΣX).
    • Fundamental Hilton–Milnor Splitting: Ω(X ∨ Y) ≃ ΩX × ΩY × ΩΣ(ΩX ∧ ΩY).
    • These both have infinitary versions, but the proof in Devalapurkar and Haine reduces them to presheaf toposes, which are hypercomplete. I wonder if it is provable in HoTT without additional assumptions.
    • Metastable EHP: I think this is out of reach.
  • Funny intermediary results:
    • Mather's cube theorems (I think the HoTT-flavored version is the flattening lemma, which is much easier to use than fiddling with cubes).
    • The pushout of X ← X ∨ Y → X is contractible.
    • Σ(X ⋀ Y) ≃ X join Y.
    • the fiber of X ∨ Y → X × Y is Σ(ΩX ∧ ΩY).
    • If A is the fiber of B → C, and ΩB → ΩC has a section, then ΩB is equivalent to ΩA × ΩC. (I tried to prove it directly but it seems to require a large coherence result between 2-paths.) @ecavallo found a very succint proof, nice!
    • The dual statement for suspensions.
  • Little lemmas:
    • Suspension is equivalent to pushout of 1 ← X → 1, but the 1 is Unit* because of universe level shenanigans.
    • Pushout of 1 ← 1 → X is X; Pushout of 1 ← X = X is 1.
    • The pasting lemma for pushouts. Seems like it is already in Connected CW complexes #1133, so I'm basing my work off of that.
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

No branches or pull requests

1 participant