-
Notifications
You must be signed in to change notification settings - Fork 91
Multivariable loop spaces #1663
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
|
Do you have a reference for this concept 👀? I'd like to see what the "variables" refer to, and why I should think about non-generalized loop spaces as "bivariable" |
|
@VojtechStep No, unfortunately I don't have a reference. This is original work and you can consider the name as merely a working name for now. I suppose part of the motivation is that one wants higher loop spaces to be captured by the same notion, so e.g. an 𝕊¹-ary loop should be a double loop, and that works with this definition of a higher-ary loop space. |
|
I can also draw the comparison to that the left-adjoint of loops, suspensions, is the colimit of the binary terminal span. |
…d maps `I →∗ ΩA` Co-authored-by: markrd-williams <[email protected]>
Co-authored-by: Mark Williams <[email protected]>
src/synthetic-homotopy-theory/multivariable-loop-spaces.lagda.md
Outdated
Show resolved
Hide resolved
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.
This is original work and you can consider the name as merely a working name for now.
Are you open to workshopping it as part of the review process? I understand if you want to have this merged now and build on top if it, so in case you're not, I'd like you to add a note in the file stating that the naming is not standard and subject to change.
This concept feels much more like "indexed based path spaces" than "multivariable loop spaces" to me, since in the most basic cases of 0 and 1 "variables", you don't get loop spaces at all (and while I would expect the 0 case do degenerate somewhat, I wouldn't expect a "degenerate loop space of A" to be A).
"Multivariable loop spaces" sounds to me like I → ΩA, which you show corresponds to Ωᴵ⁺¹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.
Sure! There's no rush with this one, as it turns out it's probably not the most general thing for us to consider after all.
One thing that might be tripping up your instincts is that loop spaces are most naturally considered in the category of pointed spaces. There the booleans represent points, so maybe we shouldn't call it "binary" in this case, but rather unary. Also notice how, as soon as I is pointed, then loops I A is pointed equivalent to I ->* loops A, which is the formula you highlight just in pointed spaces.
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.
There the booleans represent points, so maybe we shouldn't call it "binary" in this case, but rather unary.
I think this is the missing piece for me. Could you add something to the Idea section about the pointed perspective?
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've added an explanation now. Let me know if this is satisfactory, and thank you for leading me to a better explanation!
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 also recently saw Jon Sterling use the name "inward fan" for Σ (a : A). a = a* https://cl-l313.jonmsterling.com/01GY/
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.
That's a quirky term imo, although I get the motivation. For my purposes, the direction of the equality is not important.
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.
Would you suggest calling the present term "fan with multiplicity" or something?
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.
In this paper https://arxiv.org/pdf/2404.07854 he calls them fans and co-fans btw, I believe.
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 was thinking something along the lines of "indexed fans", but I'm having a hard time convincing even myself of this name
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 believe "indexed fans" would have a dependent over I. The present notion is more like a multiplicity of the fan
|
|
||
| ## Properties | ||
|
|
||
| ### Characterizing equality |
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.
The section headers are uncharacteristically terse compared to the usual style, e.g. "Characterizing equality/identifications of multivariable loop spaces". Is that intentional?
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.
In my opinion shorter section headers make the right-hand bar more usable, since it otherwise looks more like a word soup than a table of contents. The added context presented by
| ### Characterizing equality | |
| ### Characterizing equality in `I`-ary loop spaces |
should already be inferable.
| ``` | ||
|
|
||
| ### The inverse | ||
|
|
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 think this would benefit from a small comment, as it might not be entirely obvious how one "inverts" a based path
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.
let me know if this is what you had in mind:
### The multiplicative inverse
Given `i∗ : I` and `a∗ : A`, then any `I`-ary loop `(a , p)` has a
multiplicative inverse given by `(a∗ , (i ↦ (p i)⁻¹ ∙ p i∗))`.| (let A = type-Pointed-Type A∗) | ||
| where | ||
|
|
||
| left-mul-inv-multivar-Ω : |
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.
Not left-inv-mul-multivar-Ω for "left inverse of multiplication"?
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.
Whoops
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.
Oh, I was reading this name as "left multiplication by the inverse", which seemed neat because it can also be interpreted as "the inverse to left multiplication" which still is correct. Thought this entry was about the left inverse law first.
Co-authored-by: Mark Williams [email protected]