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

Theorem Suggestion: Connected+ strongly paracompact => countable extent #1189

Open
pzjp opened this issue Jan 9, 2025 · 9 comments
Open
Labels

Comments

@pzjp
Copy link
Collaborator

pzjp commented Jan 9, 2025

Theorem Suggestion

If a space is:

  • connected P36
  • strongly paracompact P145

then it has countable extent P198.

Rationale

This theorem would demonstrate that no spaces satisfy the following search:
https://topology.pi-base.org/spaces?q=connected%2BStrongly+paracompact%2B%7EHas+countable+extent
Would also (eventually) resolve P145 for S129 and S134.

Proof

Let $C$ be a closed discrete subspace of a connected and strongly paracompact space $X$. Take an open cover $\mathscr U=\{X\setminus A\}\cup\{U_a:a\in C\}$ where $U_a$'s are disjoint open neighborhoods of the elements of $C$. Let $\mathscr A$ be a star-finite refinement of $\mathscr U$ and for every $a\in C$ fix $E_a\in \mathscr A$ such that $a\in E_a$. Clealry, $E_a\neq E_b$ for distinct $a,b\in C$.
Consider a graph $G=\{ \mathscr A, E\}$ where $(U,V)\in E$ whenever $U\neq V$ and $U\cap V\neq \emptyset$. By the connectedness of $X$ and the fact that $\mathscr A$ is an open cover, $G$ is a connected graph and by star-finiteness every vertex is of finite degree.
A connected graph with all vertices of finite degree has to be countable (there are finitely many vertices at a distance at most $n$ from the given one and the graph is a countable union over all distances). Hence $C$ is countable as well.

Should I make a self-answered entry on MathSE for this?

@pzjp pzjp added the theorem label Jan 9, 2025
@yhx-12243
Copy link
Collaborator

Nice! Resolves the counterexample of converse of P145 (Strongly paracompact) P30 (Paracompact).

@pzjp
Copy link
Collaborator Author

pzjp commented Jan 9, 2025

I'm currently working on S129 and that's how I landed here.

@yhx-12243
Copy link
Collaborator

#990 has some partial results on S129 that you can refer to.

@yhx-12243
Copy link
Collaborator

yhx-12243 commented Jan 9, 2025

The results can be strengthen to P18 (Lindelöf), https://mathoverflow.net/questions/433812/a-stronger-version-of-paracompactness is also a good reference. @pzjp

@pzjp
Copy link
Collaborator Author

pzjp commented Jan 9, 2025

True. It appears that every star-finite open cover of a connected space has to be (at most) countable.
Maybe I should post my proof at mathoverflow?

@yhx-12243
Copy link
Collaborator

yhx-12243 commented Jan 9, 2025

Yes you can post it right after that existing post (if you think the current answer is not complete)

@prabau
Copy link
Collaborator

prabau commented Jan 10, 2025

It would be good to have the "metric hedgehog" (as mentioned by Tyrone in comment to the mo post) as a space in pi-base. That's essentially the quotient of S129 (Wheel without its hub) obtained by collapsing the outer circle to a point.
That would be another example of paracompact and not strongly paracompact space, for basically the same reason.

We should have both:

  • Metric hedgehog with countably many spines
  • Metric hedgehog with uncountably many spines

I am guessing the first one would be strongly paracompact.

Now I am looking at S134 (Radial metric on the plane). Isn't that the same as the (second) metric hedgehog?

@yhx-12243
Copy link
Collaborator

The second is exactly S134. The first is embeddable in Euclidean plane $\mathbb R^2$ by $(r, \theta)$ with $0 \leq r \leq 1$ and $\theta = \dfrac 1n$.

@prabau
Copy link
Collaborator

prabau commented Jan 10, 2025

If anyone of us plans to add one or more hedgehog spaces, I think it would be good to first create an issue to discuss the best presentation to choose for pi-base, which versions to add, names and so on.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

No branches or pull requests

3 participants