#point-set-topology
1 messages · Page 98 of 1
maybe when I'm more comfortable with them
welp. guess im never studyign measure theory
Also fair
What makes you uncomfy with them?
Being wrong about them in the past
lol
Ah, right
Then stop being wrong!
I'm trying!
Well you can basically never go wrong with preimage
It has a left and right adjoint
I don't know what you mean by adjoint
It’s a category-theoretic thing
Also we're not really talking function operations on sets; the function is still defined between the original spaces.
$f^{-1}(A) = {x: f(x) \in A}$
Yes I know, i wa doing an abuse of language
I mean one part of it is just
Outsider
$A \subseteq f^{-1}(B) \iff f(A) \subseteq B$
Pseudonium
Yeah, but I mean ultimately you're still working in terms of the values of functions at individual points, you just consider many points at once.
This expresses that direct image is the left adjoint to preimage
So it's not some kind of big qualitative change
right
next time I get something like this wrong, you're on the chopping block for making me confident
You can use the adjointness to help prove your preimage stuff
If you know the universal properties of intersection and union
that's enough category theory for today pseudo, i appreciate it though
Okkkk
so there is no way to build such surface without building rectangles, gluing them and then twist?
I meant like, you can take a long rectangular strip and twist it a few times
You can do huge swathes of topology without any concern for category theory. I understand it becomes very helpful if/when you get into the algebraic topology kind of thing, but other than that I've never felt the categorical arguments to bring much.
That does come across, yes
lol
hehe
Everything in time
i mean it has also genuinely improved my explanations
Categories make everything better
And none of the things I care about 
Press X to doubt
Actually one or two of my papers make use of the notion of inverse limit, but without the general categorical language or machinery.
Just in terms of a specific sequence of topological spaces with continuous maps between them.
Fair, but I don't recall seeing any papers/hearing any talks in my field that would mention category theory even obliquely.
Maybe we're just blind to the entire world of possibilities
one of the main things category theory does is make you an expert at manipulating functions
which i think is just a generally good math skill
We do draw commutative diagrams a lot
Although again, usually without employing category-theoretical language
i think commutative diagrams are a good way to convey information
you don't need category theory for them
This is about as big as they get, though
mhm
(from a genuine paper of mine, so I'm almost certainly going to get doxxed now)
my ones are usually a lot smaller!
though i did make one for the implicit function theorem recently
Your diagrams are cursed
if you didn't say this no one wouldve known
Curses!
In general, if "such and such condition generates the topology on X" that is referring to the fact that the condition given specifies the sets in the subbasis, right?
do you have an example?
Sort of, although ultimately "topology generated by a collection of sets" is just "the smallest topology in which all of those sets are open"
it's an adjunction
But I think as it happens. those sets will indeed be a subbasis for the generated topology
By "give this the strong order topology" he means "the elements of the subbasis are the one-sided intervals and complements of finite sets"
is what I'm asking
Hasn't strong order topology been defined above?
It was defined here
I think I asked arki already and he said that he means "these are the elements of the subbasis", but I figure I'll ask again to be really sure
yeah this is what i'd defer to
Yep, although it's equivalent to being the smallest topology in which all of the specified sets are open.
And then the basis is formed by their finite intersections.
I see
Actually, I'm not sure I believe that this space isn't T2. {1,2}, {3, ...} \cup {x,y}, {1} {2, .... } \cup {x,y} are in the subbasis, {1} = {1, 2} \cap {1]. by the same argument, every singleton subset of "omega" is open. Moreover, finite complements are in the subbasis. x^c = omega \cup {y}, {x,y}^c = \omega. then omega \cup {y} \cap omega = {y}, so this should be open too. So, this is the discrete topology, which is hausdorff, as for distinct p,q we can just take {p}, {q} as open and disjoint
Looking into torsion, I don't understand what we do not understand with torsion.
There should be something missing considering conjectures, but..
{y} = (N U {y}) \cap N
And those are both elements of the subbasis
And they're complements of finite sets
N∪{y} is not open
Oh I missed complements of finite sets
This is N though?
@red yoke do you happen to know abt the Reidemaister torsion?
Nop, sorry
No I am just aware it exists
Ah I see, sorry for bothering you
I am quite ignorant of most geometric topology stuff
It's not anything major, but it came up in volume conjecture
You seem to have already noticed the flaw in your reasoning, but in any case I can confirm that the exercise statement is correct (this space is T1 but not T2)
I know who you are…
Fame at last
What is this 
Exhibit B
Implicit function theorem
There was no exhibit A…
Also I’ve used this diagram when explaining the implicit function theorem
And it genuinely helped
Which setup?
U is an open subset of R^(n + m)
f is a function from U to R^m
You’re trying to solve f(x, y) = 0
Where x is in R^n, y in R^m
And you have that f is C^1 near a solution (x_0, y_0)
Where the jacobian of f wrt the y variables is invertible at x_0, y_0
You want to be able to find an open subset W of R^n, and a U’ of R^(n + m)
With a function g : W -> U’
Such that for all (x, y) in U’, f(x, y) = 0 iff y = g(x)
Also U’ should contain (x0, y0)
Hmm, considering it as R^(n+m) seems a bit weird to me
Ok sorry if that sounded creepy lmao
Ah, I guess it was taught differently for me.
how was it taught for you?
I thought it was supposed to
Nothing big, just R^n and R^m
Maybe my class only did n = m.
isn't that the inverse function theorem?
the implicit one helps when you're going from higher dimension to lower dimension
e.g. f(x, y) = x^2 + y^2 - 25
Wait
goes from R^2 to R^1
Yeah, I guess it was my brain reading it all wrong
i see
Yeah implicit was taught R^(n+m) -> R^m for me as well, my bad
there's also a third version of it technically
though i haven't seen it much
for going from lower dimension to higher dimension
all subsumed by the constant rank theorem, though
Indeed
I’ve always wondered what the neatest way to prove the inverse function theorem is
In an appendix I'd imagine
- A C¹ function R^n → R^n is locally injective at a nonsingular point by MVT
- It is locally surjective by AT
Algebraic topology
If you choose a neighbourhood U of x s.t. |Dy(v) - Dx(v)| < ε for any unit tangent vector at y, then there must be no two points mapped to the same value
By applying MVT on the path connecting them
I don't understand how we can prove the second direction? Because now I need to prove that any open set can be written as union of elements in SIGMA, any hint?
Does I need to define how an open set creates by the basis element?
Yea you should probably construct the topology first
And show it is indeed a topology, and is generated by ∑
I think I need to define a topology T such that the element of SIGMA is open in it
And any non-empty set U is open in T if and only if for any x in U there exists B in SIGMA such that B contains x and B contained in U
In some some small enough neighbourhood U of x the straight path homotopy from g(y) = f(y-x)-f(x) to Dx(v): U-x → U-x exists
So it must induce an isomorphism on H^n-1
Is it correct?
If the intersection of two basis elements is empty then we can say that it is an empty union of basis elements?
Yes
Yes
Okay, thank you
Can a singleton set be linearly order?
Because if X is a singleton set and linearly ordered set then how do these form a base?
Yes
So I need to let X have more than 1 element
To prove that in a Topological space each point has a smallest neighborhood if and only if the intersection of any collection of open sets is open.
Now let I be an arbitrary indexing set and U_i are open sets in T for all i in I.
If the intersection of all U_i is empty then it is open.
If intersection of all U_i is non-empty then let x in intersection of all U_i.
It implies that x in all U_i, since each point has a smallest neighborhood, let U be the smallest neighborhood of x then U contained in all U_i.
Thus x in U and U contained in intersection of all U_i implies that intersection of all U_i is open set.
Now let the intersection of any collection of open sets is open.
Then for any point x, we let U be the intersection of all open sets containing x.
Thus, U is open by hypothesis and U is smallest neighborhood of x.
Is it correct?
Formally, they are equivalent: homology is a coalgebra and cohomology is an algebra
It is already true for of H^0. More fundamentally, the ring of continuous functions on a space is contra variant
But one is a group functor and another is a ring functor? So it is strictly more than the other?
am I mistaken, or are you taking field coefficients for this to be true?
my understanding was that you need to be able to invert the kunneth map to get the coalgebra structure on homology
I think the main starting point is that, if A is a commutative ring and X is a set, then the set of formal A-linear combinations of X's elements is just an A-module, but the set of functions X -> A is an A-algebra. In particular, when defining singular chains and cochains, X is the set of singular simplices, but we have other similar situations. For example, if X is a manifold (or an algebraic or analytic variety), then the set of smooth maps X -> R is an R-algebra (there are analogues in the algebraic and analytic cases). But the mapping that assigns to each manifold its R-algebra of smooth functions is a contravariant functor, just like cohomology.
Sure, field coefficients or derived interpretation
makes sense, although I think there is something to be said about the fact that this does give cohomology itself richer structure
we get to do it integrally and discretely, even with torsion
the real heart of the issue being that failure of the Kunneth sequence to be iso/collapse demonstrates that, while H_*:D(R) -> R^{Z} is lax sym mon, it fails to be strong (or oplax)
Is there any situation where we would care about coalgebras (comonoids in the category of vector spaces or modules) for their own sake, and not because they arise from dualizing monoids in some other category?
The only case I've seen is the coordinate ring of an affine algebraic group.
they matter in part because you can compute with them
especially in algebraic topology
Right, the original and main issue is bialgebras, where you can’t just dualize
I vaguely remember reading that the cohomology ring of an H-space is a Hopf algebra (right?), and I thought “yes, I can see how that could make sense”, but didn't dwelve in the details.
So, intuitively, if we have a contravariant functor from spaces to rings, then it ought to send group objects (or “group-like enough”, in the case of H-spaces) to Hopf algebras, right?
Exactly
I think you need some finiteness perhaps but yeah
Basically cause you want Künneth to hold
I guess you don't need that perhaps cause the natural map still exists
Every open map is a locally homeomorphism? Right?
No. For any space the map to a point is open. For any non discrete space it is not a local homeomorphism
If answer yes, we why use this provides on definition of covering space? Because this same thing
Oh okay
Thanks
Not all local homeomorphisms are covering spaces. For example, the inclusion of an open set is rarely a covering space
Thanks you I understand now
For a concrete example, any non-constant holomorphic function C -> C is open. In particular f(z) = z^n, for n \in Z^+. But, if n >= 2, this function isn't a local homeomorphism near z = 0.
For 2nd bit, if we take f: R->R where discrete topology defined on R and f(x) = x then f is continuous but if we take coarser topology on R (on domain X) such that Euclidean topology which is coarser than discrete topology then f not be continuous, right? Because for singleton open {x} its preimage {x} is not open in X with respect to Euclidean
If T1 and T2 are different topologies on the same set X, then the identity map id : (X, T1) -> (X, T2) is continuous iff T1 is finer than T2.
Yes
Got it, thank you
So, let X' be X with a different topology, and similarly Y', and consider the composition X' -> X -> Y -> Y', where X' -> X and Y -> Y' are the identity map on the respective underlying point sets.
Make it easy by letting Y = X
From what I said earlier, it follows that, if you want to guarantee that the composition is continuous, and have no other information besides what your problem statement gives you, then you're only allowed to make the topology of X' finer than that of X, and the topology of Y' coarser than that of Y.
Got it
But is this a necessary condition?
Maybe not
It is sufficient
It's sufficient. Whether it's necessary or not, that depends on f. That's why I added “if you (...) have no other information besides what your problem statement gives you”.
Yes
For example, if f were a constant function, then you would be allowed to freely replace the topologies of both X and Y.
Yes
For a slightly less trivial example, you could consider a polynomial f(z) with complex coefficients as a function f : C -> C, where C has either the usual Euclidean topology or the cofinite topology, and in both cases f would be continuous.
Hello, I am not sure if this is the right place to ask my question (persistent homology, TDA); if not, please refer me to the right channel and thanks in advance.
Does someone know the proof of $VR(S, \epsilon) \subseteq Čech (S, \epsilon \cdot \sqrt{2})$?
- $S$ is a finite point cloud (of cardinality $n+1$) embedded in $\mathbb{R}^n$,
- $\epsilon \geq 0$,
- $VR(S, \epsilon)$ is the Vietoris-Rips complex such that a set ${v_0, v_1, ..., v_n}$ is a simplex in $VR(S, \epsilon)$ if and only if the Euclidean distance between any two $v_i, v_j$ is $\leq 2\epsilon$, and
- $Čech (S, \epsilon \cdot \sqrt{2})$ is the Čech complex such that a set ${v_0, v_1, ..., v_n}$ is a simplex in $Čech (S, \epsilon \cdot \sqrt{2})$ if and only if the closed balls centered around each $v_i$ with radius $\epsilon \cdot \sqrt{2}$ have a nonempty intersection.
the_indefinite_integral
The place that I found this inclusion relationship is https://www.researchgate.net/publication/260107617_Statistical_Inference_For_Persistent_Homology_Confidence_Sets_For_Persistence_Diagrams , page 39, but the paper does not give a proof for this.
To show that f: R×R -> R such that f(x,y) = x+y.
Now let (x_n , y_n) is a sequence which converges to (x, y) and using that result that if (x_n,y_n) converges to (x,y) then x_n converge to x and y_n converge to y.
Now we need to prove that f(x_n, y_n) converge to f(x,y) means x_n + y_n converge to x + y which can be proven by real analysis.
Is it correct?
What do you want to show about f ? That it's cts?
Yes
What is your definition of cts?
If it's inverse image of open sets is open then in your proof you need to show the equivalence here
They defined as but I proved that sequential criteria is equivalent to this definition in metric space
Yeah then it's okay
Okay, thank you
Try to show it without sequential criteria tho
That lemma is unnecessary
Just find inverse image of a standard basis element
But how can I find (f+g)^(-1)(a, b) ?
That's same as saying for what x,y a < x+y < b
fix a var
If you can then see it's plot
It's the region in between two diagonal lines?
Yes
Btw what are diagonal lines?
No I mean which lines said to be diagonal lines, is it the same as straight lines?
I meant these when I said that
Okay
Do you know how to show that it's open?
No but wait I am trying
||a viable option could be that the every point in that region is an interior point||
||given a point in that region try to find a rectangular open set containing it||
What if I pick a point between in that region (x,y) and find the perpendicular distance from x+y = a and x+ y = b be p_1 and p_2 respectively then B((x,y), min{p_1,p_2} ) lie in that region, is it correct?
yes but avoid too much calculation when you can
Instead of perpendicular distance from lines
Try distances from axes
Given a x_0, y_0 in that region
How far you can slide it vertically and horizontally
This is same as fixing either x_0 or y_0 and seeing the variation in y
Using this inequality
Oh
This is for verifying
||given (x',y') in that region
x' lies in (a-y',b-y') and similarly for x'||
|| Now pic the minimum of these values and half it and draw a circle with centre as x',y' and radius as that halved distance||
But when I want to prove that (x,y) ->xy is continuous mapping then I think sequential criteria is good, right?
It is good always but not necessary
The more we interact with our objects the better it is imo
Minimum of what?
Sorry I don't understand it, we have a-y' < x< b - y' and a-x' < y' < b-x'
The consider min{|a-x'-y'| , |b-x'-y'|}
This is just distance of y' in the interval that we found or x' in the same way
Hello, can anyone check if this proof is correct? N(x) is the set of open neighborhoods of x
If we let f: [0,1 ) -> S^1 such that f(x) = (x,√(1-x^2) ) is homeomorphism mapping, right?
It's an embedding
i.e. a homeomorphism into its image as a subspace of S¹
But not a homeomorphism to S¹
(0,1) and (1,0) respectively
right
and is there x such that f(x) = (0, -1) for example
Got it my mistake
Thank you
What can be continuous bijective mapping from [0,1) to S^1 such that it is not homeomorphism?
Hint: angles
Yes t-> (cost, sint) but I am not sure
why are you not sure
actually (cos 2πx, sin 2πx)
Yes if you do that then this is quite clearly continuous and bijective , nothing to check
Because, t->(cost, sin t) is not bijective, right?
Yes it works
it's not surjective if it's only defined on [0, 1) to be precise
you'd have to have domain [0, 2π)
Yes
you can also represent it by x ↦ e^2πix
what is this actually showing?
something like, there is a function from X x X into the set pi_1(X, -) x pi_1(X, -) such that...
Function from X x X?
Ah, do you mean "depend only on.." part?
I think you just need to show beta_h is constant if endpoints are fixed
To clarify beta_h doesn't have to be constant, but for any two paths h from x to y the result should be the same
i can show the result just fine and i understand how to interpret the result at face value, like account said above
i was asking if there was a kind of more general interpretation
for example, this question:
it shows that there is a map from [I,X] to pi_1(X,x_0) for each x_0
taking a homotopy class of paths to the change of base point map of one of its representatives
and the exercise proves that the map is well-defined
oh, i think this one is a map from X^{S^0} to pi_1(X,x0) for any fixed x0
this one is equivalent to 2.
You mean a map from [(I, 0, 1), (X, p, q)] to Hom(π1(X, p), π1(X, q))
oh yes
what is the extended notion of pointed space
can you specify as many points as you want? or an entire set even?
I guess you can add as many points or subspaces as you want
If you consider only loops at p, you get a map from [(S¹, ·), (X, p)] to Hom(π1(X, p))
Which is a group action
In contrast, this is what's known as a groupoid action
The fundamental groupoid Π1(X) is a category whose objects are points in X and morphisms are homotopy classes of paths
And just like group action, a groupoid action is just a functor Π1(X) → Set
ill look into the fundamental groupoid some more later.
what is the group action?
π1(X, p) acts on π1(X, p) by conjugation
how did you see that it was conjugation from this?
right, but uh. this is taking based loops to their change of basepoint homomorphisms
The loop γ is sent to the conjugation (x → γxγ^-1) ∈ Aut(π1(X, p))
and then the second one, is fixed to
{(S^0, -1, 1) --> (X, p, q)} --> Hom(pi_1(X,p), pi_1(X,q)) for each p,q in X
so you do end up getting maps X x X into this hom set
via X x X --> {(S^0, -1, 1) --> (X, -, -)}
and again here
via a similar map
i wonder if this map is meaningful?
like X x X quotiented by (p1,q1) ~ (p2,q2) iff their corresponding homomorphism maps are the same
I think you mean there is a unique map in Hom(π1(X, p), π1(X, q)) for each pair (p, q) ∈ X×X
I don't think the homomorphism map can be the same, but I dunno what you mean
uh. wait. why can't you do this? f : X --> Y can be quotiented by x1 ~ x2 iff f(x1) = f(x2)
This translates to the groupoid action being trivial
What do you mean the corresponding homomorphism maps are the same
yes
The domains and codomains are different for each homomorphism
Can you concretely talk about which map this one is?
If you restrict to loops at a point p, you get the statement that π1(X, p) acts trivially on π1(X, p) as a group
so, i keep getting lost in the sauce
But for pairs (p, q) in general this is not a group action, this is a groupoid action (a trivial groupoid action)
Same thing happens here: the action by loops at p is a group action, but the action by paths in general is a groupoid action
um.
we got that there is a function {(S^0, -1, 1) --> pi1(X, p, q)} to Hom(pi1(X,p), pi1(X,q)) for each p,q in X
so there is a function X x X to U_{(p,q) in X x X} Hom(pi1(X,p), pi1(X,q)) taking (p,q) to beta_h for any path h from p to q
@merry geode
What's U
I think how the union is defined is important.
This would be basically like a generalized function, where each image are disjoint.
well, i just mean the union
why?
Yea that's just this
$\prod_{(p, q) \in X \times X} Hom(\pi_1(X, p), \pi_1(X, q))$
but whats wrong with union?
Absta
Generalized function
What
i don't see why you need this
How do you identify element of Hom(pi1(X, p1), pi1(X, q1)) and Hom(pi1(X, p2), pi1(X, q2))?
(I am saying that basically the union is going to be disjoint union, and for each (p, q) in X x X there would be one Hom involved)
Let's stick with this
its the change of basepoint homomorphism resulting from a path taking q1 to p1.
there is only one such map
by this
Why?
because it only depends on the endpoints p1 and q1
Ah, are we assuming that Hom(pi1(X, p), pi1(X, q)) has unique element?
And by extension, maps between such homs are unique (if defined)
wait. im just arguing with you to try and see why im wrong, i have no idea about any extensions.
am i misunderstanding this? each pair (p,q) determines a unique point in Hom(pi1(X,p), pi1(X,q)) via the change of basepoint map taking q to p
Yes
okay, so then whats wrong with unioning over all (p,q)?
Yeah the Hom set has only one element
Nothing
no, thats what i mean
What was your question again
basically, with regards to this question, is there a map X x X into something, based on the result that the homomorphisms only depend on the homotopy class of h
in the second part of this proof, why does he define $P = N + b$, rather than just saying that $A$ is a subset of $[-N, N]^n$?
Henry
Since disjoint union is not a very natural construct here
The part I want clarified is this: Do you understand that the union you wrote earlier is a disjoint union?
yes but why does it matter?
Ah, yeah that was one of the point of confusion for me
Let's say, G(p, q) := Hom(pi1(X, p), pi1(X, q)).
X x X -> \bigcup_{(p, q)} G(p, q) isn't that natural, considering (p, q) always maps into the unique element of G(p, q).
You can, instead, consider G(p, q) as a Hom set of category, where points like p and q are objects.
why would that be not natural? (p,q) maps to a unique element of G(p,q)
I mean, it's not like you can have any map from the domain to codomain
oh
(p, q) will only map to G(p, q)'s element, hence there being a huge restriction
so you instead look at a category where objects are pairs (x,y) in X x X and morphisms are...?
This kind of stuff does happen with sections as well;
Sections of bundle E over X are like, s: X -> E where X -> E -> X is identity.
Objects are points of X.
That is, p is an object.
q is also an object.
oh my b
G(p, q) is the set of morphisms between p and q
but im specifying only one
oh oh
okay
why is it better to view this as a category
Idk, category is everywhere
Might as well view this one as category as well
Also, fundamental groupoid is basically what you need from eliminating the basepoint.
Like, pi(X) is no longer a group, so you need more general object; which happens to be a category!
and pi1(X) is the category whose objects are points of X and Mor(x,y) = Hom(pi_1(X,x), pi_1(X,y))?
The fundamental groupoid Π1 is the category whose objects are points and morphisms are homotopy classes of paths
Hmm wait, let me think, that is not the pi1.
There is a functor Π1 → Set sending p to π1(X, p) and sending any path γ: p → q to the basepoint change map (x → γxγ^-1)
The statement that the basepoint change map depends only on the endpoints is the statement that each path in Hom_Π1(p, q) is sent to the same element of Hom(π1(X, p), π1(X, q))
This is called a trivial groupoid action
and the groupoid that i know as a group with a partial function replacing the binary operation is the same as the category theory groupoid?
I'm not familiar with the partial function definition
A groupoid is a category where all morphisms are iso
And there is a morphism between any two objects (connected)
So unlike a group, composition will require domain and codomain to match in some way
e.g., if X is not path connected, you cannot define any map in Hom(pi1(X,x), p1(X,y)) for x,y in different path components
so its only defined for certain pairs of points in X x X
hence a partial function X x X --> X
I think it should be a partial function {paths in X} × {paths in X} → {paths in X}
The multiplication is path composition
What is square metric
oh okay
And it's partial because you need endpoints to match to talk about composing paths
because A is not always a subset of [-N,N]^n, it is a subset of [-P,P]^n
Max distance of any component
Sup norm ok
wait yeah so there was just no reason to define P at all right
no
Have you seen the categorical definition of groups and group actions
the bound you have is that p(x,0) <= N + b for all x in A
so by definition, A is a subset of [-P,P]^n
A morphism need not be a (partial) function.
thats not what i was saying
and yes
well, only groups really, as a groupoid where every morphism is an isomorphism
and there is a morphism between any two points
i can look into those later. gotta gts now
thank you both for your help/discussion 🙂
Is it that A is not necessarily a subset of -N,N?
That sounds wrong
Oh yeah thats true
Its because -N,N is centered at origin
You got it?
Also isnt this heine Borel?
Is nlab's treatment of derived functors worthy of learning?
Well they have two pages on derived functors @merry geode which do you mean?
Anyway - both are very standard, so yes it is good to learn them, but for an introduction I'd probably just look at Weibel or another homological algebra text
Well, I mean, it seems like infinite category stuff is common in nlab.
(Tho I do need to learn model category, I think)
I will say that the nlab page on derived functors in homological algebra seems quite traditional (i.e. not ∞-categorical)
which is not a bad thing
if you wanted an ∞-categorical treatment, I do think that HA's treatment of this is pretty great, although it is unapologetic enough that it'll probably force you to learn ∞-cats if you try to read it
(see HA.1.3.3.2)
The point could be very far off the origin, i.e. say we have [5,7] and x0 was picked to be 6. then [-1,1] is not going to cover it
First read Gelfand-Manin and then read Gelfand-Manin
Ah thanks, I don't know how I could not find this page.
Here @paper wedge
I will throw my hat in the ring
∞-cat theory begins with the notion of "homotopy coherent algebraic structure;" you begin by noting that it is ""wrong"" to assert just that (based) loop spaces just have a monoid structure "up to homotopy," as this is quite weak and you sometimes would like something better (e.g. as is used in the definition of Dyer-Lashof operations)
you need to remember the homotopy witnessing x * (y * z) ~ (x * y) * z for based loops, and you better end up with only one homotopy witnessing 4-ary associativity, up to homotopy
then you recognize, ok well you need to remember the 4-fold "coherence" homotopy you just constructed, and you need to verify that you haven't created ambiguity on the 5-fold stage, and so on and so forth, each time adding more homotopies for higher arities
the paranthesizations of an n-ary operation are parameterized by Stasheff's nth associahedron, and filling in homotopies into the facades of these polytopes yields a precise model that allows you to define "homotopy-coherently associative" (i.e. A∞-algebras) in ordinary foundations
this is obviously uh
really complicated
and if you're doing this in traditional categorical frameworks (e.g. model categories or homotopical categories), this is just a massive algebraic theory you need to lug around everywhere, and be really careful about constantly
enter an idea: make a new categorical framework, where this sort of "coherently filling in homotopies instead of making diagrams strictly commute" process is just what a commutative diagram/functor means
hence all of your constructions are immediately and easily compatible with A∞-structures; that is just what the word "monoid" means in ∞-cat theory. This staves off a lot of the difficulty of bookkeeping that otherwise made a lot of homotopy theory leading into the mid aughts just intractable to work out and near-impossible to read
Boardman-Vogt had the idea in the 70s to do everything homotopy-coherently, Joyal envisioned it in the early aughts with some foundational work on a particular model for ∞-cats, and Lurie carried us out of the 2008 financial crisis by finally writing enough things down about this model to make it usable
16 years later we're still finding that a lot of things are clarified if you stuff the bookkeeping into foundations of the ∞-cat framework, so much so that it's become pretty solidly ubiquitous in homotopy theory; now technologies which are only really imaginable in the ∞-cat framework (e.g. synthetic spectra) are ubiquitous along the cutting edge of both theoretical and computational work in homotopy theory, since these ∞-cat setups excel at getting themselves and nasty technicalities out of the way and letting you work intuitively
i like the phrasing that Lurie's work fixed the 2008 financial crisis
wow somehow I understand the sentiment of what you wrote
is it true that in a Haussdorff space, you can always find disjoint nbhds U, V of points x, y, respectively, such that the intersection of V and the closure of U is empty
Yes. Hint: ||Choose disjoint open neighborhoods U,V of x,y since it's Hausdorff. Observe that the complement of U and V are both closed||
This sounds very close to T_3, so I’d guess that a space that is Hausdorff but not T_3 provides a counter example
so the closure of X - U is just X - U? (and similarly for V)
but how does this show ^
The closure of a closed set is itself
right
If A is contained in a closed set C, then the closure of A is also contained in C.
Take A = V and C = X-U
Any suggestions of how you’d go about proving that the homological and homotopic degree of a continuous map between two unit circles are equal
Do you have any tools relating pi_1 to H_1
Is it good to learn infinity cat even if I would not do strictly algtop research?
It does seem quite involved, and idk if my usual intuitions of categories would apply
hey, is there a general graphical interpretation for a topological space?
As a vertex and edge kind of graph?
hm, i don't really know what you mean by that, I'm new to (general) topology. I mean if there is a way to create a mental (3d) image of a topological space. Not questioning a particular one.
I think most people just visualize a space like R² or R³, and if you're working with something like a Hausdorff space then most of your intuition will carry over. But I don't think there's a nice way to visualize a general topological space
What is a Hausdorff space? How advanced is it?
it's a topological space which has the condition that, given distinct points of your space, there exist open sets containing these points which don't intersect
Well that’s what I’m asking
do you know what the abelianisation of pi_1 is?
Oh. Isomorphy of the abelianization group of pi_1 with H_1?
Thx
Oh ok, thx
When did you guys start studying topology?
2 months ago for point set topology
Oh wow, do you study pure math?
Do you also study at uni?
I just finished my master's
Topology was what got me interested in studying maths (instead of physics) in the first place aha so I was exposed to a tiny amount in high school by a friend, which I didn't really understand
Well done
likewise !
Yeah but I do mathematical physics
Doing a PhD program
I want to learn more math physics
Lmao. I wish it were easy to switch to pure math for that same reason
Oh nice !
trying to do higher gauge theory this summer but the category theory background is a lot
I swapped from physics undergrad to maff lol
Super cool
Thankfully did both so I can switch with some effort
You got it, m8
Wow thats crazy. I want to study math myself at university full time after school. I took part in a program, where you can study at uni before graduating school but I got really burned out. Then I stopped and now I'm trying to get back in.
Can you use topology in physics?
Yeah
You kinda use it in QFT and condensed matter
String theory if you’re going there too
But you’ll probably not need it
Can someone give me an example of a set D?
R^2 minus the origin as a subset of R^3
No, you should not automatically learn such an involved thing, unless it is directly applicable. The difficult question is how much you should know to recognize a new discovery that it is applicable
Ah, I see. Thanks a lot!
I will judge based on where my interest goes.
for maps $f,g:(S^n,s0)\longmapsto (X,x_0)$, define
$f\vee g : S^n\vee S^n\to X$ as $f$ on the first sphere and $g$ on the second sphere. $\newline$
Let $\psi : S^n\to S^n\vee S^n$ be the quotient map resulting from collapsing the equator of $S^n$ to a point, taking the upper hemisphere to the first sphere and the lower hemisphere to the second sphere. $\newline$
Define the concatenation of two maps $f$ and $g$ as $f + g = (f\vee g)\circ\psi : S^n\to X$ $\newline$
How do you go about showing that this is equivalent to the definition of the $n$th homotopy group defined for maps fixing the boundary of $I^n$?
c squared
What is the typical/most common topology on the tensor product of multiple hilbert spaces?
Can someone explain hopf invariants?
I know about hopf fibrations and homotopy, but I'm not super amazing at topology
Is there a nice construction of $\mathbb{G}_m\wedge \mathbb{G}_m$ in the category of (Zariski/Etale/Nisnevich) sheaves valued in spectra (or spaces)?
Finitely Many Bananas
The one induced by the norm, where the value of the norm on a simple tensor is the product of the norms of each component
By nice I mean a construction that can be formed using schemes and categorical constructions (pushouts/pullbacks,fibrations,cofibs)
do people ever use sheaves valued in (a subcategory of) topological spaces?
has anyone read donald yau’s book on colored operads? i’m trying to understand the details of a proof when he showed that the category of algebras over the ass-operad is isomorphic to the category of monoids
There are lots of places where sheaves should be valued in topological vector spaces, but it is difficult to exploit the structure. The program of condensed sets is intended to attack this
For example, on a complex manifold, coherent sheaves are naturally valued in topological vector spaces. You can use this to prove that on a compact space the cohomology is finitely generated. More generally, there is the Grauert-Remmert theorem that the push forward of a coherent sheaf across a proper map is coherent. This is a difficult theorem, whereas in algebraic geometry it is just the relative version of the previous theorem. I think if you had a good handle on the topological vector spaces, it wouldn’t be any harder
I am wondering if it is possible that lim x->0 f(x) does not exist?
a topological pair (X,A), let (X,A) be a HEP then any map from A go to X is a cofibration right?
It's the inclusion map A → X specifically
is there anyone who can answer this question?
Yes, 1/|x| blows up near 0
so we're treating infinite limit as "limit doesn't exist"
Yep, although it's a bit of a gray area since we're allowed to write $\lim_{x\to x_0} f(x) = \infty$. So it sort of exists, but not really
Outsider
It definitely doesn't exist in a topological sense.
(Unless something something compactification)
(but even with something something compactification it won't be a limit in R / R^n)
Well the codomain of f is R so conventionally ∞ and -∞ wouldn't count
Yep, I agree, I'm just pointing out that in areas such as calculus and measure theory it's perfectly normal to consider ∞ as valid limits of sequences/functions.
With varying degrees of rigor involved
Is every such function guaranteed to converge in stone cech compactification of R
Idts
The best example for a question like this imo is |e^(1/z)| on the complex plane
Well that one certainly doesn't have a limit at 0
my question on about question b, how that is possıble? we are saying X contractible if identify a map should be null homotopic, but question just explain a map if identify a function null homotopic then we need two map ?
I don't follow
Contractible means there is some continuous X × [0, 1] → X that restricts to id: X × {0} → X and X × {1} → {p} ⊂ X
Can you show that such a map exists for Y?
r a retraction then Y x [0,1]--->Y, Y x {0}---->Y and Y x {1}--->{p} and this is subset of X and Y
Yes, this is what you need to show does exist
thank you
The usual topology on Sn is the subspace one right
arki honourable 
I am having some trouble with proving the backwards ocnditional (<=) [the stuff circled in red]. I have a full proof however it seems kinda awkward and not very solid. Is there either an easier way to do this or a way to improve my current proof?
Let X be an arbitrary set, and let B be a basis for a topology T on X. Then T is the discrete topology on X iff B contains all the singletons in X.
But your basis for the product topology on $\prod \nolimits_{i \in \Lambda} { 0, 1 }$ contains the singletons precisely when $\Lambda$ is finite.
Eduardo León
The elements of your given basis are of the form $\prod \nolimits_{i \in \Lambda} U_i$, where each $U_i$ is an open in ${ 0, 1 }$, and only finitely many of the $U_i$'s are proper subsets of ${ 0, 1 }$.
Eduardo León
yes
how would u prove that if lamda not finite then B doesnt contain the singletons?? that part kinda tripped me up
First a trivial remark. The expression $\prod \nolimits_{i \in \Lambda} U_i$ denotes a singleton set if and only if each $U_i$ is a singleton.
Eduardo León
yep makes sense now ty
damn i didnt think of just doing it that way instead of proivng => and <= individually
I hate double implications and double inclusions so much.
I mean, if there's no other way, then I will use them, of course.
But I prefer proving equalities directly, whenever possible.
Yes i need to start being more lazy. Cuz most of the time im like ugh and then i just do them anyways instead of spending some time trying to avoid it
which ends up with a page long proof and half hour down the drain
😅
damn wtf is my writing...
When I took topology, all my take-home test answer sheets were full of correction fluid.
Actually, not just topology.
I am confused by some exercise I am doing and would like some clarification.
Assume X is an infinite CW complex (i. e. has an infinite number of cells) show that the cone CX cannot be embedded in R^n for any n.
The source of my confusion. Can't we take X to simply be a discrete set? (Infinite number of 0-cells). Then for the cone we simply connect all of these to a new point and easily embed it in R^n?
How would you embed that in R^n
The cone over Z isn't embeddable in R^2?
Oh, I was thinking of using Z x {0} as the image of Z and (0,1) as the vertex of the cone. But then I realized that the segments connecting each (n,0) to (0,1) get very close to each other near (0,1).
Anyway, that cone is itself a CW complex, right? Because we can take first X x I and then collapse the subcomplex X x {1}.
CZ is a CW complex
Then the vertex has infinitely many adjacent cells, in the scenario of the original question.
Okay, suppose we have a CW complex Y and an embedding Y -> R^n. Does there necessarily exist a CW decomposition of R^n that makes Y a subcomplex of R^n?
Oh, duh, right.
Okay, let me rephrase then.
Suppose Y is embeddable in R^n. (The embedding isn't given a priori.) Do there necessarily exist an embedding Y -> R^n and a CW decomposition of R^n that makes Y a subcomplex of R^n?
To make this question more approachable: I suspect the answer is no. But it comes down to finding a CW complex Y which one can show has an embedding into R^n which is not closed, perhaps it helps to know that one way to show this would be to show that no embedding could be a configuration
*cofibration
I will go further and say I bet there is an example which is a graph that embeds in R^2 but has no closed embedding
probably something along these lines
I am not going to read the paper carefully enough to discover if by embedding they mean "injective continuous map" or "injective homeomorphism onto the image"
but I hope that at least one of their examples admits the latter
anyway if it doesn't work for a 1-dimensional CW complex I firmly believe there will be a higher dimensional counterexample
Take the tetrahedron graph and add a ray to each vertex
It embeds
^^ there you go
Ah, thanks!
Say I have a topological space $X$ and a sequence $(x_n)_{n \in \mathbb N}$ in it.
Put $E = { x_n : n \in \mathbb N }$. Say $y \in \overline E \setminus E$. Can I say, then, that $(x_n)$ has a subsequence converging to $y$?
phao
For metric spaces, I believe this can be proved with a diagonal argument. Is it true for a general topological space?
probably true with nets
Yeah
it is true in Frechet spaces
well its what they are really
not the ones from functional analysis
in particular, all first-countable spaces are frechet
Thank you.
I don’t think this works
But im pretty sure this is false in general topological spaces
there are topological spaces in which no sequences converge except eventually constant ones
(nondiscrete ones, of course, otherwise that would be boring)
for example, SC compactification of N is such a space, in it N is dense but you cant get anywhere with just a sequence of elements of N
Ok nice
Thank you all
Can 2 loops (or, more generally, any 2 paths) be homotopic if they have "double points?" For instance, below are 2 loops - f0 at basepoint x0 and f1 at x1, except f1 crosses itself at a single point. If f0 and f1 shared the same basepoint, could they be homotopic?
Similarly (and this may answer my question), can loops that intersect themselves be used in the calculation of fundamental groups? I'm almost positive they must be, since calculating the fundamental group of a circle requires that we consider loops that retrace themselves as distinct.
Yes, if you move x0 to x1
Yes these two things are freely homotopic
Indeed both are homotopic to the constant loop
oh ok
if you want loops within D^2
Well, D^2 is contractible
So this will always be the case
yeah i kind of figured since the fundamental group of a circle required it
If you want fundamental group of the circle, then uh these aren't even loops in the circle
yeah lol just the loops that constitute it would cross themselves
Does anyone know a good book that discuss persistent homology and persistence diagrams?
there is no diagonal argument needed, it's true that if $\bar{E} - E$ is nonempty then by definition there is a subsequence converging to $y$ (as long as you allow constant subsequences). Here $E$ converges to $y$ is basically defined as $y$ is a limit point of $E$ which is not in $E$ .
Math_Discord_Final_Girl
but even in metric spaces you can have sequences where no subsequence which is not eventually constant converges
(you probably understand already, but) the fundamental issue you were grappling with is that, when we say "loop", we mean the function f: [0,1] -> X, with f(0) = f(1) = x_0, we don't mean the image of the function (which a layperson may call a "loop"). nonhomotopic loops may have the same image (you don't expect, in general, for some loop run in reverse to be homotopic to the original, nor the loop run twice over) and when we're manipulating loops around, we're manipulating the function not the image, so cross over points dont restrict anything.
Oh, I guess I never thought of it that way, that makes a lot of sense. Does that mean we can compare double points to the function being non-injective?
Strictly speaking, as a function from [0, 1] it is already not injective
After all $f(0) = f(1)$
Pseudonium
But uh
Oh true
$0 \neq 1$
Pseudonium
But excluding the basepoint
So maybe a better way to phrase this is
One can use the universal property of the quotient
To convert to a function $\tilde f : S^1 \to X$
Pseudonium
And double points will mean this function is not injective
Oh yeah the circle kinda makes that compute
Is that true of the interval if we just exclude the basepoint, though?
Sure, so you can restrict the function to $(0, 1]$ or something
Pseudonium
Ah neat
But yeah in general
Curves it makes more sense to think of as functions rather than as just subsets
Hi, how I identify (a,b)? If c is a curvature of a manifold c:(a,b)---->M (M is a manifold).
ТТерра
I have a doubt. We know that the countable union of countable sets is countable. Does this result still hold if we take the arbitrary union of countable sets?
No.
Every set is the union of its singletons, or the union of its finite subsets, or etc.... Now pick your favorite uncountable set like real numbers
Okay. Thank you!
Are Stone-Čech compactifications actually useful for anything, or are they just a logical curiosity?
Condensed mathematics for instance
But also Stone Cech compactifications are just a natural thing that pop up
Where do they pop up?
For instance Spec(\times_n F) is the stone Cech compactification of N
if you let the product be over positive integers
Generally the Stone Cech compactification shows up inside of the space of maximal ideals of all kinds of rings of functions (even just entire functions on C)
well first of all even categorically its an interesting object because all maps into compact spaces factor through it
Ah, understandable. Because it's compact and it contains a dense subspace that is the countable disjoint union of Spec(F)'s...
Yes also you can explicitly show that ultra filters are the same as maximal ideals
they are useful when studying how badly something fails to be compact
N fails spectacularly so its SC is a monster
Does R fail that badly too?
dont actually know much about SC of R, sorry
one way to view SC is all the "virtual" points your space has
anyway there are lots of examples. I don’t think it’s fair to say they’re “just a logical curiousity” because they’re a very natural part of mathematics. They show up in functional analysis as well due to the natural iso $C_0^{bd}(X) \cong C_0(SC(X))$
Math_Discord_Final_Girl
all the limits you can take in your space
In particular SC(R) contains at least one copy of SC(N) by picking any discrete infinite subset of R
So yeah it’s also a mess
Ah, I know no functional analysis. But when a friend who took functional analysis gave me his notes, there was nothing in them that would've depended on the axiom of choice.
the compactifications that are smaller than SC, then, are basically you taking some of the "virtual" points and gluing them together
that’s not possible
Hahn Banach is one of the most fundamental tools in functional analysis and is equivalent to some version of choice
Or no what’s it called
Hahn Banach
Makes sense.
Personally I've never had any use for the Stone-Cech compactification ||because my research only involved spaces which were compact to begin with|| 
note that it is also true for all non-pseudocompact hausdorff spaces
uhh maybe you need like being Tychonoff instead of hausdorff
a (Tychonoff) space is not pseudocompact iff it has a C-embedded copy of N
(C embedded meaning that you can find a continuous extension of any continous function defined on the subset)
a good exercise to see the "naturalness" of SC is
pick a dense countable subset in your favorite compact space (works funnier if the space is not first-countable), fix an enumeration of it
then for every ultrafilter on N there is a prime filter corresponding to it in your space, i.e. there is a unique limit for that filter
for easy visualisation you can do it with [0; 1], you divide the space in half each time, only one half of the dense subset lies in the ultrafilter
so ultrafilters on N are kinda like your maps to find limits in a compact space
when talking about compactifications, i always assume the space is tychonoff anyways 
oh yeah for sure
i meant this part
I think being hausdorff is enough
actually
yea it should be enough
It’s not standard, but it is possible. Hahn-Banach is a crutch, not fundamental. No useful application of functional analysis depends on choice
Okay, no, my bad. My friend's notes do mention Hahn-Banach.
How is it a crutch?
How is it useful?
No idea. I don't know functional analysis, as I said before.
wait how do you do Hahn-banach without choice
I think they're saying Hahn-Banach is unnecessary
It’s equivalent to choice
oh
huh…
It's weaker than choice
i remember using it a bunch
it’s very useful for getting elements of the dual space
Well, the statement was that it has no "useful" applications, and I am not going to tread on the extremely thin ice of arguing which parts of mathematics are useful
So I guess the way to do it without choice is to take it as your axiom instead 😛
(the answer is "almost none of it")
i mean…
Fun is useful and usefulness is transitive 
apparently functional analysis is what you need to make QM rigorous or smth
Absolutely, I'm not saying mathematics shouldn't be done, I just prefer to think of it as a form of abstract art.
With the value being mostly aesthetic
yeah ig we have different perspectives on it
for me maths is a tool
so i like it when it’s useful
even if that use is in other maths
that’s still fine
Maybe you need Hahn-Banach to prove the existence of dual vector spaces. But in practice you can just write down the duals
wdym
yeah i like my vector spaces to have bases sorry
I don't really need Hahn-Banach or Axiom of Choice, and I happily reject them in favour of the Zorn Lemma
I guess Hahn-Banach ensures that the continuous dual of a nonzero vector space is again nonzero.
yeah that seems pretty important lol
Anyway, I'm much more willing to admit Stone-Čech compactifications (which I originally called "a logical curiosity") are useful than this.
I thought Hahn-Banach was weaker than choice?
Apparently HB is equivalent to Stone-Czech, which is weaker than AC
Yeah
The only reason why I know this is that we have a question "what is yellow and equivalent to the axiom of choice?", for which the answer is "zorn's lemon", but me and my friend were trying to get "Hahn-Bananach" to work lol
@topaz plover
At my uni Hahn-Banach was known as the Hanna-Barbera theorem
(makes more sense in Polish because it's "Twierdzenie Hahna-Banacha", so the rhythm fits)
So you assume both not AOC and Zorn’s lemma before proving anything? You must be a very successful mathematician
for hilbert spaces you don’t need Hahn Banach, you can actually construct a separating hyperplane by hand
Oh huh
like you wouldn't believe 
lets me deduce anything
Even in non-separable ones?
(I'm not questioning you, just curious)
This is probably going to depend on the precise statement
What are you separating? Convex sets or strictly convex sets?
Are they compact?
With the "extending continuous functionals from subspaces" version you can probably just explicitly construct the extension by referring to the orthogonal complement.
Unless that relies on AOC in a subtle way
It only does if you define 'Hilbert space' in a slightly dumb way
Specifically completions of metric spaces are slightly subtle without countable choice. It's not good enough to use sequences
You have to use something like Cauchy filters
But if you use Cauchy filters in the definition then orthocomplements work fine
Cauchy filters?
Uh yeah so recall that a filter on a space $X$ is a family $F$ of (let's say non-empty) subsets of $X$ that is closed upwards and closed under intersections. Given a metric space $(X,d)$, a \emph{Cauchy filter} is a filter $F$ such that for every $\varepsilon > 0$, there is an $A \in F$ with diameter less than $\varepsilon$.
Exomnium (MSC2020 03C66)
If you're trying to do metric space stuff without countable choice for some reason, then the right way to define completions of spaces is in terms of Cauchy filters instead of Cauchy sequences
Constructively they're also a lot better behaved
You'll take dependent choice from my cold dead hands. And dependent choice implies countable choice.
Dependent choice says “nondeterministic algorithms either terminate or don't”, which is so obviously intuitive to me.
(although I would also say life without BPI is rough)
What's BPI?
Oh yeah that's tough
What does BPI buy you?
Compactness theorem in model theory
Hahn-Banach
existence of prime ideals in rings
ultrafilters
Is BPI stronger than dependent choice?
they're incomparable
cant you take the set of basis of the form [a, b), for rationals a and b to be a countable basis of R_l
also [a, infty) and (-infty, b)
How do you write $[\pi,\pi+1)$ as a union of open sets of that form?
Exomnium (MSC2020 03C66)
no because then there won't be a basis member contained in [x, x + 1) for irrational points
does this proof of thm 17.8.1 really hold for the case where the base point is fixed?
some assumption might be missed, like what wikipedia tells us for Leray-Hirsch the restriction on each fiber to the basis for a cohomology
Let D¹ be a disk and D¹={1} then d)D¹={1}. My question let X be topological space and p:d)D¹---->X a attacking map right? And d)D¹=1 meaning 1~p(1) a cell right?
I absolutely cannot understand what you are trying to ask.
Asking in your original language or asking a more carefully translated question would be more helpful.
(arki what does this mean?)
(Oh okay, that clarifies a lot
)
they’re learning about CW complexes/decompositions and attaching maps
This question arose due to definition I dont think i understand to attacking map i need a disk and boundary of disk also this map from boundary of disk go to any topological space this is definition of attacking map right? And we saying image on topological space of boundary of disk with boundary of disk relation called a cell the definition and my understanding the same thing?
is the definition that of a CW complex?
I have only seen attacking map and attacking n-cell at the moment and is the definition i understand the same as the correct definition?
when you attach an $n$-cell to $X$, you take a $D^n$, you take a map $\phi$ from $S^{n-1}=\partial D^n\to X$ and you get a new space by identifying each point $x$ in $\partial D$ with $\phi(x)$ in $X$. $\phi$ is the attaching map here
australian pizzeria
thank you I understand now @gentle girder
Ohhh I just realized it's a p:(an)d(a) attacking map 
in the first part of the response to this question https://math.stackexchange.com/questions/3652459/prob-11-sec-30-in-munkres-topology-2nd-ed-a-continuous-image-of-a-lindelo, $f(X) = f(\overline{D}) \subseteq \overline{f(D)}$, but don't we have to show containment in the other direction? dont we need to show $\overline{f(D)} \subseteq f(X)$?
Henry
(Т*Терра, dqⁱ ∧ dpᵢ)
From my understanding, it is generally easy to determine the homology of a finite cw-complex.
Is it also generally easy to determine the homotopy type?
Also, is there such a thing as a classification of homotopy types for, say, manifolds?
Here is a finite CW complex that is very difficult to understand precisely in the homotopy category:
let \Delta^n be an n simplex
Now remove the inside so you’re only left with the n-1 dimensional faces
no not really, being homotopy equivalent to a compact manifold puts some mild restrictions on the homotopy type but not many.
thanks
In mathematics, specifically in geometric topology, surgery theory is a collection of techniques used to produce one finite-dimensional manifold from another in a 'controlled' way, introduced by John Milnor (1961). Milnor called this technique surgery, while Andrew Wallace called it spherical modification. The "surgery" on a differentiable manif...
That's another way to say (n-1)-sphere, right?
what does it mean for RP^n to be "covered" by n + 1 affine charts?
It is a union of affine subspaces
uh
i dont know what those are either
all ive seen in the text so far are principle affine charts
When you construct $\mathbb{RP}^n$, you use $(n+1)$ copies of $\mathbb R^n$, where the $i$-th copy $U_i$ has coordinates $x_0, \dots, \widehat{x_i}, \dots, x_n$. Letting $U_{ij}$ be the open subset of $U_i$ where $x_j \ne 0$, you glue $U_i$ and $U_j$ with the transition functions $\varphi_{ij} : U_{ij} \to U_{ji}$, $\varphi_{ij}(x_0, \dots, \widehat{x_i}, \dots, x_n) = (x_0 / x_j, \dots, x_{i-1} / x_j, 1 / x_j, x_{i+1} / x_j, \dots, \widehat{x_j / x_j}, \dots, x_n /x_j)$ for each $i < j$.
But this construction works perfectly fine if you consider the $U_i$'s as a copies of $\mathbb C^n$ rather than $\mathbb R^n$. And then you get $\mathbb {CP}^n$.
Eduardo León
what does the hat mean?
Question: Let X be a (finite) regular CW-complex and f: X -> X be cellular such that f fixes the centers of each cell. Is f necessarily homotopic to id ?
Degree -1 map of the circle to itself
But if you use 1 1-cell, its not regular. If you use 2, its not fixing centers.
(I think)
What is the definition of regular? The map on the boundary of a cell is injective?
yes
If you don’t require the boundary to go into the lower skeleton then you can repeat the S^1 example where the two ends go into the interior of D^1
hmm okay ^^. What if we require the ends to go into the lower skeleton? Do you expect the statement to be true?
Have you tried proving it by induction?
Have you tried proving it for simplicial sets?
Chain complexes?
is there a way to uniquely define each knot up to ambient isotopy
eg assign each knot to something such that any two knots assigned to the same thing are the same knot up to isotopy
Yes, I believe it follows formally from the decidability of the knot equivalence problem that there is a complete invariant. A standard open problem is whether the collection of all finite type variants distinguishes knots. Better, a well-defined truncation so that it can be finitely specified
so, there exist a complete invariant? but we do not knot of it yet?
sorry i didnt really understand your response
From an algorithm, you can extract an invariant. But it is ugly, just a statement of what the algorithm does to that particular knot
oh so there exist a way but no way to nicely and simply classify knots?
that we know of
Write some description of knots. Say, knot diagrams. Order by simplicity and within that find some order, some kind of lex order on descriptions. Then a complete invariant of a knot is the first description of that knot in the list. No guarantee of computation, but it’s a complete invariant. If you can compute knot equivalence, you can compute this invariant
lex order?
Lexicographic
does this include knots that are made of multiply components? or is there a nice way to classify knots of only 1 component?
Im stuck, not really sure what to do with an infinite intersection..?
Your notation is a bit inconvenient, so please allow me to change it a bit.
Let $X = \prod \nolimits_{i \in \Lambda} X_i$, let $\pi_i : X \to X_i$ be the $i$-th canonical projection, and let $f : Y \to X$ be an arbitrary function. By definition, $X$ has the smallest topology such that every $\pi_i$ is continuous. Thus, in particular, if $f$ is continuous, so is every $f_i = \pi_i \circ f : Y \to X_i$.
Now, conversely, suppose every $f_i$ is continuous. To show that $f$ is continuous, it suffices to check that, when $U$ is a \underline{basic} open subset of $X$, its preimage $V = f^{-1}(U)$ is open in $Y$. Write $U = \prod \nolimits_{i \in \Lambda} U_i$, where finitely many of the $U_i$'s are proper open subsets of the respective $X_i$'s, and the rest are equal to the respective $X_i$'s. Then $V = \bigcap_{i \in \Lambda} V_i$, where $V_i = f^{-1}(U_i)$. Notice that finitely many of the $V_i$'s are proper open subsets of $Y$, and the rest are equal to $Y$. Therefore, $V$ is open in $Y$.
Eduardo León
ERRR... I'll rewrite the second paragraph.
Now, conversely, suppose every $f_i$ is continuous. To show that $f$ is continuous, it suffices to check that, when $U$ is a \underline{basic} open subset of $X$, its preimage $f^{-1}(U)$ is open in $Y$. Write $U = \prod \nolimits_{i \in \Gamma} U_i \times \prod \nolimits_{i \in \Lambda \setminus \Gamma} X_i$, where $\Gamma$ is a finite subset of $\Lambda$, and each $U_i$ is an open subset of $X_i$. Then $f^{-1}(U) = \bigcap \nolimits_{i \in \Gamma} f^{-1}(U_i)$ is a finite intersection of open subsets of $V$, and therefore is itself open in $V$.
Eduardo León
Argh, typo. Should've been $f^{-1}(U) = \bigcap_{i \in \Gamma} f_i^{-1}(U_i)$.
Eduardo León
Why are you adding a subscript for the inverse function
All norm induced topologys on vector spaces are a Topological Vector space right? So is the tensor product of multiple Hilbert spaces a Topological Vector space under the norm induced topology? And does this apply when some of those hilbert spaces are not finite dimensional
Strictly speaking, what you said isn't correct. The topology of a topological vector space isn't the same thing as the topological vector space itself.
But it's true that a norm on a vector space induces a topology. So every normed vector space is a topological vector space.
The tensor product of Hilbert spaces is again a Hilbert space, and in particular a normed vector space, so the previous remark applies.
could someone explain to me about how the slice knot of unknot bounds a disk in S3
wait im confused? wdym
and this applies even if they are infinite dimensional correct?
Sure. But be mindful that, in the infinite-dimensional case, you can't just take the tensor product of the underlying abstract vector spaces.
I'm going to get inside an algebraic topology course, any advice?
try the door, or maybe just homotope a window to be way too big for them to stop you
Im confused about this description for a set X with topology tau. The author is describing X as the union of sets belonging to tau. But we could have X={a,b,c} with topology {a},{b},{a,b} the union of which would give us {a,b}. Of course X itself is a part of the topology but then we're describing X by itself
I think they're defining X to be the union
it is kind of weird i agree
I'll just stick to Munkres 
Have fun, of course. What point is there to studying math if you aren't having fun?
The price you are gonna pay in Spain if you repeat that course
The hemisphere of a sphere and a cylinder are homemorphic right?
making the cylinder compact
What do you mean by cylinder
Oh
sorry
Like an infinite cone or what?
make it compact..
Or like S^1 x I / S^1 x {1} ig
like an ice cream cone
Sure yes
Then yes, that is homeomorphic to a hemisphere
Both are homeomorphic to a closed disc
(By projection)
Np
does a space X which has a countable basis mean that it is first or second countable?
i see
i was confused cuz munkres defines countable basis at a point as first countable
why isnt a compact space always second countable?
isnt compactness stronger than second countability?
So 2^kappa is compact for any kappa, but it's second countable iff kappa is countable or finite
If compact doesn’t imply finite, why should it imply second countable?
what is 2^kappa?
oh wait compact means every open covering has a finite subcovering but second countable has to do with a countable basis...
i kinda confused an open covering to be a basis mb
wait if u take an open covering of all possible 1 element open sets, then isn't it not compact?
There are no one element open sets in that space
oh but in the product topology only finitely many terms can be != 2
No this is the full product
but i thought it was the discrete topology?
The factors are discrete but the product space isn't
yeah so if 2 = {1, 2} then the open sets of 2 are 0, {1}, {2}, {1, 2} right
so open sets of 2^kappa can look like {1} x {1} x {2} x {1} x ....
No so in the product a basic open set has to have all but finitely many factors be {1,2}
What you're describing is called the 'box topology'
oh yeah
It's finer than the product topology
thats what i meant
what do u mean by the "full product"? Is that different than the product topology?
I mean that we don't have this restriction
doesnt that mean the same thing?
this just means there are finitely many parts in the product that are \emptyset, {1}, or {2}
Yes
Although note not all open sets are of this form. This is just the basic opens
ty
if you attach a disk to the torus so that it fills in the hole in the middle, the fundamental group of that space should be Z^2/(Z,0) = Z, correct?
Yea
sweet
https://math.stackexchange.com/questions/3619691/show-that-a-regular-lindelöf-space-is-metrizable-if-it-is-locally-metrizable in this question, why does \overline{V} have a countable basis? that doesnt follow directly from \overline{V} being Lindelof I believe...
and if i attach a line across the gap , then it should be (Z^2 * Z * Z) / Z = Z * Z * Z?
What's a line across the gap
like a pretzel bridge across the donut hole
a cross section would look like a theta
Any line attachment should be Z² ⊔ Z
that has a group structure?
Coproduct
Coproduct mentioned👀
okay, my * was free product
||Cuz it's homotopy equivalent to wedge sum with S¹||
i canceled the wrong factor of Z here
wedge of a torus with S^1?