Re: Strong NDR Pairs — A Technical Question
If and are strong NDR pairs, is a
strong NDR pair?
I may be starting to see how to do it. I feel sure that the standard proof that the composite of NDR pairs is an NDR pair, applied to a composite of strong NDR pairs, will give a strong NDR pair. So, I just need to reinvent that standard proof — or look it up, if I have time for a trip to the library.
This is the very beginning:
Suppose is a strong NDR pair with function vanishing on and a homotopy squashing the neighborhood down to .
And suppose is a strong NDR pair with function vanishing on and a homotopy squashing the neighborhood down to .
We want to show is a strong NDR pair with function vanishing on and a homotopy squashing the neighborhood down to .
How do we get the function , for starters?
First, let’s ‘turn around’ the function , working instead with . This new function equals on the subset instead of , and the neighborhood is where this new function is instead of .
Let’s do the same for , working instead with .
I want to define by
There’s a problem here, which is that isn’t defined on all of , just on . That won’t be a problem if as we approach the boundary of . Then we can extend to a continuous function that equals outside . Let’s assume we can do this, just for now.
Let’s call this extension .
Then is precisely on and is precisely on so
is precisely on , as desired. This is part 1 of the definition of ‘strong NDR pair’.
Let’s jump ahead to condition 5, the one special to ‘strong’ NDR pairs.
I still don’t see how to cook up the homotopy from the homotopies and . The problem, again, is that is only defined on , not all of . But, presumably we do something like use for a while and then use for a while.
Condition 5 says that at every time , the homotopy maps into itself. Similarly, at every time maps into itself. Why does map into itself at every time?
Well, what’s ? It’s where . But outside , so to find , we need only look inside . Inside , . So, we need only look where inside . And that’s the neighborhood .
So, .
So, why does map into itself at every time? This is hard to say, since I don’t know what is. But is built using and , and maps into itself at every time, which is promising. I’d feel confident of success if fixed all points of at every time, since then it too would map into itself at every time.
But now, to my horror, I see that condition 3 merely says that for all . So, maps into itself at every time. This is much weaker than fixing all points of at every time.
I don’t like this. I see the problem is that is just a deformation retract, not a strong deformation retract.
So, I have to ask: can every deformation retract be improved to be a strong deformation retract?
Re: Strong NDR Pairs — A Technical Question
Okay — I know I’m talking to myself, but I’ll keep on, just to prove to all of you that I actually spend a lot of time doing very boring stuff, and normally blog about it only when something interesting occurs. Danny need to settle this question to get a classifying space for a topological 2-group! That sounds interesting. But, it involves some tiresome work.
We were trying to see how two NDR pairs and give an NDR pair , so we could see why two strong NDR pairs give a strong NDR pair.
So, suppose is a strong NDR pair with function vanishing on and a homotopy squashing the neighborhood down to .
And suppose is a strong NDR pair with function vanishing on and a homotopy squashing the neighborhood down to .
Then we want to show is a strong NDR pair with function vanishing on and a homotopy squashing the neighborhood down to .
And, Danny has by now told me what seems like a more promising way to get the function . He wrote:
I also had a candidate function :
if and if
I think this is continuous, and I think also that , and
.
Let’s see if I understand this. I just need to think out loud.
Proof that is well-defined
If , is outside of the open set which our homotopy
squashes down to . Otherwise is inside , so and is well-defined. So, the formula for makes sense.
Proof that
For to be zero we need , but we also need both
and . For we need ,
but for we need . However, for
we have . So, we need .
Conversely if is in we have (since is in ) and
(since is in ), so is zero.
Proof that w is continuous
Each clause in the definition “ if and if ”
is a continuous function, but the first clause applies only
when is outside , while the second applies when is in .
is open, so for continuity we need only consider a net of points
converging to a point not in , and check that
converges to . We have since is not in .
So, we need to check . Since is defined as a max
of numbers less than or equal to 1, it’s enough to check that one
of these numbers approaches 1. So, check . This
is true just because is continuous and .
Okay, so yes — it’s all true, and it works better than my guess did.
Re: Strong NDR Pairs — A Technical Question
I doubt there are many NOW, but when I was much younger, there were quite a few. Suggest you post this to Don Davis’ ALG-TOP
blog where such memories may persist.