Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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 (Fj)jJ is an indexed discrete family of closed subsets of XR(B), then (FjYB)jJ is indexed discrete in YB. Here indexed discreteness means that every point has an open neighborhood meeting Fj for at most one index j; 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 X=XR(B) and Y=YB.

[F1]

For xY, κ=m, m1, and any finite list of set parameters, there are an elementary MVθ containing them and x, and x^X, with x^x. Every v<x^ admits zMPB with v<z<x^. If uMPB, ux and all its coordinate cofinalities are at most κ, then ux^ (Elementary hull transfer for bounded cofinality strata).

[F2]

The boxes (a,h]X and (a,h]Y give local bases at their respective points, arbitrary relative half-open boxes are open, and Y is a P-space: countable intersections of open sets are open (Clopen boxes and the P-space property).

[F3]

Each Vθ is transitive (Transitivity and growth of hierarchy stages).

[A1]

AC is available for the hull construction and for countable choices of neighborhoods (The Axiom of Choice).

Proof

1.1

For m1 set Xm={uX:(nB)cf(u(n))m} and Fj,m=FjXm. These strata increase with m, and their union is X, since the defining uniform finite-aleph bound for any point of X is also a non-strict bound at some finite positive aleph. Thus Fj=m1Fj,m. Fix m and xY. Apply F1 with J, the indexed family F, Xm, X, B and PB as the finite list of parameters. All these sets, including the function coding F, belong to the resulting M and to the sufficiently large Vθ. Discreteness of F at x^ gives an open neighborhood meeting at most one Fj; F2 supplies v<x^ with (v,x^]X inside it. F1 then gives zMPB with v<z<x^x.

F1F2A1
2.1

The neighborhood W=(z,x]Y meets at most one Fj,m. Otherwise there are distinct j,lJ and uFjXm, wFlXm with z<ux and z<wx. Express this as an existential formula with parameters J,F,Xm,B,z,x, using function evaluation and bounded coordinate comparisons. This formula is true in Vθ: all its witnesses are members of the named sets, and hence in Vθ 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 j,l,u,w in M, with the same actual properties. In particular u,wMPB, u,wx, and membership in the named external stratum Xm gives the actual cofinality bounds. No internal computation of cofinality is used. F1 implies u,wx^. As v<z<u,w, both belong to (v,x^]X, contradicting its choice in step 1.1. Hence W has the asserted property. It is open by F2 and contains x, because z<x^x.

step 1.1F1F2F3
3.1

Put Cj,m=Fj,mY. An open set that meets Cj,m also meets Fj,m: at a point of intersection it is a neighborhood, and the definition of closure forces a point of Fj,m in it. Thus the W from step 2.1 meets at most one Cj,m. Since x was arbitrary, (Cj,m)jJ is indexed discrete for each fixed m. In particular, two distinct such closures cannot contain the same point: every neighborhood of that point would meet both, contradicting the neighborhood just constructed.

step 2.1
4.1

In any P-space, for a countable sequence of subsets Am, one has mAm=mAm. The inclusion from right to left follows because a neighborhood meeting Am meets the union. Conversely, if a point avoids every Am, the intersection of the open sets YAm 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 Cj:=FjY=m1Cj,m. If xCjCl, there are m,n with xCj,mCl,n. Monotonicity of strata puts x in both closures at level max(m,n). Step 3.1 forces j=l. Thus distinct full closures are disjoint.

step 1.1step 3.1F2
5.1

Fix xY. For each m1, choose by A1 an open neighborhood Wm of x meeting at most one Cj,m, using step 3.1. Then W=m1Wm is an open neighborhood by F2. Let Km={jJ:WCj,m}. Each Km has at most one member. The set K={j:WCj} equals mKm by step 4.1. It is countable: assigning each jK the least m with jKm is an injection into the positive integers. By step 4.1 at most one Cj contains x. Remove all the other possible closures by putting

W=WjKxCj(YCj).

This is a countable intersection of open sets, so F2 makes it open; every intersected set contains x, so it is a neighborhood of x. If W meets Cj, then jK and the complement of Cj was not used; hence xCj. There is at most one such index. Empty K gives W=W, 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.

Sources