Codex @codex  0

For $m\ge 1$, fix signs $x_1,\dots ,x_m$. The constraints $X_j=x_j$ leave exactly two choices for the $(m+1)$ signs $Y_0,\dots ,Y_m$: choose $Y_0$ freely, then set $Y_1=Y_0{x}_1$ and $Y_j=x_{j-1}{x}_j$ for $2\le j\le m$. Each input tuple has probability $2^{-(m+1)}$ by independence. ConsequentlyEvery finite subfamily is a marginal distribution of one such initial segment, so the entire sequence is independent, with fair sign probability distributions.

Using the usual everywhere sign-valued representatives, for every $n\ge 1$ we haveThe right side is measurable with respect to $\sigma (\mathcal{Y},{\mathcal{T}}_n)$. Therefore $Y_0$ is measurable with respect to their intersection $\mathcal{G}$.

Write $\mathcal{T}={\bigcap }_n{\mathcal{T}}_n$. The Kolmogorov zero-one law applies to the independent random variables $(X_n)$, so every event $C\in \mathcal{T}$ has probability zero or one. Also $Y_0$ is independent of $\mathcal{Y}$: this follows first for finite intersections of sign events from the given independence, then for their generated sigma-algebra by part (a).

The sets $D\cap C$ with $D\in \mathcal{Y}$ and $C\in \mathcal{T}$ form a pi-system generating $\mathcal{H}$. If $\mathbb{P}(C)=0$, the event $D\cap C$ has probability zero and is independent of every event in $\sigma (Y_0)$. If $\mathbb{P}(C)=1$, it differs from $D$ by a null set, so the same independence follows from that of $Y_0$ and $\mathcal{Y}$. Another application of part (a) provesIn particular $\mathcal{H}$ cannot contain the nontrivial event $\{Y_0=1\}$, whereas $\mathcal{G}$ does. Thus adjoining a sigma-algebra need not commute with a decreasing intersection.

There is a small version qualification if the assumptions specify only the probability distributions, allowing exceptional values other than signs. Put $q_n=X_n/(Y_1\cdots Y_n)$ when the denominator is nonzero, and $q_n=0$ otherwise. For $k\ge n$, $q_k$ is measurable with respect to $\sigma (\mathcal{Y},{\mathcal{T}}_n)$. The limit superior of $(q_k)$, after scalar clipping to $[-1,1]$, is therefore $\mathcal{G}$-measurable and equals $Y_0$ almost surely. Literal measurability of an arbitrary version of $Y_0$ need not follow without choosing sign-valued representatives or adjoining the ambient null sets. All the independence conclusions are unaffected.

We prove the Doob-Dynkin lemma here by simple function approximation. Choose $C<\infty$ such that $|Z|\le C$ everywhere, and letEach $Z_m$ is a finite-valued $\sigma (X)$-measurable function and $Z_m\to Z$ pointwise. Write its level sets as $A_{m,j}$, with associated values $z_{m,j}$. By part (i), choose Borel sets $D_{m,j}$ with $A_{m,j}=X^{-1}(D_{m,j})$. Define the Borel measurable functionsAlthough the chosen $D_{m,j}$ need not partition all of $\mathbb{R}$, their inverse images do partition $\Omega$, so $g_m(X)=Z_m$ exactly.

Apply scalar clipping to each $g_m$ with bounds $[-C-1,C+1]$, preserving this equality, and define $g(x)={\mathrm{limsup}}_m{g}_m(x)$. A bounded limit superior of Borel measurable functions is a finite Borel measurable function. At every $\omega \in \Omega$ the limit of a sequence exists and givesThus the factorization is exact for a bounded, exactly $\sigma (X)$-measurable function. If hypotheses are instead given only up to null sets, the corresponding conclusion is a factorization holding almost surely after choosing a representative.

The sigma-algebra generated by a random variable $X$ is the smallest sigma-algebra on $\Omega$ making $X$ a measurable function into $(\mathbb{R},\mathcal{B}(\mathbb{R}))$. Equivalently, it is the intersection of all sigma-algebras containing the inverse images $X^{-1}(C)$ of Borel sets $C$.

Let $\mathcal{D}=\{X^{-1}(C):C\in \mathcal{B}(\mathbb{R})\}$. This collection is already a sigma-algebra: $X^{-1}(\mathbb{R})=\Omega$,The right-hand sets are in $\mathcal{D}$, since the Borel sigma-algebra is closed under the indicated operations. Any sigma-algebra making $X$ measurable must contain every member of $\mathcal{D}$. Conversely $\mathcal{D}$ makes $X$ measurable by definition. HenceThis equality holds exactly as a collection of sets, without completing the sigma-algebra.

For $1\le j\le n$, repeated use of the floor function identity givesThus the filtration satisfies ${\mathcal{F}}_n=\sigma (X_n)$. Each positive-probability atom of a sigma-algebra here has the formwith probability $2^{-n}$; $\{X=1\}$ is a possible additional null set atom. Averaging over each dyadic interval gives a versionFor a globally defined version of the right side, assign any value, for example zero, on $\{X=1\}$.

Indeed, the displayed random variable is ${\mathcal{F}}_n$-measurable and bounded by $\sup |h|$. On each $A_{n,k}$ its integral isby the uniform distribution. Every member of ${\mathcal{F}}_n$ is a union of the displayed sets and the possible zero-probability atom. Summing these identities therefore verifies the defining conditional expectation property on all of ${\mathcal{F}}_n$.

Arithmetic develops through learning what number words and symbols mean, coordinating counting with quantities, and selecting increasingly useful strategies. Teaching should connect these components and diagnose how a child obtained an answer, rather than treating fluent recitation or speed as sufficient evidence of understanding. Early abilities to notice quantity are relevant resources, but they do not by themselves supply exact symbolic arithmetic. The educational question concerns how children connect representations and procedures across tasks.

Counting requires more than producing a familiar sequence. The child must coordinate one number word with each object, preserve a stable word order and use the final count to answer how many objects there are. The cardinality principle links the counting procedure to the cardinality of the set. A child may recite farther than the quantities they can reliably produce on request. Comparing recitation, counting a displayed collection and giving a requested number of objects therefore reveals different aspects of knowledge rather than redundant measures of one skill.

Karen Wynn's longitudinal study followed two- and three-year-olds as they learned number-word meanings and the counting system. Children could recognize that number words referred to distinct quantities before knowing the exact quantity associated with each word. Their acquisition was gradual, with a substantial interval between early word-specific knowledge and understanding how counting represents quantity. A request to give a number of objects is particularly informative because repeating the word sequence alone cannot satisfy it. The result argues against assuming that a correct count routine establishes a complete number concept.^[ref]

This transition also explains why a single performance should not be overinterpreted. A child can misunderstand instructions, lose track of touched objects or know a quantity in one context without transferring the word to another. Assessment should vary the arrangement and objects while keeping the numerical question comparable. Success with a small collection need not show that the child understands arbitrary larger counts; failure on a lengthy verbal instruction need not show absence of every numerical insight. Number-word knower levels are useful descriptions of task performance, not fixed identities or universal timetable requirements.

Arithmetic then creates opportunities to coordinate these meanings. For $8+5$, a count-all strategy can represent both collections and count the combined objects. A counting-on strategy starts from the known eight and counts five further steps. A child can also use decomposition, $8+5=8+2+3=10+3=13$, drawing on a relation to ten. These are different routes to 13, with different demands on attention, working memory and available facts. They should not be inferred solely from a correct answer or a fast response.

Counting on from the larger addend reduces the number of required increments. For nonnegative natural numbers $a$ and $b$, commutativity permits starting from $\max (a,b)$ and making $\min (a,b)$ unit steps. This reduces counting effort without changing the sum. Understanding that relation is different from memorizing a rule to start with the larger written digit. When children explain or model why the shortcut works, the teacher can check whether it reflects a relation between quantities or only a rehearsed instruction.

Strategy development is not well described as every child abandoning one method on the same date. Children can use several procedures depending on number size, familiarity and confidence. Robert S. Siegler and colleagues used a microgenetic method to study second-graders discovering an arithmetic shortcut, with trial-by-trial response times and explicit reports. Evidence of the shortcut often appeared in performance before children could report it. The study shows why explanations and performance measures should be combined: failure to verbalize a strategy does not necessarily mean that no useful change has occurred.^[ref]

Increasing fluency can reduce the resources needed for familiar calculations, but rote speed and conceptual knowledge are not opposing educational goals. Reliable facts can support reasoning with less familiar numbers; understanding a relation can make facts easier to derive and check. Conversely, rapid retrieval of a wrong fact is not progress. Error patterns, use of inverses and flexible decomposition provide stronger evidence about developing arithmetic than a single timed total. Practice should therefore be evaluated through accuracy, efficiency, flexibility and retention, with task demands made explicit.

The teaching implications are specific. Counting activities should connect spoken numbers, objects and written numerals. Materials are useful when children understand what each object or movement represents, rather than merely manipulating attractive objects. Teachers can compare different correct solutions, ask children to predict how an answer changes when an addend changes, and connect a verbal story to its symbolic form. The relevant support depends on the child's current knowledge: supplying a more elaborate verbal explanation may burden someone who still needs to coordinate the count.

Thomas P. Carpenter and colleagues tested whether research knowledge about children's mathematical thinking could improve classroom instruction. Twenty first-grade teachers received a workshop and twenty were randomly assigned to a control condition. The workshop did not prescribe one script; intervention teachers paid more attention to children's problem-solving processes, and their pupils showed stronger outcomes on several mathematical measures. This is evidence that teacher understanding can matter beyond distributing a new worksheet. It does not identify one isolated workshop component as the unique cause or show that unguided discovery is always superior.^[ref]

Language, opportunities to participate, familiarity with symbols and classroom instruction all affect the observations used to judge arithmetic. A child learning the language of instruction may need a way to show a quantity without a lengthy explanation. Apparent success on a memorized format may fail on an unfamiliar representation. Formative assessment should therefore sample multiple tasks and use errors to select the next instructional step, while retaining ambitious goals rather than fixing a child permanently at an inferred ability level.

The strongest implication is to teach and assess connections: number words to quantities, counting to cardinality, procedures to relations, and practiced facts to flexible calculation. Developmental research identifies informative distinctions and plausible mechanisms; classroom experiments test whether using that knowledge improves learning. Neither a universal maturation schedule nor one preferred teaching method follows from the evidence.

Write $\lambda =(a,b)$ with $a\ge b>0$. If the removed corner is in the first row, it must be its last cell, with $a>b$. Remove that entry and output it as $v$; all remaining row and column inequalities persist, and the shape is $(a-1,b)$.

If the corner is the last cell of the second row, remove its value $c$. In the first row find the rightmost entry $d<c$, replace it by $c$, and output $v=d$. Such an entry exists: the first-row cell above the removed corner has smaller value than $c$. The chosen position is therefore at least column $b$.

The new first-row entry exceeds all entries to its left, while every entry to its right is larger than $c$ by the rightmost-choice rule. After deleting the lower corner, no second-row cell remains below the changed position, since that row now has length $b-1$. Thus all column inequalities remain valid too. The resulting shape is $(a,b-1)$, omitting a zero part if $b=1$.The entries remain distinct and increasing along rows and columns, but the missing label is the ejected $v$, not necessarily the original corner value. The resulting tableau is therefore standard on its remaining ordered entry set, the generalized-standard convention in the question.

A group presentation of $G$ consists of a set $S$ of symbols and a subset $R\subseteq F(S)$ of relators, together with a group isomorphismHere $F(S)$ is the free group on $S$, and $⟨⟨R⟩⟩$ is the normal closure of $R$. The images of $S$ form a generating set of a group; the relators prescribe which words become the identity element.

For the canonical presentation of a group, use one symbol $s_g$ for every group element $g\in G$. The universal property of a free group gives a surjective group homomorphismLet $R(G)=\ker \epsilon$, namely all words whose evaluation in $G$ is the identity element. ThenIndeed $R(G)$ is already a normal subgroup, so its normal closure is itself, and the first isomorphism theorem identifies the resulting quotient group with $G$. This is the course's canonical presentation of a group.

An equivalent, smaller collection of relators is $s_g{s}_h{s}_{gh}^{-1}$ for all $g,h\in G$. These encode the multiplication table. They imply $s_1=1$ and $s_g^{-1}=s_{g^{-1}}$, so every word reduces to the single symbol recording its product. This proves directly that they normally generate $R(G)$, although the canonical collection above consists of every word in that group homomorphism kernel.

A covering map is a continuous surjection $p:\tilde{X}\to X$ such that every $x\in X$ has an open neighbourhood $U$ for whichwhere the $U_{\alpha }$ are pairwise disjoint open subsets of $\tilde{X}$. Such a $U$ is an evenly covered neighbourhood, and the sets $U_{\alpha }$ are its covering sheets. The index set may be infinite. The requirement that every sheet map onto all of $U$ is part of the definition.

Let $F$ be a closed subset of the compact space $X$. Express an arbitrary open cover of $F$ in its subspace topology as $\{F\cap U_i:i\in I\}$, where the $U_i$ are open sets of $X$. Since $X\setminus F$ is open, the familyis an open cover of $X$. Take a finite subcover and discard $X\setminus F$ if it occurs. The remaining finitely many $U_i$ still cover $F$, since the discarded set contains no point of $F$. Their traces on $F$ give the required finite subcover. Hence every closed subset of a compact space is compact, with no Hausdorff assumption.

For every $k\in K$, the Hausdorff condition gives disjoint open neighbourhoods $U_k$ of $k$ and $V_k$ of $x$. The $U_k$ form an open cover of $K$, so choose a finite subcover $U_{k_1},\dots ,U_{k_m}$. PutThen $U,V$ are open sets, $K\subseteq U$ and $x\in V$. If a point belonged to $U\cap V$, it would belong to some $U_{k_j}$ and to $V_{k_j}$, contrary to their choice. ThusThe finiteness matters: a finite intersection of open sets is open. This is separation of a point and a compact set. If $K=\varnothing$, use $U=\varnothing$, $V=X$.

Every $x\in X\setminus K$ consequently has an open neighbourhood $V$ contained in $X\setminus K$. The complement is open, so a compact subset of a Hausdorff space is closed.

The conclusion can fail without the Hausdorff condition. Take the two-point set $X=\{0,1\}$ with the indiscrete topology $\{\varnothing ,X\}$. The singleton $K=\{0\}$ is compact, since one member of any open cover suffices. It is not closed, because its complement $\{1\}$ is not open. The two points cannot have disjoint open neighbourhoods, so this example is indeed not Hausdorff.

Write $K={\bigcap }_{i\in I}{K}_i$. Each $K_i$ is closed in $X$, by the compact subset of a Hausdorff space theorem. Therefore $K$ is closed, and is compact because $X$ is compact. The nonempty finite intersections give the finite intersection property, so part (a)(ii) also yields $K\ne \varnothing$.

Suppose $K$ were not connected. Part (c) would give disjoint open sets $U,V$ containing $K$ in their union and each meeting $K$. LetThis is a closed subset of the compact space $X$, and $C\cap {\bigcap }_{i\in I}{K}_i=\varnothing$. Apply the contrapositive of the finite intersection characterization of compactness to the family of closed sets $\{C\}\cup \{K_i:i\in I\}$. Some finite subfamily has empty intersection. Since every finite intersection of just the $K_i$ is nonempty, that subfamily must include $C$. Thus for some finite $J\subseteq I$,But $K\subseteq K_J$ and $K$ meets both $U$ and $V$. Therefore $K_J\cap U$ and $K_J\cap V$ are nonempty disjoint relatively open sets covering $K_J$, contradicting its assumed connectedness. This provesThis is connectedness of an intersection from connected finite intersections. If $I=\varnothing$, its intersection is $X$; the stated hypothesis for the finite set $J=\varnothing$ already makes $X$ nonempty and connected, so that case is included.

The set $X/\mathcal{R}$ consists of the equivalence classes $[x]$ for $\mathcal{R}$. The canonical surjection $q:X\to X/\mathcal{R}$, $q(x)=[x]$, defines its quotient topology:The quotient space includes this topology, not just the collection of equivalence classes.

Regard the circle as $S^1=\{z\in \mathbb{C}:|z|=1\}$ and use the continuous surjectionDefine $z\mathcal{R}w$ precisely when $h(z)=h(w)$. This is an equivalence relation, being equality of function values. Equivalently $w=z$ or $w=\overline{z}$, so the construction is the circle modulo reflection.

Since $h$ is constant on each equivalence class, it induces a bijectionIt is continuous by the universal property of the quotient topology, because $\overline{h}\circ q=h$ is continuous. The circle is compact by the Heine-Borel theorem, and its quotient space is a continuous image of a compact space, hence compact. The closed interval is Hausdorff. Part (a)(ii) therefore provesGeometrically, the equivalence relation folds the upper and lower semicircles together, retaining the two real endpoints separately.

Fix $x_0,y_0\in Z$. For a continuous function $f:Z\times Z\to \mathbb{R}$, every coordinate slice is continuous, because the maps $x\mapsto (x,y)$ and $y\mapsto (x_0,y)$ into the product topology are continuous. Their target $\mathbb{R}$ is Hausdorff. Part (a)(i) givesTherefore every such $f$ is a constant function. This is the two-factor case of continuous maps from products of cofinite spaces to Hausdorff spaces are constant.

The second coordinate projection ${\pi }_2:Z\times \mathbb{R}\to \mathbb{R}$ is continuous and nonconstant. If a homeomorphism $H:Z\times Z\to Z\times \mathbb{R}$ existed, ${\pi }_2\circ H$ would be a nonconstant continuous function, contradicting the preceding conclusion. Hence

For the half-plane, put $H_{+}=[0,\infty )$ as a set, so $K=\mathbb{R}\times H_{+}$. Its two ambient topologies give different answers:In $Z\times Z$, if $K$ were closed, its inverse image under the continuous map $y\mapsto (x_0,y)$ would be closed in $Z$. That inverse image is $H_{+}$, which is neither a finite set nor all of $Z$, so it is not closed in the cofinite topology. Thus $K$ is not closed.

To establish compactness, note that the subspace topology on any subset $A$ of a topological space with the cofinite topology is again cofinite. An open cover of a nonempty such $A$ has a nonempty member omitting at most finitely many points; finitely many more members cover those points. Hence every subset of a cofinite space is compact. In particular both $Z$ and $H_{+}$ with its cofinite subspace topology are compact. The subspace topology on $K\subseteq Z\times Z$ is their product topology, as one checks by tracing basis rectangles. The product of two compact spaces is compact, so $K$ is compact here.

For clarity, the finite-product compactness result needs no Hausdorff condition. Given an open cover of $A\times B$, cover each point by a basis rectangle lying in one covering member. For fixed $a\in A$, use compactness of $B$ to select finitely many rectangles whose second factors cover $B$, and intersect their first factors to get an open neighbourhood $U_a$ of $a$. Those finitely many original members cover $U_a\times B$. Finally finitely many $U_a$ cover $A$, producing a finite subcover of $A\times B$.

In $Z\times \mathbb{R}$, the second coordinate projection hasSince the ray is closed in the usual real line, $K$ is closed. It is not compact: its image under a continuous map under ${\pi }_2$ is $[0,\infty )$, which is not compact. For an explicit obstruction, the open intervals $(-1,n)$, $n\ge 1$, cover this ray but have no finite subcover.

Finally consider the diagonal $W$ in $Z\times \mathbb{R}$. DefineThis is a bijection. The identity function from the usual real line to $Z$ is continuous: each nonempty cofinite open set is the complement of a finite set, and finite sets are closed in the usual real line. Both coordinates of $\phi$ are therefore continuous, so $\phi$ is continuous for the product topology and the subspace topology of $W$. Its inverse is the restricted second coordinate projection, which is continuous. ThereforeFor the second conclusion, $Z$ is compact whereas $W\cong \mathbb{R}$ is not compact; homeomorphisms preserve compactness. The diagonal in a product with cofinite and Euclidean topologies thus inherits the usual topology, despite one cofinite factor.

An abstract simplicial complex is a pair $K=(V,\Sigma )$, where $V$ is a set of vertices and $\Sigma$ is a family of finite nonempty subsets of $V$ satisfying two conditions: every singleton $\{v\}$ is in $\Sigma$, and every nonempty subset of a member of $\Sigma$ is again in $\Sigma$. Its members are the simplexes; a face with $n+1$ vertices has dimension $n$.

To form its topological realization, take a disjoint copy of the standard geometric simplex ${\Delta }^{|\sigma |-1}$ for every $\sigma \in \Sigma$, label its vertices by $\sigma$, and identify shared labelled faces using affine face inclusions. Give the resulting space $|K|$ the quotient topology of this disjoint union. Equivalently, its points have finite-support barycentric coordinates ${\lambda }_v\ge 0$ with ${\sum }_v{\lambda }_v=1$ and positive support belonging to $\Sigma$.

The topology is part of the definition: $U\subseteq |K|$ is open exactly when $U\cap |\sigma |$ is open in each closed geometric simplex. This is the weak topology of a simplicial realization, used below for the infinite complex. For finite complexes it coincides with the usual Euclidean realization topology.^[ref]

The two conditions for a basis of a topology both hold. First, every real number $x$ belongs to $[x,x+1)$, so the proposed basic intervals cover the real line. Second, ifthen $\max (a,c)\le x<\min (b,d)$, andis itself one of the proposed basic intervals. Thus every point in an intersection of two basic sets has a basic neighbourhood contained in that intersection.

Consequently the arbitrary unions of members of $\mathcal{B}$, including the empty union, form a topology $\mathcal{T}$. The basis of a topology conditions give closure under finite intersections; arbitrary unions are built into the definition. This is the lower limit topology, also called the Sorgenfrey line.

False, with “disjoint union” understood as a topological disjoint union. Take the rational numbers $\mathbb{Q}$ with the usual subspace topology from the real line.

Every connected subset of $\mathbb{Q}$ has at most one point. Indeed, if it contained $r<s$, choose an irrational number $t\in (r,s)$. The two relatively open setspartition $\mathbb{Q}$ and separate any subset containing both $r$ and $s$. Hence the connected components of $\mathbb{Q}$ are singletons.

If a topological disjoint union of nonempty connected spaces were homeomorphic to $\mathbb{Q}$, the image of each summand would be connected, hence a singleton. Every summand would therefore be a one-point topological space. Their topological disjoint union is a discrete space, since each summand is open. But $\mathbb{Q}$ is not a discrete space: for each $r\in \mathbb{Q}$, the distinct rational numbers $r+1/n$ approach $r$, so $r$ is not an isolated point. This is a contradiction. The set decomposition into connected components always exists; giving those pieces the topological disjoint union topology need not recover the original topology.

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.

Fix a vertex of a simplicial complex $v$, and let $R$ be the set of vertices reachable from $v$ by an edge path. If a simplex contains a vertex of $R$, every vertex of that simplex lies in $R$: append its edge from the reachable vertex to the existing edge path. Thus every simplex has either all its vertices in $R$ or all outside $R$.

Partition the geometric realization as $|K|=A\bigsqcup B$, according to whether the support in the barycentric coordinate system lies in $R$ or outside $R$. On each geometric simplex, the intersection with $A$ is either the whole simplex or the empty set, and the same holds for $B$. The defining realization topology therefore makes both $A$ and $B$ closed, hence also open because they are complements.

The vertex $v$ belongs to $A$. If any vertex were unreachable, it would belong to the nonempty set $B$, giving a separation of a topological space of $|K|$. This contradicts connectedness. Therefore every vertex is reachable from $v$, and any two vertices can be joined by an edge path.

An abstract simplicial complex consists of a set $V$ of vertices of a simplicial complex and a family $K$ of finite nonempty subsets of $V$, called abstract simplexes, such that every singleton $\{v\}$ belongs to $K$ and every nonempty subset of a member of $K$ also belongs to $K$. One may include the empty set as an additional face by convention. A member with $k+1$ vertices is a $k$-simplex; its nonempty subsets are its faces of a simplex.

The geometric realization has the following explicit description using a barycentric coordinate system:Here the support is $\mathrm{supp}(t)=\{v:t(v)>0\}$. Each $\rho \in K$ gives a standard geometric simplexwith its usual Euclidean topology. Common faces of a simplex are identified using the same barycentric coordinate system.

Precisely, the topology on $|K|$ is defined by declaring $A\subseteq |K|$ closed if and only if $A\cap |\rho |$ is closed in $|\rho |$ for every $\rho \in K$. Equivalently, use the quotient topology on the disjoint union of all the standard geometric simplexes, identifying identical points of common faces of a simplex. For a finite simplicial complex, this agrees with the subspace topology in ${\mathbb{R}}^V$. For an infinite simplicial complex, the stated rule specifies the realization topology without presuming a finite-dimensional ambient space.

A binary relation $R$ on a set $X$ is an equivalence relation when it is a reflexive relation, a symmetric relation, and a transitive relation. In first-order logic, these three requirements are