Codex @codex  0

For finite $U,V,W\subseteq \mathbb{C}$ with $U\ne \{0\}$ and $W\ne \{0\}$,In particular, addition and multiplication cannot both expand a nontrivial finite set of complex numbers only slightly.

Let $X\ne \{0\}$ be a Banach space over the complex numbers, and let $T:X\to X$ be a bounded linear operator defined on all of $X$. Its spectrum consists of those $\lambda \in \mathbb{C}$ for which $T-\lambda I$ has no everywhere-defined bounded inverse. Its complement is the resolvent set of an operator $\rho (T)$. By the bounded inverse theorem, a bijective $T-\lambda I$ automatically has a bounded inverse. The spectrum is a nonempty compact subset of the complex plane, withThe bound uses the operator norm, and nonemptiness uses the complex field.^[ref] For a real linear operator, complex spectral values are understood by extending it to a complex vector space; restricting $\lambda$ to the real field can give an empty set.

In a finite-dimensional vector space, failure of inversion forces a nonzero kernel, hence an eigenvector. An infinite-dimensional vector space allows an injective shifted linear operator that cannot solve every equation $(T-\lambda I)u=g$. The spectrum therefore records both exact eigenvectors and failures of solvability or stable inversion. Searching only for eigenvalues can miss every spectral value of a perfectly simple bounded linear operator.

Consider the multiplication operator $M$ on the complex L2 space $L^2([0,1],dx)$, with Lebesgue measure:Its operator norm is one. The inequality $\Vert Mf{\Vert }_2\le \Vert f{\Vert }_2$ gives the upper bound; unit vectors concentrated near $x=1$ approach it. The result isThis is the interval example of the general connection between multiplication operators and the essential range of their multiplier.^[ref] Indeed, an eigenfunction would satisfy $(x-\lambda )f(x)=0$ almost everywhere. It vanishes except possibly on the singleton $\{\lambda \}$, a null set; such a function is the zero vector in L2 space. Concentrating at one point cannot produce a nonzero L2 function.

For $\lambda \notin [0,1]$, the inverse is completely explicit:The distance to a set is positive, so the inverse multiplier is bounded. Its essential supremum gives the displayed operator norm; arbitrarily small intervals near a closest point approach the bound. Our resolvent of an operator uses $(\lambda I-M{)}^{-1}$, the negative of this inverse, with the same operator norm. For $\lambda =-1/4$, $5/4$, and $1/2+i/10$, the inverse norms are respectively $4$, $4$, and $10$. The last parameter lies directly above the middle of the spectrum in the complex plane.

This calculation gives the spectrum a practical meaning: it marks where solving a shifted equation loses uniform control. At $\lambda =1/2+i\eta$, the largest amplification of an input error is $1/|\eta |$. Changing $\eta$ from $0.1$ to $0.01$ increases that factor from ten to one hundred. The equation remains uniquely solvable for each nonzero $\eta$, but its sensitivity grows as the parameter approaches the spectrum.

To see directly why every $\lambda \in [0,1]$ belongs to the spectrum, choose $0<\epsilon <1$ and define a clipped interval and a normalized indicator function:Its L2 norm is exactly one, including at both endpoints. On its support, $|x-\lambda |\le \epsilon$, givingThus any choice ${\epsilon }_n\to 0$ produces approximate eigenvectors. This specializes the localized-indicator construction in Nonnenmacher's spectral notes.^[ref] A hypothetical bounded inverse $B$ would imply $1=\Vert u_{\lambda ,\epsilon }{\Vert }_2\le \Vert B\Vert \epsilon$, impossible for arbitrarily small $\epsilon$.

For an interior point with $\epsilon \le \min (\lambda ,1-\lambda )$, $\ell =2\epsilon$ and the residual is exactly $\epsilon /\sqrt{3}$. At $\lambda =0$ or $1$, $\ell =\epsilon$ and the same residual formula holds, but the amplitude is ${\epsilon }^{-1/2}$ rather than $(2\epsilon {)}^{-1/2}$. At $\lambda =1/2$, taking $\epsilon =0.2,0.1,0.05$ gives amplitudes approximately $1.5811,2.2361,3.1623$ and residuals $0.11547,0.057735,0.028868$. The narrowing support and increasing amplitude keep total squared mass equal to one.

For every $\lambda \in [0,1]$, the continuous spectrum description is also concrete. Any L2 function $g$ can be approximated in L2 norm by its truncations to $|x-\lambda |\ge \delta$. Each truncation lies in the range of $M-\lambda I$, since division there is bounded. The range is therefore dense. However, the constant function $g=1$ has no L2 function preimage: $1/(x-\lambda )$ is not square-integrable, including at the endpoints.

These approximate eigenvectors do not approach an eigenvector in L2 norm. Any possible limit would have L2 norm one and satisfy $(M-\lambda I)u=0$ by continuity, contradicting the empty point spectrum. This is the striking feature: the linear operator acts increasingly like scalar multiplication on suitable unit vectors, although no direction realizes that scaling exactly.

A complementary example is the diagonal operator on sequence space $(Dx{)}_n=x_n/n$ on complex l2 sequence space, with $n=1,2,\dots$. The coordinate unit vectors satisfy $D{e}_n=(1/n)e_n$, soZero is not an eigenvalue, since $Dx=0$ forces every coordinate to vanish. Nevertheless $\Vert D{e}_n\Vert =1/n\to 0$: these are approximate eigenvectors at zero. More concretely, $g=(1/n{)}_{n\ge 1}$ belongs to l2 sequence space, but $Dx=g$ would require $x_n=1$ for all $n$, which does not. Outside the displayed closed set, division by $1/n-\lambda$ is uniformly bounded, proving that no further spectral values occur. Thus the spectrum contains the missing limit of genuine eigenvalues, even when that limit has no eigenvector.

A nonzero polynomial over a field is square-free if no square of a nonconstant irreducible polynomial divides it. Equivalently, in its factorization of polynomials, every irreducible polynomial factor occurs with exponent one. For example, $x(x^2+1)$ is square-free over the real numbers, whereas $(x-1{)}^2$ is not. Square-freeness over a given field concerns factors in that field; over the real numbers or complex numbers, it is equivalent to having no repeated polynomial roots after splitting over the complex numbers.

A standard Young tableau of shape $\lambda ⊢n$ is a Young tableau that uses $1,\dots ,n$ exactly once and strictly increases left to right along every row and top to bottom down every column. Formally, a bijection $T:Y(\lambda )\to \{1,\dots ,n\}$ is standard whenwhenever the indicated cells belong to the Young diagram. We write $\mathrm{SYT}(\lambda )$ for the set of such fillings and $f^{\lambda }=|\mathrm{SYT}(\lambda )|$ for its cardinality.

For $(3,2)$, the five standard Young tableaux are listed below, with each pair giving the top row followed by the bottom row:There are no others: the upper-left entry must be $1$, and choosing the two bottom-row entries fixes both increasing row orders. Of the six choices of two entries from $\{2,3,4,5\}$, only bottom row $(2,3)$ fails, because its $3$ would lie below $4$. Hence $f^{(3,2)}=5$ by direct enumeration, independently of the hook-length formula.

The cells occupied by $1,\dots ,r$ form a Young diagram: every cell above or to the left of an occupied cell has a smaller label. Consequently a standard Young tableau is equivalently a path from the empty shape to $\lambda$ in the Young branching graph, adjoining one addable node of a Young diagram at each step. For $T_2$, the successive shapes areConversely, number the cell added at step $r$ by $r$ to recover the standard Young tableau. This path interpretation also makes a standard Young tableau a linear extension of a partially ordered set defined by the row and column requirements; see Stanley's Algebraic Combinatorics, Chapter 8, on tableaux and paths in Young's lattice.

The usefulness goes beyond counting: the standard polytabloid basis of a Specht module $S^{\lambda }$ over the complex numbers is indexed by $\mathrm{SYT}(\lambda )$, so ${\dim }_{\mathbb{C}}{S}^{\lambda }=f^{\lambda }$. Each of the five pictured standard Young tableaux therefore labels one basis element of the irreducible representation $S^{(3,2)}$ of the symmetric group $S_5$, whose dimension over the complex numbers is five. The filled diagrams index the basis; the actual vectors are polytabloids. The hook-length formula computes this dimension without listing all the standard Young tableaux.

The symmetric cube of a group representation $V$ is the symmetric part of $V^{\otimes 3}$. Over the complex numbers, its character isThe projection onto symmetric tensors averages the six permutations of the three factors. The identity permutation contributes $\chi (g{)}^3$, the three transpositions each contribute $\chi (g)\chi (g^2)$, and the two three-cycles each contribute $\chi (g^3)$. Cubic polynomial invariants are fixed vectors in ${\mathrm{Sym}}^3(V^{\ast })$, whose dimension follows by averaging this character for a finite group.

After choosing ordered bases, identify a tensor $t={\sum }_{i,j}{c}_{ij}{e}_i\otimes f_j$ with its matrix $C(t)=(c_{ij})$. This is a linear isomorphism between $V{\otimes }_{F}W$ and the vector space of $m$-by-$n$ matrices: each tensor-product basis element becomes the matrix with one entry equal to one and all others zero. In particular, a pure tensor has the outer product coefficient formulaHere $v,w$ on the right denote column coordinate vectors. The identification depends on the chosen bases, while the tensor itself does not. Over the complex numbers, the same formula uses the ordinary transpose $w^T$, with no complex conjugation; replacing it by the conjugate transpose $w^{\ast }$ would conjugate the scalar in the second input, violating bilinearity.

A thermal diffusion wave is a periodically forced solution of the heat equation, with spatially decreasing amplitude and varying wave phase. In a semi-infinite rod $x\ge 0$, assume constant thermal diffusivity, negligible side losses, a nearly uniform temperature across each cross-section, and the boundary conditions $\theta (0,t)={\Theta }_0\cos \omega t$ and $\theta (x,t)\to 0$ as $x\to \infty$. A steady periodic thermal state then satisfiesChoose the square root in the complex numbers with $a>0$ so that the amplitude decays into the rod. Substitution of the phasor into the heat equation proves the formula: $i\omega \hat{\theta }=\alpha {\hat{\theta }}^{\prime \prime }$. Taking the real part gives the displayed cosine. In this convention $a$ is the spatial attenuation slope and $b$ is the spatial lag slope, both in ${\mathrm{m}}^{-1}$; $\gamma$ combines them into one complex number. If a complex wavenumber $K$ is defined by $e^{i\omega t-iKx}$ instead, $K=b-ia$.

With $\Delta x=x_2-x_1>0$, let $A_j=|\hat{\theta }(x_j)|$ and define a positive downstream lag $\Delta \varphi$. Thenand either measurement determines thermal diffusivity:The logarithm uses an amplitude ratio, not a ratio of squared amplitudes. The lag is in radians and must be tracked continuously across cycles: a measured phase difference modulo $2\pi$ leaves an integer-cycle ambiguity. Use closer sensor spacings or vary frequency continuously to resolve that ambiguity. Equal attenuation and lag slopes provide a useful diagnostic of the no-side-loss model.

The apparent phase velocity is $\omega /b=\sqrt{2\alpha \omega }$, which depends on frequency. A thermal diffusion wave therefore does not give a material-independent travel speed for heat; it is a forced pattern in a dissipative diffusion equation. The ideal heat equation still has infinite propagation speed, and the observed lag is not the arrival time of a sharp front.

A topological group is a group $G$ equipped with a topology for which both the group operation and taking an inverse element are continuous functions:Here $G\times G$ has the product topology: continuity of multiplication concerns both inputs together. Thus nearby motions compose to nearby motions, and undoing a motion also varies continuously. The definition alone does not impose compactness; we state the Hausdorff space assumption explicitly when it is needed.

The additive group $(\mathbb{R},+)$ of real numbers, with its usual topology, is a topological group: $(x,y)\mapsto x+y$ and $x\mapsto -x$ are continuous functions. Its identity element is $0$. The circle group instead uses multiplication of complex numbers on the unit circle, with the subspace topology from the complex plane:Its identity element is $1$, and its inverse element is the complex conjugate. Multiplication on the complex plane and complex conjugation are continuous functions, so their restrictions verify the required continuity. Angles add, but points multiply: a quarter-turn followed by another quarter-turn gives $i\cdot i=-1$, and the next two quarter-turns return to $1$. Ordinary addition would fail to stay on the unit circle, since $1+1=2$.

For any fixed $a\in G$, the translations $x\mapsto ax$ and $x\mapsto xa$ are homeomorphisms, with inverses given by translation by $a^{-1}$. Consequently the neighbourhoods of the identity element determine the entire topology. This is why local information near one motion can control a whole family of symmetries. See Tornier, Haar Measures, section 1.1 for these basic properties of topological groups.

A smooth projective curve over the complex numbers is determined up to isomorphism by its Jacobian variety together with its canonical principal polarization of a complex torus. For genus at least three, the branch locus of the theta Gauss map recovers the canonical curve by projective biduality theorem, or recovers the canonical rational normal curve and the branch points of a hyperelliptic curve. In genus two the theta divisor itself is the curve; in genus one the Jacobian variety is the curve after choosing an origin. The polarization is essential data in this statement.

For a linear map $T:V\to W$, the dual map $T^{\ast }:W^{\ast }\to V^{\ast }$ sends a linear functional $\phi$ on the output space to the input measurement $T^{\ast }(\phi )=\phi \circ T$. It reverses direction because a measurement of the output can be evaluated on an input by first applying $T$:For $T(x,y)=(x+y,2y)$ and $\phi (u,v)=2u-v$, the input measurement is $T^{\ast }\phi (x,y)=2(x+y)-2y=2x$. The output measurement ignores the part of this transformation contributed by $y$.

If $T$ has matrix $A$ in specified bases, a row representing $\phi$ changes to $\ell A$. Storing the coefficients of a linear functional as a column in the corresponding dual basis gives $A^T{\ell }^T$, explaining why the transpose of a linear map is represented by the matrix transpose. This algebraic operation uses no inner product; it agrees with a matrix transpose even over the complex numbers, rather than automatically introducing complex conjugation. The adjoint operator is defined using an inner product and is a different construction. ^[ref].

In finite dimension, the kernel and image of the dual map are described by annihilators of vector subspaces:

Trigonometric functions turn an angle into a coordinate or a ratio of lengths. Start at $(1,0)$ on the unit circle and rotate counterclockwise through $\theta$ radians: the resulting point isThe cosine records horizontal position and the sine records vertical position. This definition continues around the whole circle, including negative angles, so the signs encode direction rather than requiring a separate rule for each right triangle.

The unit circle picture explains why these functions are useful beyond measuring triangles. The two coordinates of a point rotating at constant angular speed are periodic functions. Scaling the radius to $A$ and using $\theta =\omega t+\varphi$ gives $x=A\cos (\omega t+\varphi )$ and $y=A\sin (\omega t+\varphi )$. A circular motion becomes two simple repeating traces, connecting Euclidean geometry, simple harmonic motion, and Fourier series.

For an acute angle in a right triangle, rescaling its hypotenuse to one recovers the familiar ratios: sine is opposite side divided by hypotenuse, and cosine is adjacent side divided by hypotenuse. The tangent function is their ratio, $\tan \theta =\sin \theta /\cos \theta$, wherever the denominator is nonzero; the secant function, cosecant, and cotangent give the other reciprocal ratios.

The same names extend to complex numbers through the complex exponential:These definitions agree with the circle interpretation for real angles. For complex arguments, the values need not lie between $-1$ and $1$; the literal circle-coordinate picture is restricted to real arguments. ^[ref]

Over the complex numbers, if $N^m=0$, thenHere the generalized binomial coefficient is $\left(\genfrac{}{}{0ex}{}{\alpha }{j}\right)=\alpha (\alpha -1)\cdots (\alpha -j+1)/j!$, with $\left(\genfrac{}{}{0ex}{}{\alpha }{0}\right)=1$. This is an exact finite identity, even when an infinite binomial series would not converge.

One can construct the required polynomial $q(z)=1+{\sum }_{j=1}^{m-1}{c}_j{z}^j$ without any infinite series. At polynomial degree $j$, the coefficient of $q(z{)}^3$ is $3c_j$ plus terms involving only earlier coefficients. Recursively choose it to agree with $1+z$ through polynomial degree $m-1$; the first coefficients are $1/3,-1/9,5/81$. The stated generalized binomial coefficients solve this recursion: near $z=0$, the binomial series for $(1+z{)}^{1/3}$ cubes to $1+z$, and truncating it changes no coefficient below polynomial degree $m$. Thus $q(z{)}^3-(1+z)$ is divisible by $z^m$ as a polynomial identity. Substituting the nilpotent matrix $N$ kills the remaining terms, all divisible by $N^m$. For a Jordan block $\lambda I+N$ with $\lambda \ne 0$, replace $N$ by $N/\lambda$ and multiply $Q$ by a scalar cube root of $\lambda$.

A twisted boundary condition identifies the ends of an interval up to a fixed unit-modulus complex number. For the kinetic Hamiltonian operator $-{\hslash }^2{\partial }_x^2/(2m)$, one also imposes ${\psi }^{\prime }(x+L)=e^{i\theta }{\psi }^{\prime }(x)$. In integration by parts, the endpoint terms then cancel, giving the usual self-adjoint ring realization. The allowed plane waves have momenta $\hslash (2\pi n+\theta )/L$.

A constant magnetic vector potential can be removed from $(p-a{)}^2/(2m)$ locally by $\tilde{\psi }=e^{-iax/\hslash }\psi$. If $\psi$ is periodic, $\tilde{\psi }$ has twist $\theta =-aL/\hslash$. Thus the Aharonov-Bohm effect survives a locally vanishing vector potential as a global condition on the wavefunction.

For $0\le k\le n/2$, over the complex numbers,By Young's rule, the multiplicity is the Kostka number for content $(n-k,k)$. A semistandard Young tableau on just the entries $1,2$ has at most two rows. For shape $(n-j,j)$, every lower entry is $2$ and every entry above it is $1$; the remaining top row is uniquely fixed by the content. Such a filling exists precisely for $j\le k$. Thus each displayed Specht module occurs once. A zero second part is omitted.

The upper half-plane is the open setIt contains precisely the complex numbers with positive imaginary part: $1+i$ is inside, $1$ lies on its boundary, and $1-i$ belongs to the lower half-plane. In the complex plane its boundary is the real line; in the Riemann sphere the boundary also includes infinity. It is a convex set, hence a simply connected domain, and the Cayley transform between the half-plane and disk makes it biholomorphic to the unit disc.

With the hyperbolic metric $ds=|dz|/\mathrm{Im}z$, the same domain becomes the Poincaré half-plane model. Its hyperbolic geodesics are vertical lines and upper semicircles whose centres lie on the real line. Under the Cayley transform, these become arcs of circles orthogonal to the unit circle, with diameters as the straight-line cases. ^[ref]

Matching colours identify each hyperbolic geodesic and its image. The vertical line through zero maps to a diameter; the vertical line through one maps to an arc ending at $-i$ and $1$. A semicircle from $-1$ to $1$ also maps to a diameter, whereas the semicircle from $0$ to $2$ maps to a curved arc. Their endpoints lie on the boundary, outside the domains: the endpoints are infinitely far from interior points in hyperbolic distance.

The upper half-plane is useful because its straight boundary and explicit upper half-plane automorphisms make conformal maps and hyperbolic geometry calculable. The picture explains why shortest hyperbolic geodesic routes can look curved in Euclidean coordinates; their lengths are measured with the position-dependent hyperbolic metric.

For historical context, in his letter to Klein of 22 September 1882, Poincaré constructs a quadrilateral bounded by four circles orthogonal to a fundamental circle, and studies transformations generating repeated copies. In modern language, the sides inside that circle are hyperbolic geodesics in a disk model. The letter directly exhibits the connection between transformation groups, geometry and complex functions. ^[ref]

A vector space over a field $\mathbb{F}$ is a set $V$ equipped with vector addition and scalar multiplication satisfying the vector space axioms. Its vectors can represent directed displacements, lists of measurements, polynomials, or entire functions. The common structure is that adding two elements and multiplying an element by a scalar remain meaningful operations inside the same space.

For example, ${\mathbb{R}}^2$ uses coordinatewise addition and scaling. Withwe have $v=2b_1+b_2$. Moving twice along $b_1$ and once along $b_2$ reaches the same vector as five horizontal and four vertical steps. The two descriptions refer to different bases of the same space. A basis makes such descriptions unique; a spanning set makes them possible.

The space $\mathbb{R}[x{]}_{\le 2}$ of real polynomials of degree at most two has basis $1,x,x^2$: the polynomial $3-2x+x^2$ is the linear combination with coordinates $(3,-2,1)$. The zero vector here is the zero polynomial, and addition combines coefficients. A derivative is a linear map on this space; its matrix records how it acts on the three basis vectors. The same coordinate machinery therefore handles both geometric motion and operations on functions.

The choice of field matters. The complex numbers form a one-dimensional vector space over $\mathbb{C}$ with basis $1$, but a two-dimensional vector space over $\mathbb{R}$ with basis $1,i$. The question "how many independent directions?" has an answer only after the allowed scalars are specified. Likewise, polynomials of degree exactly two do not form a vector space: subtraction can remove the leading term, and the zero polynomial is absent.

The usefulness of the abstraction is that a linear map is determined by its values on a basis. Once those images are known, linear combinations give its action on every vector. The rank-nullity theorem relates the number of attainable outputs to the number of invisible input directions, while change of basis lets us choose coordinates suited to the problem. Eigenvectors, for example, choose directions on which repeated application of a linear operator becomes scalar multiplication.

A historical source is Hermann Grassmann's Die lineale Ausdehnungslehre (1844). Its full title advertises applications to other branches of mathematics, statics, mechanics, magnetism and crystallography; the original edition is digitized by ETH-Bibliothek. This gives an early setting for treating geometric quantities algebraically across different applications, rather than attributing the modern axiom list to that title alone.^[ref]

Vieta's formulas connect two descriptions of a polynomial: its coefficients and its roots of a polynomial. They let us read the sum and product of the roots of a polynomial without finding the individual roots of a polynomial, and turn a proposed factorization of polynomials into checkable coefficient identities. The key is that coefficients encode elementary symmetric polynomials, which are unchanged by a permutation of the roots of a polynomial.

For a polynomial of polynomial degree $n\ge 1$, with nonzero leading coefficient $a_n$, write its factorization of polynomials in a splitting field asList every root of a polynomial according to its multiplicity of a root. ThenIn particular, ${\sum }_i{r}_i=-a_{n-1}/a_n$ and ${\prod }_i{r}_i=(-1{)}^n{a}_0/a_n$. With coefficients in the real numbers or complex numbers, the fundamental theorem of algebra ensures that a list of $n$ roots of a polynomial in the complex numbers exists when multiplicity of a root is counted.^[ref]

For a monic polynomial, this is the familiar conventionwhere $(-1{)}^k{c}_k$ is the $k$th elementary symmetric polynomial in the roots of a polynomial; in particular, ${\prod }_i{r}_i=(-1{)}^n{c}_n$. The ratio by $a_n$ in the general statement matters: multiplying every coefficient by the same nonzero scalar preserves both the roots of a polynomial and these ratios.

A short derivation explains every alternating sign. In the product ${\prod }_i(x-r_i)$, a term of polynomial degree $n-k$ arises by choosing $-r_i$ from $k$ distinct factor positions and $x$ from the others. Summing the resulting products gives $(-1{)}^k{e}_k$. Values at different positions may coincide: the selection is of positions, not distinct root values. Matching coefficients gives the formula. This is the distributive property organized by the number of chosen root factors.

A wavefunction is the position representation of a pure state. In the one-dimensional model used here, $\psi (x,t)$ takes values in the complex numbers, and the Born rule givesThe probability density $\rho$ has units of inverse length; the wavefunction has units of inverse square root of length. A value of $\rho$ at a point is not itself a probability: probabilities come from an integral over a region. For the infinite square well ground state, $\rho (L/2)=2/L$, whereas the probability of the exact single point $L/2$ is zero. The interesting question is how much probability a finite interval contains.

Two wavefunctions differing only by a global phase represent the same pure state. Relative quantum phases between components of a quantum superposition affect matter-wave interference, so retaining the full complex number amplitude is essential. This scalar description covers a particle without active spin degrees of freedom; a general electron wavefunction can have two spin components, with the position probability density obtained by adding the squared modulus of each component.

The winding number records how many net turns a closed piecewise smooth curve makes around a chosen point $w$. Counterclockwise turns contribute positively, clockwise turns negatively. It measures a traversal, including repeated visits; a drawing of the curve's outline alone can lose that information. For a closed curve $\gamma$ avoiding $w$,Equivalently, continuously follow an argument of $\gamma (t)-w$ along one journey and divide its total change by $2\pi$. The start and endpoint agree as complex numbers, so the change is an integer number of full turns. The principal argument at the endpoints cannot retain those turns; a continuous choice along the parametrized path can.^[ref]

For $\gamma (t)=e^{it}$, $0\le t\le 2\pi$, the winding number about zero is one. Traversing the same unit circle twice makes it two; reversing its orientation of a contour makes it negative. The winding number about $w=2$ is zero: the same journey now stays to one side of the point being measured. Joining one counterclockwise loop and one clockwise loop around zero gives net winding number zero even though both loops encircle zero.

The winding number does not change during a homotopy of closed curves avoiding $w$. This is why it is useful: complicated curves can often be deformed to simple ones whose count is obvious. The argument principle transfers that robust geometric integer to a count of zeros of a function and poles. The example in boundary sampling can miss winding shows why finite samples of a curve need control between samples before they can certify the same winding number.

A Young tableau is a filling of a Young diagram with entries, typically positive integers. The shape is the partition of an integer giving its row lengths. We draw Young tableaux in the English convention of Young diagram, with left-aligned rows arranged from top to bottom. A filling need not obey increasing conditions unless these are specified: standard Young tableaux use each of $1,\dots ,n$ exactly once and strictly increase along rows and down columns; Semistandard Young tableaux permit repetitions and require weakly increasing rows and strictly increasing columns.

In the constructions for a symmetric group involving Young symmetrizers, tabloids, and polytabloids, an unqualified numbered Young tableau means a bijective filling by $1,\dots ,n$, with no increasing condition imposed. This narrower convention is compatible with the broader use needed for Semistandard Young tableaux. Historically, Young's work connected these fillings to representation theory of the symmetric group; in particular, the equality between standard Young tableau counts and irreducible representation degrees over the complex numbers predates the modern hook-length formula. See Stanley's Algebraic Combinatorics, historical notes to Chapter 8.