How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Discrete Rudin families have discrete ambient closures
Statement
Assume AC. If is an indexed discrete family of closed subsets of , then is indexed discrete in . Here indexed discreteness means that every point has an open neighborhood meeting for at most one index ; the same convention applies to the ambient closures. In particular, the conclusion is stronger than pairwise disjointness of the closures. Empty members and an empty index set are allowed.
Facts & Assumptions
Given: The stated indexed discrete family. Write and .
For , , , and any finite list of set parameters, there are an elementary containing them and , and , with . Every admits with . If , and all its coordinate cofinalities are at most , then (Elementary hull transfer for bounded cofinality strata).
The boxes and give local bases at their respective points, arbitrary relative half-open boxes are open, and is a P-space: countable intersections of open sets are open (Clopen boxes and the P-space property).
Each is transitive (Transitivity and growth of hierarchy stages).
AC is available for the hull construction and for countable choices of neighborhoods (The Axiom of Choice).
Proof
For set and . These strata increase with , and their union is , since the defining uniform finite-aleph bound for any point of is also a non-strict bound at some finite positive aleph. Thus . Fix and . Apply F1 with , the indexed family , , , and as the finite list of parameters. All these sets, including the function coding , belong to the resulting and to the sufficiently large . Discreteness of at gives an open neighborhood meeting at most one ; F2 supplies with inside it. F1 then gives with .
The neighborhood meets at most one . Otherwise there are distinct and , with and . Express this as an existential formula with parameters , using function evaluation and bounded coordinate comparisons. This formula is true in : all its witnesses are members of the named sets, and hence in by F3. Its matrix is absolute, since equality and membership are actual equality and membership and each quantifier bounded by one of these sets ranges over all its actual members. Function evaluation can be expressed by membership of ordered pairs, whose components and finite set codes are in this sufficiently large transitive rank level. Elementarity from F1 supplies such witnesses in , with the same actual properties. In particular , , and membership in the named external stratum gives the actual cofinality bounds. No internal computation of cofinality is used. F1 implies . As , both belong to , contradicting its choice in step 1.1. Hence has the asserted property. It is open by F2 and contains , because .
Put . An open set that meets also meets : at a point of intersection it is a neighborhood, and the definition of closure forces a point of in it. Thus the from step 2.1 meets at most one . Since was arbitrary, is indexed discrete for each fixed . In particular, two distinct such closures cannot contain the same point: every neighborhood of that point would meet both, contradicting the neighborhood just constructed.
In any P-space, for a countable sequence of subsets , one has . The inclusion from right to left follows because a neighborhood meeting meets the union. Conversely, if a point avoids every , the intersection of the open sets is an open neighborhood of that point by F2 and misses the union. It therefore avoids its closure. Apply this identity and step 1.1 to get . If , there are with . Monotonicity of strata puts in both closures at level . Step 3.1 forces . Thus distinct full closures are disjoint.
Fix . For each , choose by A1 an open neighborhood of meeting at most one , using step 3.1. Then is an open neighborhood by F2. Let . Each has at most one member. The set equals by step 4.1. It is countable: assigning each the least with is an injection into the positive integers. By step 4.1 at most one contains . Remove all the other possible closures by putting
This is a countable intersection of open sets, so F2 makes it open; every intersected set contains , so it is a neighborhood of . If meets , then and the complement of was not used; hence . There is at most one such index. Empty gives , and an empty removal family uses the whole space as its intersection. This proves indexed discreteness of the ambient closures, including the empty family and empty members. QED. [step 3.1, step 4.1, F2, A1]
Depends on
Used by
Dependency tree · two levels
17 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.