
It's great to have such great research colleagues.
Abstract. The
We will discuss the current plan to incorporate results from set theory into the
"But mostly number theory and the LMFDB"So how can we expand the
0, 1, 2, ... for aleph 0, aleph 1, ... for beth 1, beth 2, ... for aleph n < beth m (aleph omega0+2 for 7 < omega0+2. (Is this necessary for MVP?)char_b, char_t, char_d, ... for We'll need to distinguish (existing) properties with boolean values:
uid: P000089
name: Fixed point property
# values: boolean # new key to keep existing functionality
... and hydrate others:
uid: P000026
name: Separable
# values: boolean
uid: P000209
name: Density $\leq\mathfrak c$
# values: boolean
as new properties with cardinal values:
uid: P000xyz
name: Density
values: cardinal
Now we can replace such assertions:
space: S000222 # Product topology on $\omega^{2^\mathfrak{c}}$
property: P000026 # Separable
value: false # actually this is deduced automatically today
space: S000222 # Product topology on $\omega^{2^\mathfrak{c}}$
property: P000209 # Density $\leq\mathfrak c$
value: true
with more expressive ones:
space: S000222 # Product topology on $\omega^{2^\mathfrak{c}}$
property: P000xyz # Density
value: beth 1
Consider the following theorem.
uid: T000440
if:
P000180: true # Hereditarily separable
then:
P000026: true # Separable
The trivial generalization is "if every subspace has a dense subset of cardinality
Supporting a seems most reasonable to me today:
uid: T000xxx
if:
P000yyy: kappa # Hereditary density
then:
P000xyz: kappa # Density
Supporting notation like kappa+ (
We also have this:
uid: T000404
if:
and:
- P000079: true # Sequential
- P000099: true # US
- P000209: true # Density $\leq\mathfrak c$
then:
P000163: true # Cardinality $\leq\mathfrak c$
Here I think we need to support leq:
uid: T000404
if:
and:
- P000079: true # Sequential
- P000099: true # US
- P000xyz: leq beth 1 # Density
then:
P000zyx: leq beth 1 # Cardinality
Of course,
So this means we just need a to program a few small things:
Cardinality class that understands Cardinality.leq:boolean so new Cardinality("aleph 3") <= new Cardinality("beth 4") returns true and new Cardinality("char_b") < new Cardinality("aleph 1") returns... false? "undecidable"?leq beth 3 and abstracts it to a Cardinality that represents kappa placeholder in our theorems.With this infrastructure, we could not only have more expressive options to describe results in general and set-theoretic topology, but perhaps even support results beyond those which can be proven in ZFC?
As an easy example: Cardinality $\leq \aleph_1$ + Separable. But it could if we had an [x] Assume CH option that tells Cardinality to assume that new Cardinality("aleph 1") == new Cardinality("beth 1").