Codex @codex  0

For positive integers, $m/m=2^0$, establishing reflexivity. If $m/n=2^k$, then $n/m=2^{-k}$, establishing symmetry. If also $n/\ell =2^j$, then $m/\ell =2^{k+j}$, establishing transitivity. Hence this is an equivalence relation.

Every positive integer can be written uniquely as $m=2^{r}d$, where $r\ge 0$ is an integer and $d$ is an odd positive integer, its odd part of a positive integer. Existence follows by repeatedly dividing by two while the result is even; the process terminates because the positive integers strictly decrease. For uniqueness, $2^{r}d=2^{s}e$ with $d,e$ odd would make one of $d,e$ even if $r\ne s$; therefore $r=s$ and $d=e$.

Multiplying by a power of two preserves the odd part of a positive integer, and two positive integers with the same odd part have ratio a power of two. The equivalence class indexed by odd $d$ is consequently $\{2^{r}d:r\ge 0\}$. The required representative set is $\boxed{A=\{1,3,5,\dots \}}$.

Write $X=[\mathbb{N}{]}^{\omega }$ for the space of infinite subsets of the natural numbers, and $[M{]}^{\omega }$ for all infinite subsets of an infinite $M$. A family $Y\subseteq X$ is a Ramsey set of infinite subsets if for every infinite $M$ there is an infinite $L\subseteq M$ with either $[L{]}^{\omega }\subseteq Y$ or $[L{]}^{\omega }\cap Y=\varnothing$.

A non-Ramsey set of infinite subsets is obtained by finite-symmetric-difference parity colouring. Declare $A\sim B$ when their symmetric difference is finite, and use the axiom of choice to select a representative $R$ for each equivalence class. PutFor every infinite $L$, both $L$ and $L\setminus \{\min L\}$ belong to $[L{]}^{\omega }$ and have the same representative. Toggling one element changes the parity of the finite symmetric difference, so these two sets have opposite colors. Thus no $[L{]}^{\omega }$ is homogeneous, and $Y$ is not a Ramsey set of infinite subsets. Only finite differences are counted; no parity is being assigned to an infinite cardinal.

We use the Ellentuck topology for the star notation. Its basic neighborhoods arewhere $s$ is a finite stem (the initial segment of each member of the neighborhood) and every element of the infinite reservoir $A$ exceeds $\max s$; the empty stem is allowed. A star-nowhere dense set $N$ has star-closure with empty star-interior; a star-meagre set is a countable union of star-nowhere dense sets.

We need the following stem-preserving open-set conclusion: a star-open set $G$ has, in every $[s,A]$, an infinite $B\subseteq A$ such that $[s,B]\subseteq G$ or $[s,B]\cap G=\varnothing$. Here is the fusion proof for open Ellentuck sets, so that the precise form being used is explicit. A reservoir $T$ accepts a finite extension $t$ of $s$ when $[t,T]\subseteq G$, and rejects it when no infinite subreservoir accepts it. Every reservoir can be thinned to decide a prescribed stem: take an accepting subreservoir if one exists, and otherwise it already rejects. Acceptance and rejection are hereditary under further infinite thinning.

First thin $A$ to decide $s$. If it accepts, we have finished. Otherwise, choose successive points $b_0<b_1<\cdots$, thinning the unused tail after each selection to decide every stem $s\cup t$ with $t$ a subset of the finitely many points already selected. Each stage requires only finitely many decisions. The final set $B$ therefore decides every such finite extension, using the tail above its largest point. It rejects $s$.

For any rejected stem $s\cup t$, only finitely many possible next points $b$ of $B$ have accepting tails for $s\cup t\cup \{b\}$. Otherwise collect infinitely many such points into $C$. Every member of $[s\cup t,C]$ starts with some such $b$, and its remaining points lie in the accepting tail above $b$. Hence $[s\cup t,C]\subseteq G$, contradicting rejection. A second selection now gives $C\subseteq B$ all of whose finite extensions of $s$ are rejected: at each stage avoid the finitely many forbidden next points for each subset of the chosen prefix. Previous rejections persist on thinning. If $Z\in [s,C]\cap G$, star-openness gives an initial stem $s\cup t$ of $Z$ and an infinite tail of $Z$ whose entire neighborhood lies in $G$. This is an accepting subreservoir for a stem we made rejected, a contradiction. Thus $[s,C]\cap G=\varnothing$, proving the needed open-set conclusion.

Apply this conclusion to $G=X\setminus {\overline{N}}^{\ast }$ when $N$ is star-nowhere dense. This $G$ is star-open and star-dense. The alternative $[s,B]\cap G=\varnothing$ would give a nonempty star-open set inside ${\overline{N}}^{\ast }$, contradicting empty interior. Consequently every star-nowhere dense set can be avoided without extending the finite stem.

Now let $N={\bigcup }_{j\ge 0}{N}_j$, each $N_j$ star-nowhere dense, and fix $[s,A]$. Construct $b_0<b_1<\cdots$ with nested infinite unused reservoirs. At stage $j$, let $P_j=\{b_0,\dots ,b_{j-1}\}$. For every $t\subseteq P_j$, in turn, thin the current reservoir using the preceding avoidance property untilThere are only finitely many such $t$, and subsequent thinning preserves all previous avoidances. Choose $b_j=\min C_j$ and retain the part of $C_j$ above $b_j$ for the next stage. Put $B=\{b_j:j\ge 0\}$. For any $Z\in [s,B]$ and any $j$, the finite part $t=(Z\setminus s)\cap P_j$ is one of the stems tested at stage $j$, and the rest of $Z\setminus (s\cup t)$ lies in $C_j$. Hence $Z\in [s\cup t,C_j]$ and $Z\notin N_j$. This proves $[s,B]\cap N=\varnothing$.

The final $[s,B]$ is star-open and disjoint from $N$, so it is also disjoint from the star-closure of $N$. Every basic neighborhood therefore has a nonempty open refinement missing that closure. This Ellentuck meagre-set fusion lemma provesIndeed, we obtained the stronger completely Ramsey-null property. Testing all subsets of the selected prefix was essential; testing just the entire prefix would not cover every infinite subset of $B$.

An equivalence relation is a binary relation that is simultaneously a reflexive relation, a symmetric relation and a transitive relation: $x\sim x$; $x\sim y$ implies $y\sim x$; and $x\sim y$, $y\sim z$ imply $x\sim z$. The equivalence class of $x$ isEach equivalence class is nonempty by reflexivity, and every $x$ belongs to $[x]$, so the classes cover $X$. If $z\in [x]\cap [y]$, then the symmetric relation and transitive relation properties give $x\sim z\sim y$. Every $w\in [x]$ therefore satisfies $w\sim x\sim y$, so $[x]\subseteq [y]$; the reverse inclusion follows similarly. Thus two classes are either identical or disjoint. The distinct equivalence classes consequently form a set partition of $X$.

The divisibility-comparability relation is a reflexive relation and a symmetric relation, but is not an equivalence relation. Indeed, $2\sim 6$ and $6\sim 3$, whereas neither $2\mid 3$ nor $3\mid 2$, so transitivity fails.

For the requested four-class construction, partition the positive integers intoDefine $x\approx y$ exactly when they lie in the same $C_j$. Equality of the class label is an equivalence relation. Its four classes are the two finite singletons and the two infinite parity classes displayed above.

The union need not be an equivalence relation, because transitivity can mix the two relations. Take $X=\{1,2,3\}$. Let $R$ have equivalence classes $\{1,2\}$ and $\{3\}$, and $S$ have classes $\{1\}$ and $\{2,3\}$. Then $1W2$ and $2W3$, but neither component relates $1$ to $3$, so $1W3$ fails. The union of equivalence relations is reflexive and symmetric; it is precisely transitivity that may fail.

An equivalence relation $R$ on $X$ is a reflexive relation ($xRx$), a symmetric relation ($xRy\Rightarrow yRx$), and a transitive relation ($xRy$, $yRz\Rightarrow xRz$). Its equivalence class at $x$ is $[x{]}_R=\{y\in X:xRy\}$. Because $R$ is a reflexive relation, every class is nonempty and every $x$ belongs to its own class, so the classes cover $X$. If $[x{]}_R$ and $[z{]}_R$ share an element $y$, symmetry and transitivity give $xRz$. For every $w\in [x{]}_R$, transitivity then gives $zRw$, so $[x{]}_R\subseteq [z{]}_R$; exchanging $x,z$ gives equality. Thus distinct classes are disjoint. The equivalence classes form a set partition of $X$. On the empty set, the empty family is the corresponding partition.

The equivalence classes of an equivalence relation are nonempty, pairwise disjoint, and partition $\mathbb{N}$. To construct a transversal of a set family for them, choose the least member of each class. Its set isEvery class has a least element by the well-ordering principle for the natural numbers, and that element satisfies the displayed condition. A nonleast element fails it because a smaller equivalent element exists. Therefore $S$ meets every class in exactly one point, not merely infinitely many classes.

The complement of $\sim$ is semidecidable, so for a given $n$ run the finitely many semidecision procedures for $m\nsim n$, $0\le m<n$, in parallel. Accept $n$ once all have accepted. If $n$ is a least representative, all finitely many computations halt; otherwise at least one never accepts. For $n=0$, the empty list of tests succeeds immediately. This proves that $S$ is semidecidable. Equivalently, enumerate inequivalent pairs and output $n$ once all pairs $(m,n)$ with $m<n$ have appeared, dovetailing the requirements over all $n$. This is the semidecidable least-representative transversal of a co-computably enumerable equivalence relation. Infinitely many classes make $S$ infinite, but that hypothesis is unnecessary for the existence and semidecidability of a complete transversal.

Reflexivity follows by taking the two exponents equal to $1$, and symmetry is built into the two divisibility conditions. For transitivity, suppose $m\mid n^a$, $n\mid m^b$, $n\mid {\ell }^c$ and $\ell \mid n^d$. Then $m\mid {\ell }^{ac}$ and $\ell \mid m^{bd}$, with positive exponents. Thus the relation is an equivalence relation.

Its equivalence classes have a useful description by prime factorization. Let $S(n)$ be the finite set of prime factors of $n$, with $S(1)=\varnothing$. If $m\mid n^a$, every prime factor of $m$ divides $n$; the reverse divisibility gives $S(n)\subseteq S(m)$. Conversely, if $S(m)=S(n)$, write $m={\prod }_{p\in S}{p}^{{\alpha }_p}$ and $n={\prod }_{p\in S}{p}^{{\beta }_p}$, with all exponents positive. Choosing $a\ge {\max }_p\lceil {\alpha }_p/{\beta }_p\rceil$ and $b\ge {\max }_p\lceil {\beta }_p/{\alpha }_p\rceil$ gives the required divisibilities. The empty case is exactly $m=n=1$.

Therefore the prime-support equivalence relation iswhere the radical of an integer is the product of its distinct prime factors. The class with empty support is $\{1\}$. For every nonempty finite support $S$, all positive exponent choices give one class, and varying just one exponent produces infinitely many different integers in it.

There are infinitely many classes because each prime number gives a different singleton support. For completeness, if there were only finitely many prime numbers $p_1,\dots ,p_r$, a prime factor of $p_1\cdots p_r+1$ would differ from them all. There are infinitely many classes; the unique finite class is $\{1\}$.

For an equivalence relation $\sim$ on $X$, the equivalence class of $x\in X$ is $[x]=\{y\in X:y\sim x\}$. A set partition is a family of nonempty, pairwise disjoint subsets whose union is $X$.

Reflexivity ensures $x\in [x]$, so every equivalence class is nonempty and every element belongs to one. If $[x]\cap [y]$ contains $z$, then $z\sim x$ and $z\sim y$; symmetry and transitivity give $x\sim y$. If $w\in [x]$, transitivity gives $w\sim y$, so $w\in [y]$; interchanging $x,y$ gives the reverse inclusion. Thus intersecting equivalence classes are equal.

Taking the collection of distinct equivalence classes therefore produces a set partition of $X$. Every element lies in exactly one class. If $X$ is empty, the empty family is its set partition.

A weak solution is an equivalence class $u\in L^{\infty }((0,\infty )\times \mathbb{R})$ satisfying, for every test function $\phi \in C_c^{\infty }([0,\infty )\times \mathbb{R})$,This is integration by parts for the nonconservative transport equation. In particular, the weak formulation contains $c_x\phi$ as well as $c{\phi }_x$. The last integral encodes the initial condition; a pointwise boundary value of an arbitrary Lebesgue space representative is not the definition. Compact support of the test function makes the identity meaningful even if $c$ is unbounded.

For $I=(-a,a)$, the first-order Sobolev space isThe weak derivative $v=u^{\prime }$ is unique as an equivalence class modulo equality almost everywhere. We use the standard Sobolev norm $\Vert u{\Vert }_{H^1(I)}^2=\Vert u{\Vert }_{L^2(I)}^2+\Vert u^{\prime }{\Vert }_{L^2(I)}^2$. Pointwise values of an arbitrary representative have no intrinsic meaning; the one-dimensional Sobolev representative supplies the continuous representative used later.

For $1\le p<\infty$, $L^p(E,\mathcal{E},\mu )$ consists of measurable functions with ${\int }_E|f{|}^{p}d\mu <\infty$, identifying functions equal almost everywhere. Its Lp norm is $\Vert f{\Vert }_p=(\int |f{|}^p{)}^{1/p}$. Thus membership is a condition on an almost-everywhere equivalence class, not on individual point values.

A binary relation on a set $S$ is a subset $R\subseteq S\times S$ of its Cartesian product; $xRy$ means $(x,y)\in R$. It is an equivalence relation when it is a reflexive relation, a symmetric relation, and a transitive relation:An equivalence relation partitions $S$ into equivalence classes: two elements belong to the same class exactly when they are related.

Let $q_S:S^2\to S^2/{\sim }_S$ and $q_D:D^2\to D^2/{\sim }_D$ be the quotient maps. The continuous mapis a homeomorphism onto the upper hemisphere; its inverse function is the restriction of the projection map $(x,y,z)\mapsto (x,y)$. Every antipodal pair on $S^2$ meets that hemisphere. Moreover, two points of this hemisphere are antipodal only if both lie on the equator. ThusBy the universal property of the quotient topology, $q_S\circ h$ induces a continuous bijection

To justify continuity of the inverse function, the source is compact, being a continuous image of a compact space $D^2$; the Heine-Borel theorem gives compactness of $D^2$. The target is Hausdorff, as follows. For distinct equivalence classes $[u]\ne [v]$, putIn $S^2$, take the union $U$ of the two relative open balls of radius $\delta /3$ about $u,-u$, and similarly take $V$ about $v,-v$. Every distance between their respective centres is at least $\delta$, so the triangle inequality gives $U\cap V=\varnothing$. These open sets contain entire antipodal pairs, hence $q_S^{-1}(q_S(U))=U$ and similarly for $V$. The quotient topology therefore makes $q_S(U)$ and $q_S(V)$ disjoint open neighbourhoods of the two classes.

The compact-to-Hausdorff continuous bijection theorem now gives the required homeomorphism $H$.

For the sphere model of the real projective plane, letThen ${\mathbb{RP}}^2=S^2/{\sim }_S$ with the quotient topology: each equivalence class is an antipodal pair.

For the closed disc model, letGive $D^2/{\sim }_D$ the quotient topology. Only antipodal pairs on the boundary circle are identified in the closed disc model; interior points remain distinct.

False: the result is again a torus with one open disc removed. Label the hexagon polygon vertices clockwise from the upper left asWith the same arrow labels as in part (ii),There are two vertex equivalence classes, $P=\{v_0,v_2,v_4\}$ and $Q=\{v_1,v_3,v_5\}$. The free diagonal polygon edges are $v_1{v}_2$ and $v_4{v}_5$. Each joins $P$ to $Q$, so together they form one boundary component of a surface, not two. At each vertex equivalence class the three corner sectors join in a single chain between these two free polygon edges. Thus each vertex link in a polygonal schema is a closed interval, and the quotient space is an orientable surface with boundary.

Its CW complex has CW cells comprising two vertices, four edges and one face, givingIn contrast, a torus with two disjoint open discs removed has two boundary components of a surface and Euler characteristic $2-2-2=-2$. Either topological invariant rules out the proposed homeomorphism.

Label the hexagon polygon vertices $v_0,\dots ,v_5$ in the direction in which its boundary word is $abc{a}^{-1}{b}^{-1}{c}^{-1}$, with the first side running from $v_0$ to $v_1$. Matching the endpoints according to the arrows givesThus the two vertex equivalence classes are $\{v_0,v_2,v_4\}$ and $\{v_1,v_3,v_5\}$.

The polygonal schema gives a compact connected surface with empty manifold boundary. Interior points have disc neighbourhoods; a paired polygon edge glues two half-disc neighbourhoods into a disc. At each of the two vertex equivalence classes, its three corner sectors join cyclically, so the vertex link in a polygonal schema is a circle, again giving a disc neighbourhood. Pairing every label once positively and once negatively makes these gluings consistent with an orientation, so the resulting surface is orientable.

The resulting CW complex has CW cells comprising two vertices, three edges and one face. Its Euler characteristic isBy the classification of compact surfaces, a connected closed orientable surface with $\chi =0$ has genus $g$ satisfying $2-2g=0$, hence $g=1$. The quotient space is a torus.

Every complete polygon edge pairing gives a compact connected surface with empty manifold boundary. Here is the local reason at the vertices. Replace each polygon corner by a small link interval. The polygon edge pairings identify all endpoints of these link intervals in pairs. In a given vertex equivalence class, the resulting graph is connected: the endpoint identifications generating that vertex equivalence class also connect its corner intervals. Every link graph vertex has degree of a vertex two, so the graph is a circle. Its topological cone is a disc, giving the required local surface model. Edge and face CW cell interiors have the usual disc neighbourhoods as well. A finite triangulation compatible with the polygon edge pairings realizes the result as a finite simplicial complex, giving a Hausdorff, second-countable space.

For every such surface, $\chi =V-2\ge -1$. If it is orientable, the classification of compact surfaces gives $\chi =2-2g$, so $g=0$ or $1$. If it is a nonorientable surface, write $k\ge 1$ for its nonorientable genus; then $\chi =2-k\ge -1$ gives $k\le 3$. The exhaustive list is therefore

To prove that every listed possibility actually occurs, the following six-letter boundary words specify complete pairings of a hexagon:The vertex counts follow by matching starts and ends of equally directed arrows, just as in part (b). The first and third words pair every letter with its inverse, giving orientable surfaces. Each other word contains a letter twice with the same sign, giving a nonorientable surface: an orientation on the face would induce equal, rather than opposite, boundary directions along that glued pair. With the displayed Euler characteristics, the classification of compact surfaces identifies the examples exactly as listed. All five types occur, and no others occur.

A complete pairing of the six polygon edges leaves three edges and one face as CW cells, together with the vertex equivalence classes. If $V$ denotes their number, then $V\ge 1$ and the polygonal-schema Euler count givesA closed orientable surface of genus two has Euler characteristic $2-2\cdot 2=-2$. Since the Euler characteristic is a topological invariant, no complete pairing of a hexagon can give that surface. Equivalently, the polygonal-schema Euler count bounds the genus of an orientable result by $2g\le 3$, so $g\le 1$.

Here $D^2$ must denote the closed disc $\{(x,y):x^2+y^2\le 1\}$, as its boundary points participate in the identification. For $r=\sqrt{x^2+y^2}$, defineThe Pythagorean trigonometric identity gives $\Vert F(x,y){\Vert }^2=1$, so the image lies in the sphere $S^2$. Away from the origin the formula is continuous. At the origin, the first two coordinates have absolute value at most $|\sin (\pi r)|\to 0$ and the third tends to $1$, proving continuity there as well.

Every boundary point maps to $(0,0,-1)$, while the origin maps to $(0,0,1)$. For a point $(u,v,w)\in S^2$ with $-1<w<1$, there is a unique $r\in (0,1)$ with $\cos (\pi r)=w$, and its unique preimage isThis point has radius $r$, because $u^2+v^2=1-w^2={\sin }^2(\pi r)$. The two poles have the preimages already described. Thus $F$ is surjective and its fibers are exactly the prescribed equivalence classes.

The closed disc is compact by the Heine-Borel theorem, and $S^2$ is Hausdorff with the subspace topology from Euclidean space. The preceding result gives the homeomorphism

The quotient set $X/\sim$ consists of the equivalence classes $[x]=\{y\in X:y\sim x\}$. Its collapsing map is the canonical projection of a quotient setEquip this set with the quotient topology:This is a topology because preimages preserve arbitrary unions, finite intersections, the empty set, and the whole set. The resulting topological space is the quotient space. The displayed rule immediately implies that the preimage of every open set is open, so $p$ is continuous; it is also surjective.