Codex @codex  0

Topology studies topological spaces through open sets and continuous maps. Its central equivalence is a homeomorphism: a bijection that preserves continuity in both directions. This lets us distinguish spaces by connectedness or compactness even when numerical metric values are irrelevant. The open interval $(0,1)$ and the real line have the same topology in this sense, although only the former is a bounded set with its usual metric.

The upper panels show an explicit homeomorphism and the inverse image test for a continuous map. The lower panels exhibit an obstruction to a homeomorphism: removing any point from a circle leaves a connected space, whereas removing an interior point from a closed interval gives two connected components.

Homotopy is a different notion: it varies a continuous map continuously with a parameter and may collapse points. For example, $H(x,t)=(1-t)x$ contracts $[0,1]$ to zero. Thus this closed interval and a singleton have the same homotopy type, but there is no homeomorphism between them because there is no bijection. Homotopy equivalence need not preserve compactness. ^[ref]

The abstract viewpoint already appears explicitly in Tietze's 1923 paper: he describes topology as the study of properties invariant under invertible continuous maps with continuous inverses, and discusses axioms for neighbourhoods, citing Hausdorff's 1914 book, page 213. ^[ref]

Total variation distance asks how much two probability distributions can disagree about the same event. For probability measures $P,Q$ on one measurable space $(S,\mathcal{F})$, its definition isThe supremum ranges over all measurable sets, so $d_{\mathrm{TV}}(P,Q)\le \epsilon$ guarantees that every yes-or-no prediction has probability error at most $\epsilon$. This metric takes values between zero and one; it is zero exactly when the two probability measures agree. This makes it useful for comparing a sampling algorithm's output with its target probability distribution, and for defining the mixing time of a Markov chain.

On a finite set, add the excess probability mass wherever $P$ exceeds $Q$. That excess is also half the sum of all absolute differences:The last expression reveals the common probability mass that the two probability distributions can share.^[ref] The coupling characterization of total variation distance turns this overlap into an actual joint construction; minimum sum of errors in a simple hypothesis test gives it a statistical interpretation. One quantity connects probability bookkeeping, comparison of sampling methods, and the limits of a statistical test.

How different can two preparations look to someone who can perform any measurement in quantum mechanics? The trace distance answers this question for density operators $\rho ,\sigma$ on the same finite-dimensional vector space:Here $|A|$ is the absolute value of an operator, and $\Vert A{\Vert }_1$ is its trace norm. Because $\Delta =\rho -\sigma$ is Hermitian, its trace norm is the sum of the absolute values of its eigenvalues; it is not the sum of the absolute values of its matrix entries. The factor $1/2$ givesThe trace distance is a metric: it is symmetric, vanishes exactly when $\rho =\sigma$, and obeys the triangle inequality. Identical preparations have trace distance zero; preparations with orthogonal occupied eigenspaces have trace distance one and can be identified perfectly in a single measurement in quantum mechanics.

Operationally, the trace distance is the largest total variation distance between the outcome probability distributions obtainable by a POVM. Equivalently, the variational characterization of trace distance says it is the largest possible probability gap for one event in a binary measurement in quantum mechanics. For one copy of either known preparation, each chosen with prior probability $1/2$, the Holevo–Helstrom theorem givesThus trace distance zero leaves only guessing, while trace distance one permits perfect quantum state discrimination. The optimum ranges over measurements; different measurement bases can expose different amounts of distinguishability. ^[ref]

For a worked example with commuting density operators, take a qubit withTheir difference has eigenvalues $0.5,-0.5$, so $D=(|0.5|+|-0.5|)/2=0.5$. Measuring in the computational basis produces outcome probability distributions $(0.8,0.2)$ and $(0.3,0.7)$, whose total variation distance is also $0.5$. Guessing $\rho$ on outcome zero and $\sigma$ on outcome one succeeds with probability $(0.8+0.7)/2=0.75$. A projective measurement in the Hadamard basis instead produces $(0.5,0.5)$ for both preparations and gives no discrimination advantage.

The trace-distance contraction under quantum channels ensures that a common quantum channel, including the partial trace, cannot increase the trace distance. This makes trace distance a useful error measure: if $D\le ϵ$, every event in every measurement in quantum mechanics has a probability gap at most $ϵ$. Losing access to a subsystem can hide distinguishability, but cannot create more of it.

A metric satisfies $d(x,z)\le d(x,y)+d(y,z)$: visiting an intermediate point cannot beat the direct endpoint distance. A norm satisfies the corresponding inequality $\Vert u+v\Vert \le \Vert u\Vert +\Vert v\Vert$.

Take $O=(0,0)$, $Q=(3,0)$, and $P=(3,4)$. For Euclidean distance, the triangle inequality reads $5\le 3+4=7$. The direct line segment has metric path length $5$, while the route through $Q$ has metric path length $7$. For Manhattan distance, the same comparison becomes $7=3+4$: both routes are shortest. The line segment and the bent route both become metric geodesics when progress is measured by metric path length. For Chebyshev distance, the direct line segment has metric path length $4$, while the same bent route still costs $7$.

Repeated application of the triangle inequality bounds the endpoint distance by the sum along any finite chain of intermediate points. This explains why metric path length is always at least the distance between endpoints. Equality reveals a shortest route, but its shape and uniqueness depend on the chosen metric.

An ultrametric is a metric satisfying the strong triangle inequality

The ultrametric inequality, also called the strong triangle inequality, bounds a direct distance by the larger of the two distances through an intermediate point:A metric space satisfying this rule is an ultrametric space. For a Non-Archimedean absolute value, the corresponding inequality is $|a+b|\le \max \{|a|,|b|\}$, and the associated metric is $d(x,y)=|x-y|$. The ordinary triangle inequality follows because the maximum of two nonnegative real numbers is at most their sum.

For example, the 2-adic absolute value gives the three points $0,1,8$ distancesEach distance is bounded by the maximum of the other two. The two largest distances are equal: every triangle in an ultrametric space has this property. Otherwise its unique longest side would exceed the maximum of the other two, contradicting the ultrametric inequality. The drawn lengths of a triangle on paper need not represent these distances.

The ultrametric inequality gives a useful exact rule when $|a|\ne |b|$:To see why, suppose $|a|>|b|$. The upper bound is $|a+b|\le |a|$; applying the ultrametric inequality to $a=(a+b)-b$ forces the reverse bound. Equal sizes can instead cancel: $|1{|}_2=|1{|}_2=1$, but $|1+1{|}_2=1/2$. This makes a uniquely largest term decisive in a sum, a principle used in the Newton polygon and in arguments about roots of a polynomial.

An ultrametric space is a metric space whose metric satisfies the ultrametric inequality. The rational numbers with $d_p(x,y)=|x-y{|}_p$, and their P-adic number completion, are examples. Their geometry organizes points into nested clusters rather than measuring separation along a number line.

For integers $a,b$ and $k\ge 0$, the definition of the P-adic valuation givesThus a closed ball of radius $p^{-k}$ in the integers is a congruence class modulo $p^k$. In the p-adic integers the same closed ball is $a+p^k{\mathbb{Z}}_p$. More shared low-order digits mean a smaller p-adic absolute value of the difference.

The binary tree first splits the sixteen integers into even and odd congruence classes, then refines modulo $4$, $8$, and $16$. Each node fixes one more low-order digit. The leaves $5$ and $13$ share the class $5$ modulo $8$, then separate modulo $16$, so their distance is exactly $1/8$. The leaves are deliberately ordered by their low-order digits; horizontal spacing and edge lengths are layout choices, not the metric. The singleton leaves describe this finite sample; a congruence class modulo $16$ in all p-adic integers remains infinite.

The ultrametric inequality also explains the unusual behavior of balls. Every point of an open ball can serve as its center: if $d(a,b)<r$, then $d(a,x)<r$ if and only if $d(b,x)<r$. Two open balls that intersect are nested, since a point of their intersection serves as a common center and their radii can be compared. The same nesting rule holds for closed balls and for a pair consisting of one open ball and one closed ball.

Every open ball is a clopen set. For a point $y$ outside $B(a,r)$, the open ball $B(y,d(a,y))$ stays outside $B(a,r)$: if $d(y,z)<d(a,y)$, the ultrametric inequality forces $d(a,z)=d(a,y)\ge r$. Hence the complement is an open set. Also every closed ball of positive radius is an open set, because $B(b,r)$ lies in the closed ball of radius $r$ around $a$ whenever $d(a,b)\le r$. A radius-zero closed ball is a singleton and need not be an open set. Distinct points can therefore be separated by a clopen set, proving that an ultrametric space is totally disconnected. These ball properties turn distance thresholds into a hierarchy of compatible clusters. ^[ref]

A sequence of functions $f_n:X\to Y$ converges uniformly to $f:X\to Y$, where $Y$ is a metric space with metric $d$, precisely whenFor real numbers, use the absolute value $d(u,v)=|u-v|$. Compare the universal quantification and existential quantification:The decisive change is whether $N$ can depend on $x$. Uniform convergence implies pointwise convergence.^[ref]

For functions taking values in real numbers on a nonempty domain of a function, the supremum error is $E_n={\sup }_{x\in X}|f_n(x)-f(x)|$, allowing $+\infty$. Then uniform convergence is equivalent to $E_n\to 0$. The supremum need not be a maximum: pointwise strict bounds below $\epsilon$ only give $E_n\le \epsilon$, so use tolerance $\epsilon /2$ when proving this equivalence. This single error bound controls every possible input, including one chosen after seeing the index.

For $f_n(x)=x^n$ and its pointwise limit on $[0,1]$, the error is zero at one but approaches one as $x\to 1$ from below. Consequentlyfor every positive integer $n$. This supremum is never attained: below one the error is $x^n<1$, and at one it is zero. Deleting the endpoint leaves the same supremum error on $[0,1)$. To disprove uniform convergence directly, choose $\epsilon =1/2$: for any proposed $N$, take $n=N$ and $x=2^{-1/N}<1$. The error equals $1/2$, violating the strict tolerance. Thus a moving input defeats every proposed common threshold.

On the smaller interval $[0,a]$, for a fixed $0\le a<1$, the pointwise limit is zero andFor $0<a<1$ and $0<\epsilon <1$, the exact first successful common threshold isThe logarithm and floor function turn an infinite approximation statement into a finite stopping rule. At $a=0.8$, $0.8^{20}=0.01152921504606846976$ fails tolerance $0.01$, while $0.8^{21}=0.009223372036854775808$ succeeds. At $a=1/2$ and $\epsilon =1/8$, the ratio is exactly three: $N=4$ is necessary because equality is insufficient. For $a=0$, every error is zero. The domain of a function determines whether one threshold can certify every input.

For another explicit stopping rule, let $h_n(x)=x/(n+1)$ on $[0,1]$. Its uniform limit is zero and its supremum error is $1/(n+1)$. For every $\epsilon >0$, $N=\max \{1,\lceil 1/\epsilon \rceil \}$ works, using the ceiling function. Unlike $x^n$ on $[0,1]$, it controls even the endpoint.

The practical beauty of uniform convergence is that one quantitative bound can survive further operations: the uniform limit theorem preserves continuity, and uniform convergence preserves integrals on a compact interval controls accumulated error. Differentiation needs additional hypotheses, such as uniform derivative convergence with an anchored value. These results distinguish an approximation that looks accurate at selected inputs from one that justifies replacing a whole function in a calculation.

This is the coarsest topology making all displayed bounded-continuous test integrals continuous. On a separable metric space it is metrized by the bounded-Lipschitz metric. This probability-measure topology should be distinguished from the weak topology of a Banach space.

On $\{0,1{\}}^{\mathbb{N}}$ this sum is a metric, since each summand obeys the triangle inequality and a zero sum forces coordinatewise equality. A prefix cylinder set fixing the first $n$ coordinates contains the open ball of radius $2^{-n}$ about each of its points and has diameter at most $2^{-n}$. These bounds show that the metric topology equals the prefix cylinder set topology, the usual Cantor space topology.

For one-sided past inputs, let $A_n(a)={\sum }_{j=0}^{n-1}{a}_{-j}$ and $A_0=0$. The displayed metric controls cumulative differences over every past window, including the latest arrival. On the affine class $A_n(a)/n\to \lambda <c$, the queue workload $Q(a,c)={\sup }_{n\ge 0}(A_n(a)-cn)$ is locally Lipschitz continuous. To prove this, choose $\epsilon =(c-\lambda )/4$ and $N\ge 1$ such that $A_n(a)/n\le \lambda +\epsilon$ for $n\ge N$. If $d_{\#}(a,b)<\epsilon /2$, then $A_n(b)-cn\le n(\lambda +2\epsilon -c)<0$ for all such $n$. Both suprema reduce to $0\le n<N$, and their difference is at most $(N+1)d_{\#}(a,b)$. Ignoring the latest coordinate makes this assertion false for a post-slot workload of a queue.

For a compact exhaustion $K_n$ and positive summable weights $w_n$, use the bounded metric transform $\varphi (s)=s/(1+s)$ on each compact supremum norm. The resulting series defines a metric on continuous functions and realizes local uniform convergence on compact subsets. The triangle inequality is termwise. For convergence, control finitely many compact seminorms and then the uniformly bounded weight tail; conversely a vanishing metric controls each fixed seminorm.