Reference

Glossary

Every technical word in the course and what it means in plain language, with flashcards for practice.

Every technical term in the course, with a plain-language meaning. On every page these words are marked with a dotted underline: hover or tap one to see its meaning. The “Used in” links point to the sections where each term appears.

Flashcards — term ⇄ meaning
Ch 1 · Complex Numbers and Elementary Functions
TermMeaningUsed in
branch cutA curve removed from the plane (for $\operatorname{Log}$, the ray $(-\infty,0]$) so that a multivalued function such as $\log z$ or $z^{1/2}$ can be given a continuous single-valued branch on the rest.1.2 3.1
branch of the logarithmA continuous function $L$ on an open set $D\subseteq\mathbb{C}\setminus\{0\}$ with $e^{L(z)}=z$ on $D$. Two branches on a connected set differ by $2\pi ik$; no branch exists on a set containing a circle around $0$.1.2 2.2 2.3
Cauchy–Hadamard formulaThe formula $1/R=\limsup_{n\to\infty}|a_n|^{1/n}$ for the radius of convergence of $\sum a_nz^n$; it works even when the ratio $|a_n/a_{n+1}|$ has no limit.1.2 3.1
circle of ApolloniusThe locus $|z-a|=k|z-b|$ with $k\gt0$, $k\ne1$: a circle with respect to which $a$ and $b$ are inverse points. For $k=1$ the locus is the perpendicular bisector of $[a,b]$.1.1 4.1
complex conjugateFor $z=x+iy$, the number $\bar z=x-iy$: the reflection of $z$ in the real axis. It satisfies $z\bar z=|z|^2$.
extended complex planeThe set $\mathbb{C}_\infty=\mathbb{C}\cup\{\infty\}$ with a single point at infinity; neighbourhoods of $\infty$ are the sets $\{|z|\gt R\}\cup\{\infty\}$.1.1 2.2 3.1 3.2
fundamental theorem of algebraEvery nonconstant polynomial with complex coefficients has a complex root; hence a polynomial of degree $n$ has exactly $n$ roots counted with multiplicity.1.1 2.3 3.1 3.2
power seriesA series $\sum_{n\ge0}a_n(z-z_0)^n$. It converges absolutely inside its disc of convergence and diverges outside; its sum is analytic inside.1.1 1.2 2.1 2.3
principal argumentThe unique argument $\operatorname{Arg}z$ of $z\ne0$ lying in $(-\pi,\pi]$. It is not additive: $\operatorname{Arg}(zw)$ can differ from $\operatorname{Arg}z+\operatorname{Arg}w$ by $\pm2\pi$.1.1
principal logarithm$\operatorname{Log}z=\ln|z|+i\operatorname{Arg}z$ for $z\ne0$, with imaginary part in $(-\pi,\pi]$. It is continuous (indeed analytic) off $(-\infty,0]$ and jumps by $2\pi i$ across it.1.2 3.1 3.2
principal valueThe single value of a multivalued expression obtained with the principal logarithm, e.g. $z^a=e^{a\operatorname{Log}z}$. So $i^i=e^{-\pi/2}$ and the principal value of $(-8)^{1/3}$ is $1+\sqrt3\,i$.1.1 1.2 3.2
radius of convergenceThe number $R\in[0,\infty]$ with $1/R=\limsup|a_n|^{1/n}$: the power series $\sum a_n(z-z_0)^n$ converges for $|z-z_0|\lt R$ and diverges for $|z-z_0|\gt R$. The boundary circle must be examined separately.1.2 3.1
Riemann sphereThe unit sphere in $\mathbb{R}^3$ identified with $\mathbb{C}_\infty$ by stereographic projection; the north pole corresponds to $\infty$.1.1 4.1 9.4
root of unityA solution of $z^n=1$; the $n$-th roots of unity are $e^{2\pi ik/n}$, $k=0,\dots,n-1$. The root $e^{2\pi ik/n}$ is primitive (has order exactly $n$) iff $\gcd(k,n)=1$.1.1 3.1 3.2 6.1
stereographic projectionThe map from the sphere minus its north pole $N$ to the plane sending $P$ to the point where the line $NP$ meets the plane. It maps circles on the sphere to circles or lines in the plane.1.1 4.1 9.4
Ch 2 · Analytic Functions and Complex Integration
TermMeaningUsed in
analytic functionA function that is complex differentiable at every point of an open set. Being analytic at a point $z_0$ means being differentiable on a whole disc around $z_0$; $|z|^2$ is differentiable at $0$ but analytic nowhere.1.2 2.1 2.2 2.3
automorphism of the discA bijective analytic map of the unit disc onto itself. They are exactly the maps $z\mapsto e^{i\theta}\frac{z-a}{1-\bar az}$ with $\theta\in\mathbb{R}$ and $|a|\lt1$.1.1 2.3 4.1
Cauchy's estimatesIf $f$ is analytic on a neighbourhood of $|z-a|\le r$ and $|f|\le M$ on $|z-a|=r$, then $|f^{(n)}(a)|\le n!\,M/r^n$.2.2 2.3 3.1 4.1
Cauchy's integral formulaFor $f$ analytic on a simply connected domain and $a$ inside a positively oriented simple closed contour $\gamma$: $f^{(n)}(a)=\frac{n!}{2\pi i}\oint_\gamma\frac{f(z)}{(z-a)^{n+1}}dz$. Hence analytic functions are infinitely differentiable.2.2 2.3 3.1
Cauchy–Goursat theoremIf $f$ is analytic on an open set containing a closed triangle $T$, then $\oint_{\partial T}f\,dz=0$ — with no assumption that $f'$ is continuous. It is the base case of Cauchy's theorem.2.2
Cauchy–Riemann equationsThe equations $u_x=v_y$, $u_y=-v_x$ for $f=u+iv$ (in polar form $u_r=\frac1rv_\theta$, $v_r=-\frac1ru_\theta$). They are necessary for complex differentiability, and sufficient together with real differentiability of $u,v$ (e.g. continuous partial derivatives).2.1 2.2 2.3 4.1
contour integralFor a piecewise smooth path $\gamma:[a,b]\to\mathbb{C}$, $\int_\gamma f(z)\,dz=\int_a^bf(\gamma(t))\gamma'(t)\,dt$. It changes sign when the path is reversed and does not depend on the parametrisation.2.1 2.2 3.2
entire functionA function analytic on the whole plane $\mathbb{C}$, such as a polynomial, $e^z$, $\sin z$ or $\cos z$.1.1 1.2 2.1 2.2
Hadamard three-circles theoremFor $f$ analytic on a closed annulus $r_1\le|z|\le r_2$, $\log M(r)$, with $M(r)=\max_{|z|=r}|f|$, is a convex function of $\log r$.2.3
harmonic conjugateA harmonic $v$ such that $u+iv$ is analytic. It exists on every simply connected domain and is unique up to an added real constant; $\ln|z|$ has none on $\mathbb{C}\setminus\{0\}$.2.1 2.2 2.3 4.1
harmonic functionA real $C^2$ function $u$ with $u_{xx}+u_{yy}=0$. Real and imaginary parts of analytic functions are harmonic.2.1 2.3 4.1
holomorphicA synonym for analytic: complex differentiable at every point of an open set.2.1
identity theoremIf two functions analytic on a domain $D$ agree on a set with a limit point in $D$ (for instance a sequence of distinct points converging in $D$, or a small arc), they agree on all of $D$.2.1 2.3 3.1 3.2
Jordan curve theoremA simple closed curve in the plane separates it into exactly two domains, a bounded interior and an unbounded exterior, and is their common boundary.2.2 9.1 9.3
Liouville's theoremA bounded entire function is constant. More generally, an entire function with $|f(z)|\le A|z|^n+B$ is a polynomial of degree at most $n$.1.1 2.2 2.3 4.1
maximum modulus principleIf $f$ is analytic and nonconstant on a domain, $|f|$ has no local maximum there; on a bounded domain the maximum of $|f|$ over the closure is attained only on the boundary.2.2 2.3 4.1
Milne–Thomson methodA way to recover an analytic $f$ from $u=\operatorname{Re}f$: $f'(z)=u_x(z,0)-iu_y(z,0)$, then integrate; $f$ is determined up to an imaginary constant.2.1 2.3
minimum modulus principleIf $f$ is analytic, nonconstant and nowhere zero on a domain, $|f|$ has no local minimum there. Without the condition $f\ne0$ it fails: $|z|$ has its minimum $0$ at the centre of the disc.2.3
ML-inequalityIf $|f|\le M$ on a contour $\gamma$ of length $L$, then $\left|\int_\gamma f(z)\,dz\right|\le ML$.2.2 3.1 3.2
Morera's theoremA continuous function whose integral round every closed triangle in an open set $U$ vanishes is analytic on $U$. It implies that uniform limits of analytic functions are analytic.2.2
open mapping theoremA nonconstant analytic function on a domain maps open sets to open sets; near a point where $f-f(a)$ has a zero of order $m$ it is $m$-to-$1$, like $z\mapsto z^m$.2.3 3.1
order of a zeroA zero $a$ of an analytic $f\not\equiv0$ has order $m$ if $f(a)=\cdots=f^{(m-1)}(a)=0\ne f^{(m)}(a)$; then $f(z)=(z-a)^mg(z)$ with $g$ analytic and $g(a)\ne0$. Order $1$: a simple zero.2.3 3.1 3.2 4.1
Schwarz lemmaIf $f$ is analytic on the unit disc with $|f|\le1$ and $f(0)=0$, then $|f(z)|\le|z|$ and $|f'(0)|\le1$, with equality (at some $z\ne0$, or for $f'(0)$) only for rotations $f(z)=e^{i\theta}z$.1.1 2.3 4.1
Schwarz–Pick lemmaAn analytic map $f$ of the unit disc into itself does not increase the pseudo-hyperbolic distance $\left|\frac{z-w}{1-\bar wz}\right|$, and $|f'(z)|\le\frac{1-|f(z)|^2}{1-|z|^2}$; equality characterises the automorphisms.2.3
simply connected domainA domain such that the inside of every simple closed contour in it lies in it (no holes); equivalently every closed path can be shrunk to a point within the domain. Discs and the cut plane are simply connected; annuli and $\mathbb{C}\setminus\{0\}$ are not.2.1 2.2 2.3 3.1
Wirtinger derivativeThe operators $\frac{\partial}{\partial z}=\frac12(\partial_x-i\partial_y)$ and $\frac{\partial}{\partial\bar z}=\frac12(\partial_x+i\partial_y)$. The Cauchy–Riemann equations say $\partial f/\partial\bar z=0$, and then $f'=\partial f/\partial z$.2.1 4.1
Ch 3 · Series and Residues
TermMeaningUsed in
argument principleFor $f$ meromorphic inside and on a simple closed contour $\gamma$, with no zeros or poles on $\gamma$: $\frac{1}{2\pi i}\oint_\gamma\frac{f'}{f}dz=Z-P$, the number of zeros minus poles inside (with multiplicity), which is also the number of turns of $f\circ\gamma$ round $0$.1.1 3.1 3.2
Casorati–Weierstrass theoremIf $a$ is an essential singularity of $f$, then $f$ maps every punctured disc about $a$ onto a dense subset of $\mathbb{C}$.3.1
essential singularityAn isolated singularity whose Laurent series has infinitely many negative powers, such as $0$ for $e^{1/z}$. Near it $|f|$ has no limit, and the image of every punctured disc is dense (Casorati–Weierstrass).2.3 3.1 3.2
Hurwitz's theoremIf zero-free analytic functions $f_n$ converge to $f$ uniformly on compact subsets of a domain, then $f$ is either identically zero or zero-free.3.2 4.1
isolated singularityA point $a$ such that $f$ is analytic on some punctured disc $0\lt|z-a|\lt r$. Limits of poles (such as $0$ for $1/\sin(1/z)$) and branch points are not isolated singularities.3.1 3.2
Jordan's lemmaFor $\alpha\gt0$ and the upper semicircle $C_R$, $\left|\int_{C_R}g(z)e^{i\alpha z}dz\right|\le\frac{\pi}{\alpha}\max_{C_R}|g|$; so the arc integral tends to $0$ whenever $\max_{C_R}|g|\to0$.3.2
Laurent seriesA series $\sum_{n=-\infty}^{\infty}c_n(z-a)^n$ in positive and negative powers of $z-a$. A function analytic on an annulus $r\lt|z-a|\lt R$ equals a unique such series there, with $c_n=\frac1{2\pi i}\oint\frac{f(\zeta)}{(\zeta-a)^{n+1}}d\zeta$; different annuli give different series.3.1 3.2
meromorphic functionA function analytic on an open set except at a set of poles with no limit point in it, e.g. $\tan z$ or any quotient $g/h$ of analytic functions with $h\not\equiv0$. Meromorphic on the extended plane means rational.3.1 3.2 4.1
Picard's theoremLittle: a nonconstant entire function omits at most one complex value. Great: near an essential singularity $f$ takes every value, with at most one exception, infinitely often. $e^z$ and $e^{1/z}$ omit only $0$.2.3 3.1
poleAn isolated singularity $a$ where $|f(z)|\to\infty$. It has order $m$ if $f(z)=g(z)/(z-a)^m$ with $g$ analytic and $g(a)\ne0$; equivalently the principal part ends at $c_{-m}(z-a)^{-m}$. Order $1$: a simple pole.1.1 2.3 3.1 3.2
principal partThe negative-power part $\sum_{n\ge1}c_{-n}(z-a)^{-n}$ of a Laurent series. On a punctured disc it decides the type of the singularity: none = removable, finitely many terms = pole, infinitely many = essential.3.1 3.2
removable singularityAn isolated singularity where the Laurent series has no negative powers; equivalently $f$ is bounded near $a$, or $(z-a)f(z)\to0$ (Riemann's theorem). Defining $f(a)=\lim_{z\to a}f(z)$ makes $f$ analytic there.3.1 3.2 4.1
residueThe coefficient $c_{-1}$ of $\frac{1}{z-a}$ in the Laurent series of $f$ about an isolated singularity $a$; equivalently $\frac{1}{2\pi i}\oint f\,dz$ over a small circle about $a$. At a simple pole it is $\lim(z-a)f(z)$, and $\frac{g(a)}{h'(a)}$ for $f=g/h$.1.1 2.2 3.1 3.2
residue at infinity$\operatorname{Res}_\infty f=-\frac1{2\pi i}\oint_{|z|=R}f\,dz=-c_{-1}$ for $f$ analytic on $|z|\gt R$. All residues of $f$, including the one at $\infty$, add up to $0$; if $zf(z)\to L$ then $\operatorname{Res}_\infty f=-L$.3.2
residue theoremIf $f$ is analytic inside and on a simple closed contour $\gamma$ except at finitely many points $a_k$ inside, then $\oint_\gamma f\,dz=2\pi i\sum_k\operatorname{Res}_{a_k}f$.2.2 3.2
Rouché's theoremIf $f,g$ are analytic inside and on a simple closed contour $\gamma$ and $|f-g|\lt|f|$ on $\gamma$, then $f$ and $g$ have the same number of zeros inside $\gamma$. Used to count zeros of polynomials in discs via a dominant term.1.1 3.2
winding numberThe number of times a closed curve $\Gamma$ not through $a$ turns round $a$ counterclockwise: $\frac{1}{2\pi i}\oint_\Gamma\frac{dw}{w-a}$, the total change of a continuous argument of $w-a$ along $\Gamma$ divided by $2\pi$.1.1 3.1 3.2
Ch 4 · Conformal Mappings
TermMeaningUsed in
Cayley transformThe Möbius map $C(z)=\frac{z-i}{z+i}$, which maps the upper half-plane conformally onto the unit disc and the real axis onto the unit circle.4.1
conformal mapA map that preserves angles between curves, size and orientation; for an analytic $f$ this happens exactly where $f'\ne0$. Between domains, a conformal map usually means an analytic bijection (its inverse is then analytic).4.1
conformally equivalentTwo domains are conformally equivalent if there is an analytic bijection of one onto the other; for example $\mathbb{H}$ and $\mathbb{D}$, but not $\mathbb{C}$ and $\mathbb{D}$.4.1
cross-ratio$(z,z_1,z_2,z_3)=\frac{(z-z_1)(z_2-z_3)}{(z-z_3)(z_2-z_1)}$, the Möbius map sending $z_1,z_2,z_3$ to $0,1,\infty$. It is unchanged by every Möbius map, and it is real exactly when the four points lie on one circle or line.4.1
generalised circleA circle in $\mathbb{C}$, or a line together with $\infty$; these are the circles on the Riemann sphere, and Möbius maps permute them.1.1 4.1
Joukowski map$J(z)=\frac12\left(z+\frac1z\right)$; it maps $|z|\gt1$ conformally onto $\mathbb{C}\setminus[-1,1]$, circles $|z|=r$ onto confocal ellipses, and a circle through $1$ onto an aerofoil with a sharp trailing edge.4.1
Möbius transformationA map $T(z)=\frac{az+b}{cz+d}$ of the extended plane with $ad-bc\ne0$; composition corresponds to multiplying the coefficient matrices, and $T$ maps circles and lines to circles and lines.1.1 4.1
Riemann mapping theoremEvery simply connected domain $D\ne\mathbb{C}$ can be mapped conformally onto the unit disc; the map is unique once $f(z_0)=0$ and $f'(z_0)\gt0$ are prescribed.4.1
symmetric pointsPoints $z,z^*$ with $z^*=a+\frac{R^2}{\overline{z-a}}$ for the circle $|z-a|=R$ (mirror images for a line). Möbius maps send symmetric points to symmetric points (the symmetry principle).4.1
Ch 5 · Combinatorics and Number Theory
TermMeaningUsed in
Bell number$B_n=\sum_kS(n,k)$, the number of partitions of an $n$-set, equivalently of equivalence relations on it: $1,1,2,5,15,52,203,877,\dots$5.1 9.3
binomial coefficient$\binom nk=\frac{n!}{k!\,(n-k)!}$, the number of $k$-element subsets of an $n$-element set; the coefficient of $x^ky^{n-k}$ in $(x+y)^n$. It is $0$ when $k\gt n$.5.1
Bézout's identityFor integers $a,b$ not both $0$ there are integers $x,y$ with $ax+by=\gcd(a,b)$; the numbers $ax+by$ are exactly the multiples of $\gcd(a,b)$.5.2 5.3 6.4 7.1
Chinese Remainder TheoremIf $m_1,\dots,m_k$ are pairwise coprime, the system $x\equiv a_i\pmod{m_i}$ has a solution, unique modulo $m_1\cdots m_k$; equivalently $\mathbb{Z}_{m_1\cdots m_k}\cong\mathbb{Z}_{m_1}\times\cdots\times\mathbb{Z}_{m_k}$.5.2 5.3 6.1 6.2
coprimeIntegers $a,b$ are coprime if $\gcd(a,b)=1$; several integers are pairwise coprime if every two of them are coprime.1.1 5.2 5.3 6.1
derangementA permutation with no fixed point. Their number is $D_n=n!\sum_{k=0}^n\frac{(-1)^k}{k!}$, the integer nearest to $n!/e$ for $n\ge1$: $1,0,1,2,9,44,265,1854,\dots$3.1 5.1 6.1
discrete logarithmThe index $\operatorname{ind}_g(a)$: the exponent $k$, taken modulo $\varphi(n)$, with $g^k\equiv a\pmod n$ for a primitive root $g$. It turns multiplication of units into addition of exponents.5.3 6.4
Erdős–Szekeres theoremEvery sequence of $mn+1$ distinct real numbers has an increasing subsequence of length $m+1$ or a decreasing subsequence of length $n+1$; $mn$ terms are not enough.5.1
Euclid's lemmaIf $a\mid bc$ and $\gcd(a,b)=1$ then $a\mid c$; in particular a prime dividing a product divides one of the factors.5.2 5.3 6.1 7.1
Euclidean algorithmRepeated division with remainder, $r_{i-1}=q_ir_i+r_{i+1}$, starting from $a,b$; the last nonzero remainder is $\gcd(a,b)$, and running the steps backwards gives Bézout coefficients.5.2 7.2 7.3 8.1
Euler's theoremIf $\gcd(a,n)=1$ then $a^{\varphi(n)}\equiv1\pmod n$; for a prime modulus it is Fermat's little theorem.5.1 5.2 5.3 6.1
Euler's totient function$\varphi(n)$ = the number of $k\in\{1,\dots,n\}$ with $\gcd(k,n)=1$; multiplicative, with $\varphi(n)=n\prod_{p\mid n}(1-1/p)$ and $\sum_{d\mid n}\varphi(d)=n$.1.1 5.3 6.1 8.3
falling factorial$n^{\underline k}=n(n-1)\cdots(n-k+1)$, the number of ordered selections of $k$ distinct objects from $n$ (injections $[k]\to[n]$).5.1
Fermat's little theoremFor a prime $p$: $a^{p-1}\equiv1\pmod p$ when $p\nmid a$, and $a^p\equiv a\pmod p$ for every integer $a$.5.2 5.3 7.3 8.2
fundamental theorem of arithmeticEvery integer $n\gt1$ is a product of primes, uniquely up to the order of the factors: $n=p_1^{a_1}\cdots p_r^{a_r}$.5.2
inclusion–exclusion principle$|X\setminus\bigcup A_i|=\sum_{S}(-1)^{|S|}|\bigcap_{i\in S}A_i|$: to count elements in none of the sets, alternately subtract and add the sizes of all intersections. Truncations give upper and lower bounds (Bonferroni).5.1 5.3 8.2
Legendre symbol$\left(\frac ap\right)=1$, $-1$ or $0$ according as $a$ is a quadratic residue, a non-residue, or divisible by the odd prime $p$; by Euler's criterion it is $\equiv a^{(p-1)/2}\pmod p$.5.3 7.3
linear Diophantine equationAn equation $ax+by=c$ to be solved in integers; it is solvable iff $\gcd(a,b)\mid c$, and then $x=x_0+\tfrac bdt$, $y=y_0-\tfrac adt$.5.2
multinomial coefficient$\binom{n}{k_1,\dots,k_r}=\frac{n!}{k_1!\cdots k_r!}$ ($\sum k_i=n$): the number of words with $k_i$ copies of letter $i$, and the coefficient of $x_1^{k_1}\cdots x_r^{k_r}$ in $(x_1+\cdots+x_r)^n$.5.1
multiplicative functionAn arithmetic function with $f(1)=1$ and $f(mn)=f(m)f(n)$ whenever $\gcd(m,n)=1$ (for all $m,n$ if completely multiplicative). Examples: $\varphi$, $\tau$, $\sigma$, $\mu$.5.3
multiplicative orderFor $\gcd(a,n)=1$, $\operatorname{ord}_n(a)$ is the least $h\ge1$ with $a^h\equiv1\pmod n$; $a^k\equiv1$ iff $h\mid k$, and $h\mid\varphi(n)$.5.3 6.3 8.2
Möbius function$\mu(n)=(-1)^r$ if $n$ is a product of $r$ distinct primes, $0$ if a square $\gt1$ divides $n$; $\sum_{d\mid n}\mu(d)=0$ for $n\gt1$, which gives Möbius inversion.1.1 5.3
pigeonhole principleIf $N$ objects are placed in $k$ boxes, some box contains at least $\lceil N/k\rceil$ objects; in particular $k+1$ objects in $k$ boxes force two into the same box.5.1
primitive rootAn integer $g$ whose order modulo $n$ is $\varphi(n)$, so that its powers give every unit mod $n$. Primitive roots exist iff $n=1,2,4,p^k,2p^k$, and then there are $\varphi(\varphi(n))$ of them.1.1 5.2 5.3 6.1
quadratic residueFor an odd prime $p$ and $p\nmid a$: $a$ is a quadratic residue if $x^2\equiv a\pmod p$ is solvable, a non-residue otherwise. Exactly half of the $p-1$ units are residues.5.2 5.3 7.2
reduced residue systemA set of $\varphi(n)$ integers, pairwise incongruent modulo $n$ and each coprime to $n$ — one from each invertible residue class.5.3
residue classThe residue class of $a$ modulo $n$ is $\bar a=\{a+kn:k\in\mathbb{Z}\}$; there are $n$ classes, forming $\mathbb{Z}_n$. A complete residue system picks one integer from each class, e.g. $\{0,1,\dots,n-1\}$.5.2 6.1
stars and barsThe bijection between solutions of $x_1+\cdots+x_r=n$ in nonnegative integers and rows of $n$ stars and $r-1$ bars; it gives $\binom{n+r-1}{r-1}$ solutions, and $\binom{n-1}{r-1}$ in positive integers.5.1
Stirling number of the second kind$S(n,k)$, the number of partitions of an $n$-set into $k$ nonempty unlabelled blocks; $k!\,S(n,k)$ is the number of surjections $[n]\to[k]$, and $S(n,k)=S(n-1,k-1)+kS(n-1,k)$.5.1
Wilson's theoremAn integer $n\ge2$ is prime if and only if $(n-1)!\equiv-1\pmod n$.5.2 8.2
Ch 6 · Groups
TermMeaningUsed in
abelian groupA group in which $ab=ba$ for all elements $a,b$. Examples: $\mathbb{Z}_n$, $U(n)$, $\mathbb{Q}^*$; non-examples: $S_3$, $D_4$, $Q_8$, $GL(2,\mathbb{R})$.5.2 5.3 6.1 6.2
alternating groupThe group $A_n$ of even permutations of $\{1,\dots,n\}$: the kernel of the sign homomorphism, a normal subgroup of $S_n$ of order $n!/2$ for $n\ge2$.6.3 6.4
automorphism group$\operatorname{Aut}(G)$, the group of all isomorphisms $G\to G$ under composition; e.g. $\operatorname{Aut}(\mathbb{Z}_n)\cong U(n)$, $\operatorname{Aut}(V_4)\cong S_3$.6.2 8.3
Burnside's lemmaThe number of orbits of a finite group acting on a finite set is the average number of fixed points, $\frac1{|G|}\sum_{g}|\operatorname{Fix}(g)|$.6.3
Cauchy's theorem for groupsIf a prime $p$ divides the order of a finite group $G$, then $G$ has an element of order $p$; in fact the number of elements of order $p$ is $\equiv-1\pmod p$.
Cayley's theoremEvery group $G$ is isomorphic to a group of permutations, via $g\mapsto(x\mapsto gx)$; a group of order $n$ embeds in $S_n$.6.3
class equation$|G|=|Z(G)|+\sum_i[G:C_G(a_i)]$, the sum over representatives of the conjugacy classes with more than one element; each term divides $|G|$.5.1 6.3 6.4
commutator subgroup$G'$, generated by all $aba^{-1}b^{-1}$. It is normal, and $G/N$ is abelian iff $G'\subseteq N$; e.g. $S_3'=A_3$, $Q_8'=\{\pm1\}$.6.2
conjugacy classThe set $\{gag^{-1}:g\in G\}$ of all conjugates of an element $a$; its size is the index $[G:C_G(a)]$ of the centraliser.6.2 6.3 6.4 8.3
correspondence theoremFor $N\trianglelefteq G$, the subgroups of $G/N$ correspond bijectively to the subgroups of $G$ containing $N$ ($H\leftrightarrow H/N$), preserving inclusion, index and normality.6.2 6.3 6.4 7.1
cosetFor $H\le G$ and $a\in G$, the left coset $aH=\{ah:h\in H\}$ (right coset $Ha$). The left cosets partition $G$ into blocks of size $|H|$.5.1 6.1 6.2 6.3
cycle typeThe partition of $n$ formed by the lengths of the disjoint cycles of a permutation in $S_n$, fixed points counted as $1$-cycles; two permutations are conjugate in $S_n$ exactly when they have the same cycle type.6.2 6.3
cyclic groupA group generated by a single element, $G=\langle a\rangle=\{a^k:k\in\mathbb{Z}\}$; up to isomorphism $\mathbb{Z}$ or $\mathbb{Z}_n$. A cyclic group of order $n$ has exactly one subgroup of each order $d\mid n$ and $\varphi(n)$ generators.1.1 5.3 6.1 6.2
dihedral group$D_n$, the group of the $2n$ symmetries of a regular $n$-gon: $r^n=s^2=e$, $srs^{-1}=r^{-1}$. Here $|D_n|=2n$ (some books write $D_{2n}$).6.1 6.2 6.3 6.4
direct product$G\times H$ with componentwise operation; $o((g,h))=\operatorname{lcm}(o(g),o(h))$, and $\mathbb{Z}_m\times\mathbb{Z}_n\cong\mathbb{Z}_{mn}$ iff $\gcd(m,n)=1$.6.2 6.4 7.1
elementary divisorsThe prime powers $p^{\lambda}$ in a decomposition of a finite abelian group into cyclic groups of prime-power order; for each prime they form a partition of the exponent of $p$ in $|G|$.6.4
exponent of a groupThe least $t\ge1$ with $x^t=e$ for every element $x$, i.e. the lcm of the element orders; a finite abelian group has an element of order equal to its exponent.6.4
first isomorphism theoremFor a homomorphism $\phi:G\to H$, $G/\ker\phi\cong\phi(G)$ via $a\ker\phi\mapsto\phi(a)$.6.2 6.3 7.1 7.2
fundamental theorem of finite abelian groupsEvery finite abelian group is a direct product of cyclic groups of prime-power order, uniquely up to order of the factors; equivalently $\mathbb{Z}_{d_1}\times\cdots\times\mathbb{Z}_{d_r}$ with $d_1\mid d_2\mid\cdots\mid d_r$.6.4
group actionA rule $(g,x)\mapsto g\cdot x$ with $e\cdot x=x$ and $g\cdot(h\cdot x)=(gh)\cdot x$; equivalently a homomorphism from $G$ into the permutations of $X$.6.2 6.3 6.4 8.3
homomorphismA map $\phi:G\to H$ with $\phi(ab)=\phi(a)\phi(b)$. It sends $e$ to $e$ and inverses to inverses, and $o(\phi(a))$ divides $o(a)$.1.2 4.1 6.1 6.2
index of a subgroupThe number $[G:H]$ of left (equivalently, right) cosets of $H$ in $G$; for finite $G$, $[G:H]=|G|/|H|$.
inner automorphismThe automorphism $x\mapsto gxg^{-1}$ of $G$. The inner automorphisms form $\operatorname{Inn}(G)\cong G/Z(G)$, a normal subgroup of $\operatorname{Aut}(G)$.6.2
invariant factorsThe integers $d_1\mid d_2\mid\cdots\mid d_r$, $d_1\gt1$, with $G\cong\mathbb{Z}_{d_1}\times\cdots\times\mathbb{Z}_{d_r}$; the largest, $d_r$, is the exponent of $G$.6.4
kernel$\ker\phi=\{g:\phi(g)=e\}$ for a homomorphism $\phi$; always a normal subgroup, and $\phi$ is injective iff the kernel is trivial.4.1 6.2 6.3 6.4
Klein four-group$V_4=\{e,a,b,c\}$ with $a^2=b^2=c^2=e$, $ab=c$: the non-cyclic group of order $4$, $\cong\mathbb{Z}_2\times\mathbb{Z}_2\cong U(8)\cong U(12)$.4.1 6.1
Lagrange's theoremIf $G$ is finite and $H\le G$, then $|G|=|H|\,[G:H]$; so $|H|$ and every element order divide $|G|$. Its converse is false ($A_4$ has no subgroup of order $6$).5.1 5.3 6.1 6.3
normal subgroupA subgroup $N\le G$ with $gNg^{-1}=N$ for all $g\in G$ (equivalently $gN=Ng$). Exactly the kernels of homomorphisms; exactly the subgroups for which $G/N$ is a group.6.1 6.2 6.3 6.4
normaliser$N_G(H)=\{g\in G:gHg^{-1}=H\}$, the largest subgroup of $G$ in which $H$ is normal; the number of conjugates of $H$ is $[G:N_G(H)]$.6.4
orbit–stabiliser theoremFor a group acting on a set, $g\,G_x\mapsto g\cdot x$ is a bijection from the cosets of the stabiliser onto the orbit, so $|G\cdot x|=[G:G_x]$ divides $|G|$.6.3 6.4 8.3
order of an elementThe least $n\ge1$ with $a^n=e$ (or $\infty$ if there is none); it equals $|\langle a\rangle|$. In $\mathbb{Z}_n$, $o(k)=n/\gcd(n,k)$; in a finite group it divides $|G|$.5.3 6.1 6.3
p-groupA finite group whose order is a power of a prime $p$. A non-trivial $p$-group has a non-trivial centre, and has normal subgroups of every order $p^k$ dividing its order.
quaternion group$Q_8=\{\pm1,\pm i,\pm j,\pm k\}$ with $i^2=j^2=k^2=ijk=-1$: a non-abelian group of order $8$ with a unique element of order $2$ and every subgroup normal.6.1 6.3 8.3
quotient groupFor $N\trianglelefteq G$, the set $G/N$ of cosets with $(aN)(bN)=abN$; a group of order $[G:N]$.6.2 6.3 7.1 9.2
semidirect productA group $N\rtimes H$ built from $N$ and $H$ with $H$ acting on $N$ by automorphisms; e.g. the non-abelian group $\mathbb{Z}_q\rtimes\mathbb{Z}_p$ of order $pq$ when $p\mid q-1$.
simple groupA non-trivial group whose only normal subgroups are $\{e\}$ and itself. The abelian ones are the groups of prime order; $A_5$, of order $60$, is the smallest non-abelian one.6.2 6.4
Sylow subgroupFor $|G|=p^am$ with $p\nmid m$, a subgroup of order $p^a$ — a $p$-subgroup of the largest possible order. Sylow $p$-subgroups exist and are all conjugate.6.4
Sylow theoremsExistence of Sylow $p$-subgroups; any two are conjugate and every $p$-subgroup lies in one; their number $n_p$ divides $m$ and satisfies $n_p\equiv1\pmod p$.5.1 6.1 6.3 6.4
transpositionA $2$-cycle $(a\ b)$, swapping two points and fixing the rest. Every permutation is a product of transpositions, and the parity of their number is determined by the permutation.4.1 6.1 6.2 6.3
Ch 7 · Rings
TermMeaningUsed in
associatesElements $a,b$ of an integral domain with $a=ub$ for a unit $u$; equivalently $\langle a\rangle=\langle b\rangle$. In $\mathbb{Z}[i]$ the associates of $3+2i$ are $\pm(3+2i)$ and $\pm(-2+3i)$.7.2
characteristic of a ringThe least $n\ge1$ with $na=0$ for every element $a$ (the additive order of $1$ when there is an identity), or $0$ if there is none. A domain has characteristic $0$ or a prime.8.2
content of a polynomialFor $f\in\mathbb{Z}[x]$, the gcd $c(f)$ of its coefficients; Gauss's lemma gives $c(fg)=c(f)c(g)$.
cyclotomic polynomial$\Phi_n(x)=\prod(x-\zeta)$ over the primitive $n$-th roots of unity $\zeta$; it has integer coefficients and degree $\varphi(n)$, is irreducible over $\mathbb{Q}$, and $x^n-1=\prod_{d\mid n}\Phi_d(x)$.7.3 8.1 8.2 8.3
Eisenstein's criterionIf a prime $p$ divides every coefficient of $f\in\mathbb{Z}[x]$ except the leading one, and $p^2$ does not divide the constant term, then $f$ is irreducible over $\mathbb{Q}$. Often applied to $f(x+a)$.7.3 8.3
Euclidean domainAn integral domain with a function $\delta$ to $\{0,1,2,\dots\}$ allowing division $a=qb+r$ with $r=0$ or $\delta(r)\lt\delta(b)$; e.g. $\mathbb{Z}$, $F[x]$, $\mathbb{Z}[i]$. Every Euclidean domain is a PID.5.2 7.2 7.3
formal derivativeFor $f=\sum a_kx^k$ over any ring, $f'=\sum ka_kx^{k-1}$, defined without limits; a root $c$ of $f$ is repeated iff $f'(c)=0$ too.7.3 8.1
Gauss's lemmaThe product of two primitive integer polynomials is primitive; hence a polynomial in $\mathbb{Z}[x]$ that factors over $\mathbb{Q}$ factors over $\mathbb{Z}$ into factors of the same degrees.5.3 7.2 7.3 8.1
Gaussian integersThe ring $\mathbb{Z}[i]=\{a+bi:a,b\in\mathbb{Z}\}$, with norm $N(a+bi)=a^2+b^2$; a Euclidean domain whose units are $\pm1,\pm i$.7.1 7.2
Gaussian primeA prime element of $\mathbb{Z}[i]$: up to units, $1+i$, the rational primes $q\equiv3\pmod4$, and $a+bi$ with $a^2+b^2=p$ a prime $\equiv1\pmod4$.7.1 7.2
idealAn additive subgroup $I$ of a ring $R$ that absorbs multiplication: $ra,\ ar\in I$ for all $r\in R$, $a\in I$. Ideals are exactly the kernels of ring homomorphisms, and they are what one divides by to form $R/I$.5.2 6.2 7.1 7.2
idempotent elementAn element $e$ with $e^2=e$; $0$ and $1$ are trivial idempotents. $\mathbb{Z}_n$ has $2^k$ idempotents, $k$ the number of distinct primes dividing $n$.7.1
integral domainA commutative ring with $1\ne0$ and no zero divisors, such as $\mathbb{Z}$, $\mathbb{Z}[i]$ or $F[x]$; cancellation $ab=ac,\ a\ne0\Rightarrow b=c$ holds. Finite integral domains are fields.2.3 7.1 7.2 7.3
irreducible elementA nonzero non-unit $p$ of an integral domain whose only factorisations $p=ab$ have $a$ or $b$ a unit; e.g. $2$ in $\mathbb{Z}[\sqrt{-5}]$.7.2 7.3
irreducible polynomialOver a field $F$: a polynomial of degree $\ge1$ that is not a product of two polynomials of lower degree in $F[x]$. Irreducibility depends on $F$: $x^2+1$ is irreducible over $\mathbb{R}$ but not over $\mathbb{C}$.1.1 5.1 7.2 7.3
maximal idealA proper ideal $M$ with no ideal strictly between $M$ and $R$; equivalently $R/M$ is a field. Maximal ideals are prime, but not conversely.7.1 7.2 7.3 8.1
monic polynomialA nonzero polynomial whose leading coefficient (the coefficient of the highest power of $x$) is $1$, such as $x^3-2x+5$.1.1 7.1 7.3 8.1
nilpotent elementAn element $a$ with $a^k=0$ for some $k\ge1$. In $\mathbb{Z}_n$, $a$ is nilpotent iff every prime factor of $n$ divides $a$; in a commutative ring the nilpotents form an ideal, the nilradical.7.1
prime elementA nonzero non-unit $p$ of an integral domain such that $p\mid ab$ implies $p\mid a$ or $p\mid b$; equivalently $\langle p\rangle$ is a nonzero prime ideal. Prime $\Rightarrow$ irreducible; the converse holds in UFDs.5.2 7.2 7.3
prime idealA proper ideal $P$ of a commutative ring with $ab\in P\Rightarrow a\in P$ or $b\in P$; equivalently $R/P$ is an integral domain. Example: $\langle x\rangle\subset\mathbb{Z}[x]$.7.2 7.3
primitive polynomialA nonzero polynomial in $\mathbb{Z}[x]$ whose coefficients have greatest common divisor $1$ (content $1$), e.g. $2x^2+3$ but not $2x+4$.7.2 7.3 8.2
principal ideal domainAn integral domain in which every ideal is generated by one element, such as $\mathbb{Z}$, $F[x]$ or $\mathbb{Z}[i]$. Every PID is a UFD; $\mathbb{Z}[x]$ is a UFD that is not a PID.5.2 7.2 7.3 8.1
quotient ringFor an ideal $I$ of $R$, the ring $R/I$ of cosets $a+I$ with $(a+I)(b+I)=ab+I$; e.g. $\mathbb{Z}/n\mathbb{Z}=\mathbb{Z}_n$ and $\mathbb{R}[x]/\langle x^2+1\rangle\cong\mathbb{C}$.5.2 6.2 7.1 7.2
rational root testIf $u/v$ in lowest terms is a root of $a_nx^n+\dots+a_0\in\mathbb{Z}[x]$, then $u\mid a_0$ and $v\mid a_n$; so a monic integer polynomial has only integer rational roots.7.3
ring homomorphismA map $\phi$ between rings with $\phi(a+b)=\phi(a)+\phi(b)$ and $\phi(ab)=\phi(a)\phi(b)$; it is unital if $\phi(1)=1$. Its kernel is an ideal and $R/\ker\phi\cong\phi(R)$.5.2 7.1 7.3 8.1
unique factorisation domainAn integral domain in which every nonzero non-unit is a product of irreducibles, uniquely up to order and units. $\mathbb{Z}[x]$ and $F[x,y]$ are UFDs; $\mathbb{Z}[\sqrt{-5}]$ is not.7.2 7.3 8.1 8.3
unit groupThe group $R^\times$ of invertible elements (units) of a ring $R$ with identity under multiplication; $\mathbb{Z}_n^\times=U(n)$ has $\varphi(n)$ elements, $\mathbb{Z}[i]^\times=\{\pm1,\pm i\}$.6.1 7.1
zero divisorA nonzero element $a$ of a ring for which $ab=0$ (or $ba=0$) with some nonzero $b$; e.g. $2$ and $3$ in $\mathbb{Z}_6$. Units are never zero divisors.7.1 7.2 7.3 8.2
Ch 8 · Fields and Galois Theory
TermMeaningUsed in
algebraic closureA field is algebraically closed if every nonconstant polynomial over it has a root in it; an algebraic closure of $F$ is an algebraic extension of $F$ that is algebraically closed (e.g. $\overline{\mathbb{Q}}$, $\mathbb{C}=\overline{\mathbb{R}}$).1.1 8.1 8.2
algebraic elementAn element $\alpha$ of an extension of $F$ that is a root of some nonzero polynomial in $F[x]$; otherwise it is transcendental over $F$. An extension is algebraic if all its elements are.8.1 8.3
Artin–Schreier polynomialA polynomial $x^p-x-a$ over a field of characteristic $p$; its roots are $\beta+c$, $c\in\mathbb{F}_p$, and over $\mathbb{F}_p$ it is irreducible for every $a\ne0$.8.1 8.2
constructible numberA number reachable from $0$ and $1$ by ruler-and-compass constructions; exactly the numbers in a tower of quadratic extensions of $\mathbb{Q}$, so its degree is a power of $2$.8.1 8.3
field extensionA pair of fields $F\subseteq K$, written $K/F$; $K$ is then a vector space over $F$, whose dimension $[K:F]$ is the degree of the extension.1.1 6.2 7.3 8.1
finite fieldA field with finitely many elements. Its order is a prime power $q=p^n$, and for each prime power there is exactly one, $\mathbb{F}_q$ (also written $\mathrm{GF}(q)$), up to isomorphism.5.1 5.2 6.4 7.1
fixed fieldFor a set $H$ of automorphisms of a field $K$, the subfield $K^H=\{a\in K:\sigma(a)=a$ for all $\sigma\in H\}$. By Artin's theorem $[K:K^H]=|H|$ for a finite group $H$.8.2 8.3
freshman's dreamThe identity $(a+b)^p=a^p+b^p$, valid in every commutative ring of prime characteristic $p$ because $p$ divides $\binom pk$ for $0\lt k\lt p$.5.2 7.1 8.1 8.2
Frobenius mapIn characteristic $p$, the ring homomorphism $a\mapsto a^p$ (by the freshman's dream $(a+b)^p=a^p+b^p$). On $\mathbb{F}_{p^n}$ it is an automorphism of order $n$ generating all automorphisms.5.2 7.1 7.3 8.1
fundamental theorem of Galois theoryFor a finite Galois extension $K/F$ with group $G$, the maps $E\mapsto\operatorname{Gal}(K/E)$ and $H\mapsto K^H$ are inverse, inclusion-reversing bijections between intermediate fields and subgroups, with $[E:F]=[G:H]$; $E/F$ is Galois iff $H$ is normal, and then $\operatorname{Gal}(E/F)\cong G/H$.8.2 8.3
Galois extensionA finite extension $K/F$ with $|\operatorname{Aut}(K/F)|=[K:F]$; equivalently $K^{\operatorname{Aut}(K/F)}=F$, or $K$ is the splitting field of a separable polynomial, or $K/F$ is normal and separable.8.2 8.3
Galois groupFor a Galois extension $K/F$, the group $\operatorname{Gal}(K/F)$ of all automorphisms of $K$ that fix $F$ pointwise; its order equals $[K:F]$. The Galois group of a separable polynomial is that of its splitting field.7.3 8.1 8.2 8.3
minimal polynomialFor $\alpha$ algebraic over $F$: the unique monic irreducible $m_\alpha\in F[x]$ with $m_\alpha(\alpha)=0$; it generates the ideal of all polynomials vanishing at $\alpha$, and $[F(\alpha):F]=\deg m_\alpha$.7.3 8.1 8.2 8.3
normal extensionAn algebraic extension $K/F$ such that every irreducible polynomial over $F$ with one root in $K$ splits completely in $K$; for finite extensions, the same as being a splitting field. Example: $\mathbb{Q}(\sqrt[3]2)/\mathbb{Q}$ is not normal.8.3
perfect fieldA field over which every irreducible polynomial is separable: all fields of characteristic $0$, all finite fields, and in characteristic $p$ exactly those with $F=F^p$. $\mathbb{F}_p(t)$ is not perfect.8.1
prime subfieldThe smallest subfield of a field: a copy of $\mathbb{Q}$ in characteristic $0$, of $\mathbb{F}_p$ in characteristic $p$. Every finite field is a vector space over its prime subfield $\mathbb{F}_p$.8.1 8.2 8.3
primitive element of a finite fieldA generator of the cyclic group $\mathbb{F}_q^\times$; there are $\varphi(q-1)$ of them. Its minimal polynomial over $\mathbb{F}_p$ is called a primitive polynomial in coding theory.
primitive element theoremEvery finite separable extension (in particular every finite extension of $\mathbb{Q}$) is simple: $K=F(\gamma)$ for a single element $\gamma$.8.1 8.3
radical extensionAn extension obtained by a tower $F=L_0\subseteq L_1\subseteq\cdots\subseteq L_m$ in which each step adjoins an element $a_i$ with $a_i^{n_i}\in L_{i-1}$, i.e. by successively extracting roots.8.3
separable polynomialA polynomial with no repeated root in a splitting field; equivalently $\gcd(f,f')=1$. An irreducible $f$ is separable iff $f'\ne0$.7.3 8.1 8.3
solvable by radicalsA polynomial is solvable by radicals if its splitting field lies in a radical extension, so its roots can be written using field operations and $n$-th roots. In characteristic $0$ this happens iff its Galois group is solvable (Galois).6.1 8.3
solvable groupA group with a chain $\{1\}=G_0\trianglelefteq G_1\trianglelefteq\cdots\trianglelefteq G_k=G$ whose successive quotients $G_i/G_{i-1}$ are abelian. Abelian groups, $p$-groups and $S_n$ for $n\le4$ are solvable; $S_n$ and $A_n$ for $n\ge5$ are not.8.3
splitting fieldA field over which $f\in F[x]$ factors into linear factors and which is generated over $F$ by the roots of $f$; it exists, has degree at most $(\deg f)!$, and is unique up to isomorphism.8.1 8.2 8.3
tower lawFor fields $F\subseteq K\subseteq L$: $[L:F]=[L:K]\,[K:F]$, and products of bases form a basis. Hence every intermediate degree divides the total.6.1 8.1 8.2 8.3
trace (finite fields)$\operatorname{Tr}(a)=a+a^q+\dots+a^{q^{n-1}}$ for $a\in\mathbb{F}_{q^n}$: an onto $\mathbb{F}_q$-linear map to $\mathbb{F}_q$. In characteristic $2$, $y^2+y=a$ is solvable iff $\operatorname{Tr}(a)=0$.
Ch 9 · Topology
TermMeaningUsed in
basis for a topologyA family $\mathcal{B}$ of sets covering $X$ such that each point of $B_1\cap B_2$ lies in some $B_3\subseteq B_1\cap B_2$; the open sets it generates are the unions of members of $\mathcal{B}$.
box topologyThe topology on $\prod X_\alpha$ with basis all products $\prod U_\alpha$ of open sets; strictly finer than the product topology for infinitely many nontrivial factors.9.2 9.4
cocountable topologyThe topology whose open sets are $\varnothing$ and the sets with countable complement; on $\mathbb{R}$ only eventually constant sequences converge.9.1 9.2 9.3 9.4
cofinite topologyThe topology whose open sets are $\varnothing$ and the sets with finite complement; on an infinite set every infinite subset is dense and any two nonempty open sets meet.9.1 9.2 9.3 9.4
compact spaceA topological space in which every open cover has a finite subcover; equivalently every family of closed sets with the finite intersection property has nonempty intersection.9.4
completely regular spaceA $T_1$ space ($T_{3\frac12}$) in which every point $x$ and closed set $C\not\ni x$ are separated by a continuous $f:X\to[0,1]$ with $f(x)=0$, $f|_C=1$. Normal $\Rightarrow$ completely regular $\Rightarrow$ regular.9.3 9.4
connected componentA maximal connected subset of a space. Components partition the space and are closed, but need not be open (in $\mathbb{Q}$ they are single points).2.1 9.4
connected spaceA topological space that is not the union of two disjoint nonempty open sets; equivalently its only clopen subsets are $\varnothing$ and the space, or every continuous map to $\{0,1\}$ is constant.9.2 9.4
finite intersection propertyA family of sets has it if every finite subfamily has nonempty intersection. A space is compact iff every family of closed sets with this property has nonempty intersection.9.4
Hausdorff spaceA topological space ($T_2$) in which any two distinct points have disjoint open neighbourhoods. Limits of sequences are unique, and the diagonal is closed in $X\times X$; every metric space is Hausdorff.9.3 9.4
homeomorphismA bijection $f$ between topological spaces such that $f$ and $f^{-1}$ are both continuous; homeomorphic spaces share every topological property.2.3 4.1 9.1 9.2
K-topologyThe topology on $\mathbb{R}$ with basis all $(a,b)$ and all $(a,b)\setminus K$, $K=\{1/n:n\in\mathbb{N}\}$. It is Hausdorff but not regular: $0$ and the closed set $K$ cannot be separated.9.3
Klein bottleThe square with $(0,y)\sim(1,y)$ and $(x,0)\sim(1-x,1)$: a closed non-orientable surface that cannot be embedded in $\mathbb{R}^3$.9.2
limit pointA point $x$ every open neighbourhood of which contains a point of $A$ other than $x$; the closure of $A$ is $A$ together with its limit points.2.1 2.3 3.1 9.1
line with two originsThe quotient of two copies of $\mathbb{R}$ glued at every point except $0$. It is $T_1$ and locally homeomorphic to $\mathbb{R}$ but not Hausdorff: $1/n$ converges to both origins.9.2 9.3 9.4
locally compactA Hausdorff space in which every point has a compact neighbourhood, such as $\mathbb{R}^n$ or a discrete space; $\mathbb{Q}$ and infinite-dimensional normed spaces are not locally compact.9.4
Möbius stripThe square $[0,1]^2$ with $(0,y)\sim(1,1-y)$: a one-sided, non-orientable surface with one boundary circle.9.2
normal spaceA $T_1$ space ($T_4$) in which any two disjoint closed sets have disjoint open neighbourhoods. Metric spaces, the Sorgenfrey line and compact Hausdorff spaces are normal; the Sorgenfrey plane is not.9.3 9.4
one-point compactificationThe space $X^*=X\cup\{\infty\}$ whose open sets are those of $X$ and the complements of compact closed subsets of $X$. It is compact, and Hausdorff iff $X$ is locally compact Hausdorff; $(\mathbb{R}^n)^*\cong S^n$.9.4
pasting lemmaIf $X=A\cup B$ with $A,B$ both closed (or both open) and continuous maps on $A$ and $B$ agree on $A\cap B$, the combined map is continuous; it fails for infinitely many closed pieces.9.2
path-connected spaceA space in which any two points are joined by a continuous path $\gamma:[0,1]\to X$. Path-connected implies connected, but not conversely (topologist's sine curve).9.2 9.4
product topologyThe topology on $\prod X_\alpha$ with basic sets $\prod U_\alpha$, $U_\alpha$ open and equal to $X_\alpha$ for all but finitely many $\alpha$; a map into the product is continuous iff all its coordinates are.9.1 9.2 9.3 9.4
quotient mapA continuous surjection $q:X\to Y$ such that $V$ is open in $Y$ exactly when $q^{-1}(V)$ is open; every open or closed continuous surjection is one.9.2 9.3 9.4
quotient topologyFor a surjection $q:X\to Y$, the topology in which $V\subseteq Y$ is open iff $q^{-1}(V)$ is open in $X$; the finest topology making $q$ continuous.9.2 9.3
real projective plane$\mathbb{R}P^2$: the sphere with antipodal points identified, or the square with both pairs of opposite edges glued with a flip; a closed non-orientable surface.9.2
regular spaceA $T_1$ space ($T_3$) in which every point and every closed set not containing it have disjoint open neighbourhoods; equivalently every point has a base of closed neighbourhoods.9.3
saturated setFor a surjection $q$, a set of the form $q^{-1}(V)$, i.e. one that contains every fibre it meets; open sets of a quotient correspond to saturated open sets.9.2
second countableHaving a countable basis for the topology; implies first countable and separable, and for metric spaces is equivalent to separability.9.1 9.2 9.3 9.4
separable spaceA topological space with a countable dense subset, such as $\mathbb{R}^n$ (with $\mathbb{Q}^n$) or the Sorgenfrey line.9.1 9.2 9.3
Sorgenfrey line$\mathbb{R}$ with the lower limit topology generated by the intervals $[a,b)$: first countable and separable but not second countable, hence not metrizable.9.1 9.3 9.4
subbasisA family of sets covering $X$; finite intersections of its members form a basis, and the topology generated is the coarsest one containing the family.9.1 9.2 9.3
subspace topologyThe topology on $Y\subseteq X$ whose open sets are the sets $U\cap Y$ with $U$ open in $X$; closures are computed as $Y\cap\overline{A}$.9.1 9.2 9.3 9.4
Tietze extension theoremIn a normal space every continuous real-valued (or $[a,b]$-valued) function on a closed subset extends continuously to the whole space.9.3
topological spaceA set $X$ with a topology: a family of subsets (the open sets) containing $\varnothing$ and $X$ and closed under arbitrary unions and finite intersections.9.1 9.3 9.4
topologist's sine curveThe set $\{(x,\sin\tfrac1x):0\lt x\le1\}\cup(\{0\}\times[-1,1])$ in $\mathbb{R}^2$: connected and compact but not path-connected.9.2 9.4
totally disconnectedA space whose only connected subsets are single points and $\varnothing$, such as $\mathbb{Q}$, $\mathbb{R}\setminus\mathbb{Q}$, the Cantor set and the Sorgenfrey line.9.4
Tychonoff's theoremAny product of compact spaces is compact in the product topology (not in the box topology). It is equivalent to the axiom of choice.9.4
Urysohn metrization theoremEvery regular second countable space is metrizable; for separable spaces, metrizable $\iff$ regular and second countable.9.3
Urysohn's lemmaIn a normal space, for disjoint closed sets $A,B$ there is a continuous $f:X\to[0,1]$ with $f=0$ on $A$ and $f=1$ on $B$; the converse also holds.9.3 9.4