Locally closed orbits and measurable representatives

An orbit space may distinguish every orbit topologically and still fail to be Hausdorff. The useful question for measure theory is whether its Borel sets have a countable description and whether one can choose an orbit representative measurably. This lesson proves the Glimm criterion, including its ergodic-measure converse and its representative construction, for a continuous action of a Polish group.

Read Polish orbits and their quotient topology first. We use its complete Effros equivalence and countable invariant-open orbit code. The exact written programme prerequisites are Polish and standard Borel spaces, Theorems 1.1, 2.4 and 4.3, Theorem 5.6 (Blackwell), and Proposition 7.4, in Operator algebra foundations. They supply a continuous Baire-space parametrization, analytic separation and injective Borel images, the countably generated atom theorem, and standard Borel coset spaces. Their proofs are present in that programme lesson. The category, Cantor construction, probability argument and measurable selector needed below are proved here.

Throughout, GG is Polish, XX is a nonempty Polish space, and G×X→XG\times X\to X is continuous. Write π:X→Y=X/G\pi:X\to Y=X/G, and equip YY with both its quotient topology τq\tau_q and its quotient Borel structure

Bq={A⊂Y:π−1(A)∈B(X)}.(1.1) \mathcal B_q=\{A\subset Y:\pi^{-1}(A)\in\mathcal B(X)\}. \tag{1.1}

An orbit is locally closed if it is open in its closure in XX. This is equivalent to being the intersection of an open and a closed subset of XX. Ergodic means that every invariant Borel set has either zero measure or conull complement. We do not require quasi-invariance.

1. The criterion and the closure conditions

Condition C. Every identity neighborhood NN contains an identity neighborhood MM such that, simultaneously for all x∈Xx\in X,

Mx‾ X⊂Nx.(1.2) \overline{Mx}^{\,X}\subset Nx. \tag{1.2}

Condition D. Every identity neighborhood NN contains an identity neighborhood MM such that, for every xx and every open neighborhood base (Qn)(Q_n) at xx,

⋂nMQn‾ X⊂Nx.(1.3) \bigcap_n\overline{M Q_n}^{\,X}\subset Nx. \tag{1.3}

The bars are ambient closures, and the neighborhoods in the base need not be nested. D implies C: Mx⊂MQnMx\subset M Q_n for each nn, so its closure is contained in the intersection in (1.3). Locally compact Polish groups satisfy both conditions for every continuous action, by the compact-neighborhood proof in the preceding lesson, Proposition 6.1.

Theorem 1.1 (Glimm criterion). Assume C. The following six conditions are equivalent:

  1. Every orbit is locally closed.
  2. Bq=σ(τq)\mathcal B_q=\sigma(\tau_q).
  3. (Y,Bq)(Y,\mathcal B_q) is countably separated.
  4. Every nonzero ergodic sigma-finite Borel measure on XX is concentrated on one orbit.
  5. (Y,Bq)(Y,\mathcal B_q) is standard Borel.
  6. There is a Borel subset of XX meeting every orbit exactly once.

Thus, in particular, all six are equivalent under D, as in the source exercise. The proof of the representative implication actually requires only a T0T_0 quotient. Under C the first four conditions imply that property. Burgess's general selection theorem is broader: it handles countably separated orbit relations on invariant Borel subsets without C or a T0T_0 quotient.

The elementary forward implications come in Section 2. Sections 3–5 construct the measure needed for the converse. Section 6 constructs the representative and closes the proof.

2. Category and countable orbit descriptions

Lemma 2.1. Under C, an orbit that is nonmeagre in a closed invariant subspace F⊂XF\subset X is open in FF.

Proof. Choose a neighborhood NN and then MM as in C, shrinking MM to an open identity neighborhood if necessary. Separability of GG gives G=⋃jgjMG=\bigcup_j g_jM: a countable dense set meets every open set gM−1gM^{-1}. Hence Gx=⋃jgjMxGx=\bigcup_j g_jMx. If this orbit is nonmeagre in FF, one of these pieces, and therefore MxMx, is nonmeagre in FF. Its closure in FF has nonempty interior, since a closed set with empty interior is nowhere dense. That closure is contained in Mx‾ X⊂Nx⊂Gx\overline{Mx}^{\,X}\subset Nx\subset Gx. Thus the orbit contains a nonempty relatively open subset of FF. Translates of this subset give an open neighborhood of each orbit point, because FF is invariant. Their union is the orbit. □\square

Lemma 2.2. Suppose a continuous action on a nonempty Polish space FF has a dense orbit. Every invariant Borel subset of FF is meagre or comeagre.

Proof. The sets with the Baire property form a sigma-algebra: complements are handled by replacing the complement of an open set by its interior, whose omitted boundary is nowhere dense; countable unions differ from the corresponding union of open sets by a meagre set. Thus every Borel set has that property. If an invariant Borel set AA is nonmeagre, some nonempty open W⊂FW\subset F has W∖AW\setminus A meagre.

The dense orbit implies topological transitivity: for nonempty open U,VU,V, choose gx∈Ugx\in U and hx∈Vhx\in V; then hg−1Uhg^{-1}U meets VV. Consequently GWGW is dense and open. It has a countable subcover by translates of WW, since FF is second countable. Invariance makes AA comeagre in every translate and hence in GWGW. The complement of GWGW is nowhere dense. Therefore AA is comeagre in FF. □\square

Proposition 2.3. Under C, condition 3 implies condition 1.

Proof. Fix xx, and put F=Gx‾F=\overline{Gx}. This is a nonempty closed invariant Polish space with a dense orbit. Pull a countable separating family in YY back to invariant Borel sets An⊂XA_n\subset X. By Lemma 2.2, one of An∩FA_n\cap F and F∖AnF\setminus A_n is comeagre in FF. Intersect these comeagre choices over all nn. The resulting set HH is comeagre and nonempty, by the Baire theorem.

All points of HH have the same orbit code, so they lie in a single orbit OO. This orbit is nonmeagre in FF, hence open there by Lemma 2.1. The dense orbit GxGx meets OO, so it equals OO. Thus GxGx is open in FF. □\square

We next verify the other simple implications.

1⇒21\Rightarrow2. A locally closed subset of a metric space is GδG_\delta: closed sets are GδG_\delta, and an open set is already a countable intersection of open sets. The complete Effros theorem in the preceding lesson therefore makes YY a T0T_0 space. Let (Un)(U_n) be a countable base of XX, and set Zn=GUnZ_n=GU_n. These are invariant open sets. The code

c(x)=(1Zn(x))n≥1(2.1) c(x)=(1_{Z_n}(x))_{n\geq1} \tag{2.1}

has precisely the orbits as its fibers. Indeed, the sets π(Un)\pi(U_n) form a quotient base and separate points of a T0T_0 quotient. An invariant Borel subset of XX is a union of these code fibers. The exact written Blackwell theorem, Theorem 5.6 of the prerequisite lesson, therefore puts it in σ(Zn)\sigma(Z_n). Pullback by the surjective π\pi is injective on subsets of YY, so this says precisely Bq=σ(τq)\mathcal B_q=\sigma(\tau_q). The reverse inclusion always holds, since π\pi is continuous.

2⇒32\Rightarrow3. Every individual orbit is Borel, even before C is used. Its stabilizer GxG_x is closed. The written coset-space Proposition 7.4 makes G/GxG/G_x standard Borel, and the canonical map G/Gx→XG/G_x\to X is an injective Borel map. The written injective-image theorem, Theorem 4.3, makes its image GxGx Borel. Consequently every singleton of YY belongs to Bq\mathcal B_q. A countable quotient base generates σ(τq)\sigma(\tau_q). If two quotient points had identical memberships in this base, they would have identical memberships in every set of the generated sigma-algebra: the sets containing both or neither form a sigma-algebra. This would contradict their Borel singletons. The base therefore separates points.

3⇒43\Rightarrow4. Pull back a countable separating family to invariant Borel sets AnA_n. Ergodicity chooses a conull side of each AnA_n. Their intersection is conull and nonempty for a nonzero measure, and all its points have the same code. It lies in one orbit. This argument works for every nonzero ergodic measure; sigma-finiteness is unnecessary in this direction.

3. Analytic sets and a category argument in a product

For the converse we need to know that the orbit relation has the Baire property. We supply that bridge rather than assuming analytic sets are Borel.

Lemma 3.1 (Souslin's Baire-property theorem). Every analytic subset of a Polish space has the Baire property.

Proof. First construct a Baire-property envelope of an arbitrary E⊂XE\subset X. Let UU be the union of all basic open sets whose intersection with EE is meagre. Countability of the base makes E∩UE\cap U meagre. Then

H(E)=(X∖U)∪(E∩U)(3.1) H(E)=(X\setminus U)\cup(E\cap U) \tag{3.1}

contains EE and has the Baire property. It is minimal modulo meagre sets among such supersets. To see this, let B⊃EB\supset E have the Baire property. The difference H(E)∖BH(E)\setminus B lies in X∖UX\setminus U. If it were nonmeagre, it would be comeagre in some nonempty open WW. Since it is disjoint from EE, the set E∩WE\cap W would be meagre. Every basic open subset of WW would then occur in the definition of UU, giving W⊂UW\subset U, a contradiction.

Let AA be nonempty analytic. By the written continuous-parametrization theorem, there is a continuous surjection f:NN→Af:\mathbb N^{\mathbb N}\to A. For a finite sequence ss, let [s][s] denote its cylinder and put Fs=f([s])‾F_s=\overline{f([s])}, with F∅=XF_\varnothing=X. These closed sets decrease along extensions, and

A=⋃a∈NN ⋂n≥1Fa∣n.(3.2) A=\bigcup_{a\in\mathbb N^{\mathbb N}}\ \bigcap_{n\geq1}F_{a|n}. \tag{3.2}

For the nontrivial inclusion, continuity at aa implies that f([a∣n])f([a|n]) eventually lies in every prescribed ball about f(a)f(a), so the intersection of its closures is exactly {f(a)}\{f(a)\}.

For each ss, let EsE_s be the union of the branch intersections in (3.2) over branches extending ss. Then E∅=AE_\varnothing=A, Es=⋃jEsjE_s=\bigcup_j E_{sj}, and Es⊂FsE_s\subset F_s. Take the envelopes H(Es)H(E_s) and intersect each with FsF_s and all its ancestral envelopes. Call the resulting Baire-property superset HsH_s. It still has the same minimality property, and is contained in FsF_s. The union ⋃jHsj\bigcup_jH_{sj} contains EsE_s, so Hs∖⋃jHsjH_s\setminus\bigcup_jH_{sj} is meagre. The union LL of these exceptional sets over the countable tree is meagre. If z∈H∅∖Lz\in H_\varnothing\setminus L, repeatedly choose a child HsjH_{sj} containing zz. This produces a branch with z∈Fa∣nz\in F_{a|n} for every nn, hence z∈Az\in A. Thus A⊂H∅A\subset H_\varnothing and H∅∖A⊂LH_\varnothing\setminus A\subset L. The empty analytic set is immediate. □\square

Lemma 3.2 (category in a product). Let FF be Polish. If R⊂F×FR\subset F\times F has the Baire property and every section Rx={y:(x,y)∈R}R_x=\{y:(x,y)\in R\} is meagre, then RR is meagre.

Proof. For a closed nowhere dense K⊂F×FK\subset F\times F and a nonempty basic open V⊂FV\subset F, the set

DV={x:{x}×V⊂K}(3.3) D_V=\{x:\{x\}\times V\subset K\} \tag{3.3}

is closed, as an intersection of closed sections. It has empty interior: otherwise an open rectangle would lie in KK. Outside the meagre union of these DVD_V, the closed section KxK_x has empty interior and is nowhere dense. Apply this argument to countably many closed nowhere dense sets covering any given meagre subset L⊂F×FL\subset F\times F. For comeagre many xx, its section LxL_x is meagre.

Now write R△W⊂LR\mathbin\triangle W\subset L, where WW is open and LL meagre. If WW is nonempty, it contains a nonempty rectangle U×VU\times V. Choose x∈Ux\in U with LxL_x meagre. Then RxR_x contains V∖LxV\setminus L_x, which is nonmeagre by the Baire theorem. This is impossible. Thus WW is empty and R⊂LR\subset L. □\square

Proposition 3.3. Under C, if GxGx is not locally closed and F=Gx‾F=\overline{Gx}, every orbit in FF is meagre in FF, and the orbit relation restricted to F×FF\times F is meagre.

Proof. A nonmeagre orbit in FF would be open by Lemma 2.1; it would meet the dense orbit GxGx, making that orbit open in FF, contrary to the hypothesis. The relation

EG∣F={(z,gz):z∈F, g∈G}(3.4) E_G|_F=\{(z,gz):z\in F,\ g\in G\} \tag{3.4}

is the continuous image of the Polish space F×GF\times G, so Lemma 3.1 gives its Baire property. Its sections are the meagre orbits. Lemma 3.2 now applies. Also FF has no isolated point, since an orbit containing an isolated point would be nonmeagre in FF. □\square

4. A Cantor space inside the orbit relation

Write aE0baE_0b for eventual equality of binary sequences: they differ at only finitely many coordinates.

Theorem 4.1. Suppose a continuous Polish action on a nonempty Polish space FF has a dense orbit and its orbit relation EE is meagre in F×FF\times F. There is a continuous injection f:2N→Ff:2^{\mathbb N}\to F such that

aE0b⟺f(a)Ef(b).(4.1) aE_0b\quad\Longleftrightarrow\quad f(a)E f(b). \tag{4.1}

Proof. Choose a complete compatible metric dd on FF. Cover EE by closed nowhere dense sets R1,R2,…R_1,R_2,\ldots, replacing each by its union with its transpose if desired. Let OO be the dense orbit. We construct nonempty open sets Vn⊂FV_n\subset F and elements hs∈Gh_s\in G, indexed by binary words ss of length nn. Start with V0=FV_0=F and h∅=1h_\varnothing=1. At each positive level require:

Here is the full induction. Suppose level n−1n-1 is fixed. For all words s,ts,t at that level and all j≤nj\leq n, the conditions

(hsu,htv)∉Rj,(hsv,htu)∉Rj(4.2) (h_su,h_tv)\notin R_j,\qquad(h_sv,h_tu)\notin R_j \tag{4.2}

define an open dense subset of Vn−1×Vn−1V_{n-1}\times V_{n-1}, because product translations are homeomorphisms and RjR_j is nowhere dense. Intersect these finitely many conditions and also require u≠vu\ne v. The latter is open dense: FF has no isolated point, since an isolated point would make EE contain an open singleton rectangle. Since O×OO\times O is dense, choose (u,v)(u,v) in this intersection with both points in OO. Choose γn∈G\gamma_n\in G such that γnu=v\gamma_nu=v, and set

hs0=hs,hs1=hsγn.(4.3) h_{s0}=h_s,\qquad h_{s1}=h_s\gamma_n. \tag{4.3}

The finitely many child centers hsu,hsvh_su,h_sv are distinct: different parent centers lie in the disjoint parent regions, and siblings are distinct by u≠vu\ne v. Their cross products in (4.2) avoid the required closed sets. By continuity, choose a sufficiently small open neighborhood VnV_n of uu whose closure lies in Vn−1V_{n-1}, whose image γnVn‾\gamma_n\overline{V_n} lies in Vn−1V_{n-1}, and whose finitely many translated closures have all three properties above. One can first choose the finitely many required open neighborhoods and then a metric ball with closure inside their inverse images. This completes the induction.

For a∈2Na\in2^{\mathbb N}, the nested nonempty closed sets ha∣nVn‾h_{a|n}\overline{V_n} have diameters tending to zero. Completeness gives a unique common point f(a)f(a). Agreement of two prefixes of length nn gives image distance at most 2−n2^{-n}; disjoint sibling closures give injectivity.

If aa and bb have the same tail after coordinate mm, choose vn∈Vnv_n\in V_n, for n>mn>m. Their group words have the form

ha∣n=ha∣mkn,hb∣n=hb∣mkn,(4.4) h_{a|n}=h_{a|m}k_n,\qquad h_{b|n}=h_{b|m}k_n, \tag{4.4}

with exactly the same suffix kn=γm+1am+1⋯γnank_n=\gamma_{m+1}^{a_{m+1}}\cdots\gamma_n^{a_n}. The points ha∣nvnh_{a|n}v_n and hb∣nvnh_{b|n}v_n converge to their branch limits. Apply the fixed inverse prefix translations: both resulting sequences equal knvnk_nv_n. Therefore ha∣m−1f(a)=hb∣m−1f(b)h_{a|m}^{-1}f(a)=h_{b|m}^{-1}f(b), proving that the images are in one orbit.

If a,ba,b differ infinitely often, fix jj and choose n≥jn\geq j at which their bits differ. The image pair lies in the corresponding child-closure product, which misses RjR_j. This holds for each jj, so the pair lies outside EE. Both directions of (4.1) are proved. □\square

The construction is a proof of a familiar Glimm–Effros mechanism. Its role here is precise: infinite disagreement cannot be repaired by any group element, while finite disagreement is repaired by a fixed prefix translation. The intermediate centers all belong to the same dense orbit; their limits need not belong to it.

5. An ergodic probability spread across orbits

Lemma 5.1. On 2N2^{\mathbb N} there is a Borel probability η\eta giving every cylinder of length nn mass 2−n2^{-n}. Every E0E_0-invariant Borel set has mass zero or one, and every E0E_0-class has mass zero.

Proof. For existence, send t∈[0,1)t\in[0,1), with Lebesgue measure, to its binary digits, choosing the terminating expansion at dyadic numbers. Each digit is Borel, and the inverse image of a length-nn cylinder is a half-open interval of length 2−n2^{-n}. The pushforward is the required Borel probability. The cylinder masses give independence of finite blocks of digits. They also imply independence of the first nn coordinates and the entire tail after nn: establish the assertion for tail cylinders and then close under complements and countable disjoint unions. This is the elementary pi-lambda argument.

If AA is Borel and E0E_0-invariant, its membership is unaffected by changing the first nn coordinates. The set of tails obtained by prepending nn zeros is Borel and pulls back exactly to AA. Thus AA is measurable in every tail sigma-algebra. It is independent of every finite-coordinate cylinder. The Borel sets BB satisfying η(A∩B)=η(A)η(B)\eta(A\cap B)=\eta(A)\eta(B) form a lambda-system containing the cylinder pi-system, so they include every Borel set. Take B=AB=A to get η(A)=η(A)2\eta(A)=\eta(A)^2.

A singleton is contained in a cylinder of mass 2−n2^{-n} for every nn, so has mass zero. An E0E_0-class is countable: for each nn there are only 2n2^n sequences agreeing with its fixed tail after nn, and the class is their countable union. Hence it has mass zero.

For completeness, the pi-lambda argument used above is as follows. A lambda-system contains the whole space and is closed under complements and countable disjoint unions; these rules also give differences of nested members. Let D\mathcal D be the smallest lambda-system containing a pi-system P\mathcal P that contains the whole space. For fixed P∈PP\in\mathcal P, the members B∈DB\in\mathcal D with P∩B∈DP\cap B\in\mathcal D form a lambda-system containing P\mathcal P, so include D\mathcal D. Now fix B∈DB\in\mathcal D and repeat the argument with the members A∈DA\in\mathcal D satisfying A∩B∈DA\cap B\in\mathcal D. This proves that D\mathcal D is closed under intersections. Complements and intersections give finite unions; expressing a countable union as a disjoint union gives countable unions. Hence D\mathcal D is a sigma-algebra and equals σ(P)\sigma(\mathcal P). This proves the assertion about the independence lambda-system, and also uniqueness of finite measures agreeing on a generating pi-system. □\square

Proposition 5.2. Under C, condition 4 implies condition 1.

Proof. If an orbit is not locally closed, Proposition 3.3 supplies a closed invariant FF with a dense orbit and meagre orbit relation. Apply Theorem 4.1 and push η\eta forward by ff, viewing the resulting probability μ=f∗η\mu=f_*\eta on XX. For any invariant Borel B⊂XB\subset X, the set f−1(B)f^{-1}(B) is E0E_0-invariant by (4.1), so Lemma 5.1 gives μ(B)=0\mu(B)=0 or 11. Thus μ\mu is ergodic and sigma-finite.

Each orbit is Borel by the coset and injective-image argument in Section 2. Its inverse image under ff, if nonempty, is exactly one E0E_0-class, by both directions of (4.1). Every orbit therefore has μ\mu-mass zero. This contradicts condition 4. No quasi-invariance of μ\mu is asserted or used. □\square

6. Choosing one representative by nested closed sets

We now prove 1⇒5,61\Rightarrow5,6. In fact a T0T_0 quotient suffices.

Lemma 6.1 (the closed-set category test). If A⊂XA\subset X is closed, then

AΔ={x:{g:gx∈A} is nonmeagre in G}(6.1) A^\Delta=\{x:\{g:gx\in A\}\text{ is nonmeagre in }G\} \tag{6.1}

is invariant and Borel.

Proof. The group set in (6.1) is closed. Since GG is Baire, a closed subset is nonmeagre exactly when it has nonempty interior. Fix a countable base (Wi)(W_i) of nonempty open subsets of GG and a countable dense set D⊂GD\subset G. Closedness therefore gives the explicit formula

AΔ=⋃i ⋂g∈D∩Wig−1A.(6.2) A^\Delta=\bigcup_i\ \bigcap_{g\in D\cap W_i}g^{-1}A. \tag{6.2}

Each intersection is closed, so AΔA^\Delta is FσF_\sigma. Replacing xx by hxhx right-translates the group set by h−1h^{-1}; homeomorphisms preserve meagreness. Hence the test is invariant. □\square

Proposition 6.2. If the quotient is T0T_0, there is a Borel map s:X→Xs:X\to X which is constant on each orbit and satisfies s(x)∈Gxs(x)\in Gx.

Proof. Use the invariant open code (Zn)(Z_n) in (2.1), whose fibers are exactly the orbits. Choose a complete metric dd and a countable dense sequence (pj)(p_j) in XX. For each nn, enumerate all closed balls of radius 2−n−22^{-n-2} about the pjp_j; these cover XX. Also exhaust each ZnZ_n by the closed sets

Hn,k={z:d(z,X∖Zn)≥1/k},k≥1.(6.3) H_{n,k}=\{z:d(z,X\setminus Z_n)\geq1/k\},\qquad k\geq1. \tag{6.3}

If Zn=XZ_n=X, use Hn,k=XH_{n,k}=X; if Zn=∅Z_n=\varnothing, the positive case never occurs.

Begin with A0(x)=XA_0(x)=X. Inductively An−1(x)A_{n-1}(x) is a closed set chosen from a countable collection by invariant Borel decisions, and x∈An−1(x)Δx\in A_{n-1}(x)^\Delta. If x∈Znx\in Z_n, enumerate the intersections

An−1(x)∩Hn,k∩B‾(pj,2−n−2).(6.4) A_{n-1}(x)\cap H_{n,k}\cap\overline B(p_j,2^{-n-2}). \tag{6.4}

Choose the first whose closed-set category test contains xx, in a fixed enumeration of (k,j)(k,j). Such a choice exists. Indeed the nonmeagre group preimage of An−1(x)A_{n-1}(x) is covered by the preimages of (6.4), because every group translate of xx lies in ZnZ_n. A countable union of meagre sets would be meagre. If x∉Znx\notin Z_n, make the same first-choice construction with intersections of An−1(x)A_{n-1}(x), X∖ZnX\setminus Z_n, and these closed balls. Again the group preimages cover the preceding nonmeagre group set.

Call the chosen closed set An(x)A_n(x) and the chosen center pjn(x)p_{j_n(x)}. Lemma 6.1 makes each first-choice test Borel and invariant. Induction over the countably many possible previous choices makes jnj_n Borel and orbit-constant. The sets An(x)A_n(x) are nonempty and nested, their diameters tend to zero, and their intersection is a singleton s(x)s(x). It satisfies every positive and negative code decision: the corresponding closed condition was imposed at step nn and remains imposed at all later steps. Its code equals that of xx, so s(x)∈Gxs(x)\in Gx.

Finally d(pjn(x),s(x))≤2−n−2d(p_{j_n(x)},s(x))\leq2^{-n-2}, so ss is a pointwise limit of Borel maps with countable range. Explicitly, for any nonempty closed K⊂XK\subset X, the real Borel functions d(pjn(x),K)d(p_{j_n(x)},K) converge to d(s(x),K)d(s(x),K); the zero set is s−1(K)s^{-1}(K). The empty set has empty preimage. Thus ss is Borel. Orbit-constancy follows from the invariant decisions at every step. □\square

Set T={x:s(x)=x}T=\{x:s(x)=x\}. This is Borel, since the diagonal of X×XX\times X is closed and x↦(x,s(x))x\mapsto(x,s(x)) is Borel. Each orbit meets TT in its unique selected point, so 1⇒61\Rightarrow6. Being a Borel subset of a Polish space, TT is standard Borel. The bijection π∣T:T→Y\pi|_T:T\to Y is a Borel isomorphism: it is measurable by (1.1), and a Borel set B⊂TB\subset T corresponds to a quotient set whose inverse image is s−1(B)s^{-1}(B), which is Borel. Thus 1⇒51\Rightarrow5.

5⇒35\Rightarrow3. A standard Borel space has a countable separating family, transported from a countable base of a Polish realization.

6⇒36\Rightarrow3. Let TT be a Borel transversal and B⊂TB\subset T Borel. Both GBGB and G(T∖B)G(T\setminus B) are analytic: they are continuous images under the action of Borel subsets of G×XG\times X, as in the written prerequisite Theorem 4.3(1). They partition XX, because every orbit meets TT exactly once. The written separation theorem, Theorem 2.4, therefore makes GBGB Borel. Take the saturations of a countable relative base of TT; they are invariant Borel sets separating orbits. These descend to the required family in Bq\mathcal B_q. This closes every implication of Theorem 1.1. □\square

7. Two contrasting models

Scaling. The group R>0\mathbb R_{>0} acts on R\mathbb R by multiplication. Its three orbits are P=(0,∞)P=(0,\infty), N=(−∞,0)N=(-\infty,0), and Z={0}Z=\{0\}. They are locally closed. The quotient is T0T_0, but not Hausdorff, since every neighborhood of ZZ in the quotient is the whole quotient. It is nevertheless a three-point standard Borel space. A Borel selector is

s(x)={1,x>0,−1,x<0,0,x=0.(7.1) s(x)= \begin{cases} 1,&x>0,\\ -1,&x<0,\\ 0,&x=0. \end{cases} \tag{7.1}

Theorem 1.1 makes every nonzero ergodic Borel measure concentrate on one of these three orbits. The measure can fail to be quasi-invariant, as δ1\delta_1 does.

Rational translations. Give Q\mathbb Q the discrete topology and let it translate R\mathbb R. This is a continuous Polish action, satisfying C and D because {0}\{0\} is an identity neighborhood; for D, ⋂nQn‾={x}\bigcap_n\overline{Q_n}=\{x\}. Each orbit is countable, dense and meagre, so no orbit is locally closed. Theorem 1.1 therefore denies countable Borel separation and a Borel transversal. Lebesgue measure is an explicit ergodic sigma-finite witness.

Here is its full ergodicity check, using only finite-measure uniqueness. Let AA be a Borel set invariant under rational translations, and set c=λ(A∩[0,1))c=\lambda(A\cap[0,1)). Translation invariance gives equal AA-measure to all 2n2^n dyadic cells partitioning [0,1)[0,1); each has mass c2−nc2^{-n}. Integer translations give the same assertion in every unit interval. The finite measures λ∣A\lambda|_A and cλc\lambda therefore agree on the dyadic interval pi-system in each unit interval, and hence on all its Borel sets, by the pi-lambda proof in Lemma 5.1. Apply that equality to AA itself in [0,1)[0,1): it gives c=c2c=c^2. Thus cc is zero or one, and the equality of measures in every unit interval makes AA null or conull in R\mathbb R. Its countable orbits all have measure zero. Alternatively, Sections 3–5 construct an ergodic probability with the same zero-orbit-mass property.

8. Graded exercises with complete solutions

Exercise 8.1. Level 1. Prove D implies C without assuming the point neighborhoods are nested.

Solution. Fix NN and its witness MM in D. For any xx, every base member contains xx, so Mx⊂MQnMx\subset M Q_n. Taking closures and then intersecting gives Mx‾⊂⋂nMQn‾⊂Nx\overline{Mx}\subset\bigcap_n\overline{M Q_n}\subset Nx. The same MM works for every point. No nesting was used.

Exercise 8.2. Level 2. In Proposition 2.3, why can the comeagre code fiber not be an orbit different from the original dense orbit?

Solution. C and Lemma 2.1 make the comeagre fiber's orbit open in FF. Every nonempty relatively open set meets the original dense orbit. Orbits that meet are equal, so this open orbit is the original orbit. Merely knowing that the fiber is nonmeagre, without the closure condition, would not yield this conclusion.

Exercise 8.3. Level 2. Derive formula (6.2), including the direction that uses density.

Solution. If the closed group preimage of AA has interior, it contains a nonempty basic open WiW_i, so gx∈Agx\in A for every g∈D∩Wig\in D\cap W_i. Conversely, this condition puts the dense subset D∩WiD\cap W_i into the closed group preimage, and hence puts all of WiW_i into it. Such a nonempty open subset of a Polish group is nonmeagre. Right translation gives invariance, and the countable union of closed intersections gives Borelness.

Exercise 8.4. Level 3. In the Cantor construction, repair a finite change in the first mm binary coordinates by an explicit group element. Explain why no convergence of the varying suffix group elements is needed.

Solution. Formula (4.4) and continuity of the two fixed inverse translations give ha∣m−1f(a)=hb∣m−1f(b)h_{a|m}^{-1}f(a)=h_{b|m}^{-1}f(b). Hence f(b)=hb∣mha∣m−1f(a)f(b)=h_{b|m}h_{a|m}^{-1}f(a). The common points knvnk_nv_n converge after applying those fixed translations. The group elements knk_n themselves need not converge; the proof asserts no such limit.

Exercise 8.5. Level 3. Show that the probability in Proposition 5.2 has no atoms and gives every orbit mass zero, even when the original acting group is uncountable.

Solution. Since ff is injective, the inverse image of a singleton has at most one point and hence zero Bernoulli mass. For an orbit meeting f(2N)f(2^{\mathbb N}), choose one preimage aa. The exact equivalence (4.1) makes its entire preimage [a]E0[a]_{E_0}, a countable set of measure zero. An orbit missing the image has empty preimage. This argument controls orbit preimages and requires no countability of the acting group.

Exercise 8.6. Level 2. Why do nested small closed balls alone fail to prove that the selected limit lies in the required orbit? Identify the extra constraint in Proposition 6.2.

Solution. A nonclosed orbit can approach a point of a different orbit, so a limit of points in the first orbit can lie only in its closure. At step nn, Proposition 6.2 also imposes a closed inner part of ZnZ_n when its code bit is one, and X∖ZnX\setminus Z_n when its bit is zero. These closed constraints survive the limit. Every code bit is imposed at a finite stage, so the final point has exactly the orbit code of the initial point.

Exercise 8.7. Level 2. Compute the quotient sigma-algebra and a transversal for the scaling model. Give an ergodic Borel measure of infinite total mass.

Solution. Each of P,N,ZP,N,Z is Borel, so every subset of the three-point quotient is quotient Borel. The transversal is {−1,0,1}\{-1,0,1\}. The measure dx/xdx/x on PP, extended by zero to the other orbits, is sigma-finite and infinite. Any invariant Borel subset of PP is empty or all of PP, since the scaling action is transitive there. Thus this measure is ergodic and concentrated on PP, as the theorem requires.

Exercise 8.8. Level 3. Let S∞S_\infty act by permuting values on the Polish space II of injective sequences in NN\mathbb N^{\mathbb N}. Prove that its quotient is countably separated but is not T0T_0, and deduce that C fails. This tests the necessity of C in 3⇒13\Rightarrow1.

Solution. The space II is closed in NN\mathbb N^{\mathbb N}, since every coordinate-inequality condition is clopen. The permutation group is Polish in its usual topology, and the value action is continuous. Two injective sequences are in one orbit exactly when their omitted ranges have the same cardinality in N∪{∞}\mathbb N\cup\{\infty\}: the coordinatewise bijection of their ranges extends to a permutation precisely when the complements have equal cardinality. The condition of omitting at least kk values is Borel: take the countable union, over distinct m1,…,mkm_1,\ldots,m_k, of the closed conditions that no coordinate equals any mjm_j. Exact finite defect and infinite defect are therefore Borel, giving a countable separating family.

Every defect orbit is dense in II, since any finite injective prefix extends to an infinite injective sequence with any prescribed complement cardinality. Every nonempty invariant open set consequently meets every orbit and then contains every orbit. The quotient is indiscrete with more than one point, so fails T0T_0.

One can also see the failure of C directly. Choose xx whose range is N∖{0}\mathbb N\setminus\{0\}, and let NN be the subgroup fixing 00. Given any identity neighborhood MM, choose a finite set KK containing 00 whose pointwise fixer lies in MM, and choose b∉Kb\notin K. There is an injective yy with range N∖{0,b}\mathbb N\setminus\{0,b\} which agrees with xx at the coordinates whose values lie in KK. Every finite prefix of yy is obtained from the corresponding prefix of xx by a finite partial permutation compatible with fixing KK; extend it to a permutation fixing KK. Thus y∈Mx‾y\in\overline{Mx}. But NxNx consists of sequences with complement exactly {0}\{0\}, so y∉Nxy\notin Nx. No MM witnesses C for this NN.

References and provenance

Masamichi Takesaki, Theory of Operator Algebras III (2003), Exercise XIII.2(2), PDF page 51, specifies C, D and the Glimm equivalences. Its bibliography entry [508] identifies Edward G. Effros, Transformation Groups and C*-Algebras, Annals of Mathematics 81 (1965), 38–55, publisher record. The full arguments here are newly written course exposition of known mathematics; a complete comparison of wording and distinctive arrangement against all cited sources remains in progress.

David Marker, Descriptive Set Theory, Lemma 4.21, Theorem 4.22 and Corollary 4.23 provides the Baire-envelope and Souslin-operation treatment used to check Lemma 3.1. That public draft is a reference source; no copying or translation permission is inferred from access. Lemmas 3.1–3.2 give the required complete course arguments.

John P. Burgess, A Selection Theorem for Group Actions, Pacific Journal of Mathematics 80 (1979), 333–336, proves the broader selector theorem discussed after Theorem 1.1. The complete four-stage proof was checked; it uses Borel-rank refinement and general Vaught transforms. Section 6 instead treats the invariant-open code available here and proves only the needed closed-set category test, so no general Vaught-transform theorem or Burgess proof is left as an external prerequisite. The Cantor argument is credited to the classical Glimm–Effros construction; its entire induction is supplied in Section 4.

The exact programme prerequisites named at the beginning are actual written proofs, used at their stated scope. AI writing and mathematical self-checking do not constitute independent human review or formal verification. This lesson and its eight solved exercises have original expression dedicated under CC0 1.0; cited sources retain their own rights. The course's remaining general measured-groupoid and source-validation obligations are separate from this completed orbit-space criterion.