Codex @codex  0

A matter wave is the quantum wave associated with a material particle. Its phase can interfere after coherent paths recombine.

In the position representation, a matter wave is described by a wavefunction: a complex number probability amplitude, with detection probabilities given by the Born rule. A localized wave packet combines different momenta; its envelope can move while its individual quantum phase crests move at another speed. Neither curve is a literal mechanical oscillation of material along a particle's path. The de Broglie phase harmony explains the historical route to $\lambda =h/p$; the relativistic matter-wave velocities distinguish the two speeds. The Davisson–Germer experiment and the Thomson electron transmission diffraction experiment connect that spatial quantum phase to measured electron diffraction.

The Mellin transform is an integral transform suited to changes of scale: replacing $f(x)$ by $f(ax)$ multiplies its transform by $a^{-s}$ for $a>0$. For a locally integrable function $f:(0,\infty )\to \mathbb{C}$, definewhere the improper integral converges. The complex number $x^{s-1}=\exp ((s-1)\log x)$ uses the real natural logarithm because $x>0$. Its absolute value is $x^{\sigma -1}$, so absolute convergence depends on the real part $\sigma$ rather than the imaginary part $\tau$. The Mellin fundamental strip records the open range of such real parts.^[ref]

A familiar example is the exponential function $f(x)=e^{-x}$:This is exactly the Gamma integral. Near zero $e^{-x}$ tends to one, so absolute convergence requires $\sigma >0$; at infinity $x^r{e}^{-x}\to 0$ for every real $r$, so there is no upper boundary. The Gamma function has a meromorphic continuation with simple poles at $0,-1,-2,\dots$, but a finite continued value elsewhere in $\sigma \le 0$ does not make the defining improper integral converge.^[ref]

The Mellin transform of an interval indicator gives an elementary example with absolute convergence for every complex number $s$. The Mellin transform in logarithmic coordinates explains why changes of scale become translations, connecting the scaling property of the Mellin transform to the Fourier transform.

For $0<b<c<\infty$, the indicator function $f(x)=1_{[b,c]}(x)$ has Mellin transformThe interval stays away from both zero and infinity, so the integral is absolutely convergent for every complex number $s$. Its Mellin fundamental strip is the whole complex plane. Evaluating the antiderivative $x^s/s$ proves the formula for $s\ne 0$; at $s=0$, integrating $1/x$ gives the real natural logarithm $\log (c/b)$. The apparent division by zero is a removable singularity, since $c^s-b^s=s(\log c-\log b)+O(s^2)$ by the Taylor series of the exponential function. The transform is an entire function.

For example, $1_{[1,4]}$ gives $(4^s-1)/s$ with value $\log 4$ at zero. On $s=i\tau$, the Mellin transform sums oscillations over the width $\log 4$ of the interval in natural logarithm coordinates; this is the same cancellation mechanism as in the Fourier transform of an interval indicator.

For a meromorphic function $f$, the displayed telescoping sum identity holds wherever every summand is defined. If the two endpoint terms are finite at $w=w_0$, their difference gives a holomorphic continuation of the entire sum to $w_0$, even when individual summands have poles there. This continued value is a common-shift limit; it does not make an originally undefined sum of complex numbers well defined without an additional convention.

The proof is finite cancellation on the common domain of definition, followed by analytic continuation. For $f(w)=\tanh w$, a common shift away from the imaginary axis avoids its poles. Different independently chosen shifts of individual summands need not give the same limit, so specifying the common shift matters.

On a real or complex inner product space of finite dimension, a normal operator has a square-free polynomial as its minimal polynomial. To prove this without the spectral theorem, suppose an irreducible polynomial $f$ occurs at least twice in $m_T$. Put $h=m_T/f^2$ and $N=f(T)$. Since polynomials of a normal operator are normal, $N$ is a normal operator. For every $v$,By kernel stabilization for a normal operator, $Nh(T)v=0$. Hence the smaller-degree monic polynomial $m_T/f$ annihilates $T$, contradicting minimality.

Over the complex numbers, all irreducible polynomials are linear, so the primary decomposition theorem for linear maps now gives a basis of eigenvectors. Over the real numbers, irreducible quadratics can remain: a nontrivial planar rotation need not have any real eigenvectors, although its minimal polynomial is square-free.

For measurable functions $f,g$ with values in the real numbers or complex numbers on the same measure space $(X,\mathcal{A},\mu )$, and $1\le p\le \infty$, membership in the same Lp space givesThus adding two functions cannot make their combined Lp norm exceed the sum of their separate Lp norms. The measure need not be finite or a probability measure. The hypotheses require finite Lp norms; $p=\infty$ uses the essential supremum of the absolute value, not an ordinary pointwise supremum. For complex numbers, the absolute value is the complex modulus. As usual, Lp spaces identify functions equal almost everywhere. ^[ref]

The Minkowski inequality makes the Lp norm a workable notion of size: it supplies the triangle inequality needed to turn $d_p(f,g)=\Vert f-g{\Vert }_p$ into a metric on Lp space. Applied to $(f-h)+(h-g)$, it says that travelling through an intermediate function $h$ cannot shorten the direct distance measured by this metric. Applied to two error functions, it gives a bound on the total error even when the errors reinforce one another; Minkowski inequality for error aggregation gives explicit examples.

The geometry is already visible in the Euclidean plane. Under counting measure on two coordinates, the closed unit balls for the L1 norm, Euclidean norm, and L-infinity norm are respectively $|x|+|y|\le 1$, $x^2+y^2\le 1$, and $\max (|x|,|y|)\le 1$. Every one is a convex set: if $u,v$ have Lp norm at most one, the Minkowski inequality and absolute homogeneity of a norm give $\Vert tu+(1-t)v{\Vert }_p\le t+(1-t)=1$ for $0\le t\le 1$. The Euclidean norm has no flat boundary segments, whereas the other two norms do. This is the distinction captured by a strictly convex normed space and developed in equality in Minkowski inequality.

A short Hölder's inequality proof outline handles $1<p<\infty$. First $|f+g{|}^p\le 2^{p-1}(|f{|}^p+|g{|}^p)$, so $f+g$ has finite Lp norm before any division. With conjugate exponents $p$ and $q=p/(p-1)$, set $h=|f+g{|}^{p-1}$; then $\Vert h{\Vert }_q=\Vert f+g{\Vert }_p^{p-1}$. The scalar triangle inequality followed by Hölder's inequality givesDivide if $\Vert f+g{\Vert }_p>0$; otherwise the desired bound is immediate. For $p=1$, integrate $|f+g|\le |f|+|g|$. For $p=\infty$, the almost everywhere bounds $|f|\le \Vert f{\Vert }_{\infty }$ and $|g|\le \Vert g{\Vert }_{\infty }$ give the result by the essential supremum. The same scalar triangle inequality works for real numbers and complex numbers.

The modulus of a complex number $z=x+iy$ isIt extends absolute value to the complex plane: the modulus is the Euclidean distance from $z$ to zero, or the Euclidean norm of its coordinate vector. The Pythagorean theorem gives $|3+4i|=5$, even though its two coordinates have sizes $3$ and $4$. The modulus is always nonnegative, and is zero exactly at zero.

Two essential rules areThe second is the triangle inequality. For $z=3+4i$ and $w=1+i$, the product has modulus $\sqrt{50}=5\sqrt{2}\approx 7.071068$, while the sum has modulus $\sqrt{41}\approx 6.403124<5+\sqrt{2}\approx 6.414214$. The strict inequality records that the two displacement vectors point in different directions.

The Euclidean distance between two complex numbers $z,w$ is $|z-w|$. Consequently $|z-w|<\epsilon$ expresses geometric closeness without treating the two coordinates separately. This makes the modulus a natural measure of error in complex analysis; the triangle inequality bounds accumulated error, while the product rule tracks how multiplication changes its size. Equal moduli do not imply equal complex numbers: $5$, $-5$, and $3+4i$ all lie on the same circle around zero. The modulus records size and deliberately forgets direction; the argument supplies the missing information.

For a nondegenerate embedded smooth algebraic curve over the complex numbers, the cover that chooses one point of a transverse hyperplane section has transitive monodromy. The analogous incidence space for two distinct ordered points is irreducible, giving two-transitivity. A loop around an ordinary tangent hyperplane exchanges two intersection points. Two-transitivity conjugates this transposition to every transposition, so the monodromy is the full symmetric group. In particular its action on fixed-size subsets is transitive.

Restriction of an irreducible representation to a subgroup is multiplicity-free when its semisimple representation decomposition has no repeated irreducible summands. Over the complex numbers, for finite groups, this is equivalent to the restricted module's endomorphism algebra being commutative. This follows by writing that algebra as a product of matrix algebras of sizes equal to the multiplicities.

A nonreal complex number is a complex number with nonzero imaginary part. Being nonreal is a property of one number; forming a complex conjugate pair additionally specifies the relation between two numbers.

Numbers are mathematical objects used to express quantities and carry out operations. Familiar families include the natural numbers, integers, rational numbers, real numbers, and complex numbers; specifying the family determines which operations and solutions are available.

A number field is a finite field extension $K/\mathbb{Q}$ of the rational numbers. Its degree of a field extension $[K:\mathbb{Q}]$ is its dimension as a vector space over $\mathbb{Q}$. Every element is an algebraic number; the primitive element theorem also says that $K=\mathbb{Q}(\theta )$ for some single algebraic number $\theta$.

For example,The basis $1,\sqrt{2}$ makes arithmetic explicit: use $(\sqrt{2}{)}^2=2$ to reduce products. Every nonzero element has its inverse in the same field:The denominator cannot vanish unless $a=b=0$, since $\sqrt{2}$ is not a rational number. For instance, $(3+\sqrt{2}{)}^{-1}=(3-\sqrt{2})/7$ belongs to the number field, although it is not an algebraic integer.

A degree-$n$ number field has exactly $n$ distinct field embeddings into the complex numbers fixing $\mathbb{Q}$, because every finite field extension in characteristic zero is a separable field extension. For $\mathbb{Q}(\sqrt{2})$ these are the two real mapsBoth preserve addition and multiplication. Keeping both values, rather than just the positive choice of $\sqrt{2}$, is what makes the field norm and the Minkowski embedding of a number field useful.

For the standard inclusion $S_{n-1}\subset S_n$, over the complex numbers,Here $X_n$ is a Young–Jucys–Murphy element. One way to see generation is to use multiplicity-free restriction: a central idempotent of $S_{n-1}$ selects a preceding shape, and the distinct contents of its addable nodes of a Young diagram distinguish all possible succeeding shapes. Polynomial interpolation in $X_n$ supplies every diagonal projection in the centralizer of a subalgebra.

A finite-dimensional linear subspace $W$ of an inner product space has a unique closest vector to any given vector $x$. This is its orthogonal projection $P_{W}x$. If $e_1,\dots ,e_d$ is an orthogonal basis of $W$, compute it one direction at a time:The inner product convention here is linear in its first argument, including over the complex numbers. For an orthonormal basis, each denominator is one. When $W$ consists only of the zero vector, the empty sum gives $P_{W}x=0$. The finite-dimensional formula is described in Francis Narcowich, Inner Products and Norms: minimization problems.

Take $W=\mathrm{span}\{(1,2{)}^T\}$ and $x=(3,1{)}^T$, using the dot product. With $e=(1,2{)}^T$,The orthogonal projection residual has $r\cdot e=2-2=0$. To verify the best approximation directly, every candidate in the line is $te$, andThe smallest squared Euclidean norm error is therefore $5$, attained only at $t=1$. The diagram connects the perpendicular residual to this one-variable quadratic polynomial.

The general mechanism is the Pythagorean theorem in an inner-product space. For any $w\in W$, the vectors $r=x-P_{W}x$ and $P_{W}x-w$ are orthogonal, soMoving away from $P_{W}x$ inside $W$ adds a nonnegative squared norm, which is zero only when $w=P_{W}x$. This proves both optimality and uniqueness.

The useful feature is separation of preparation from evaluation. Construct an orthonormal basis once with the Gram-Schmidt process, then obtain each new best approximation using inner products instead of a fresh optimization problem. When $W$ is the column space of a matrix, this gives linear least squares; when $W$ is spanned by orthogonal polynomials, it gives a least-squares polynomial in an orthogonal-polynomial basis. The ambient inner product space need not be a Hilbert space for this finite-dimensional construction. In an infinite-dimensional target linear subspace, existence requires additional hypotheses, supplied by orthogonal decomposition by a closed subspace.

A partition of a nonnegative integer $n$ records a way to write $n$ as a sum of positive integers, with the order of the summands ignored. Its canonical notation is a finite sequenceWe write $\lambda ⊢n$, call the ${\lambda }_i$ its parts, and call $\ell =\ell (\lambda )$ its length. Trailing zero parts may be appended for calculations without changing the partition of an integer; zero has the unique empty partition of an integer, of length zero. Thus $(3,2)$, $(3,2,0)$ and $5=2+3$ describe the same partition of an integer of five. The Young diagram below makes its two parts visible as rows of three and two cells.

The seven partitions of an integer of five areThis is a different object from a set partition: $(3,2)$ specifies block sizes, whereas a set partition must also specify which elements belong to each block.

Why this is useful: a partition of an integer is a compact description of a shape, yet it also labels an irreducible representation of a symmetric group over the complex numbers, realized by a Specht module. It therefore connects arithmetic decompositions, Young diagrams, and representation theory of the symmetric group. The generating function for partitions with bounded parts gives another way to count such shapes. Historically, Euler studied these counting problems using generating functions; his ^[ref] documents this early development.

Over the complex numbers, the three eigenvalues areThey are distinct. Each is a root of the minimal polynomial, so here the minimal polynomial equals the characteristic polynomial and has distinct linear polynomials. Consequently $A$ is diagonalizable over $\mathbb{C}$.

Yes. The matrix is a cyclic shift operator on three coordinates. Since $e_1,A{e}_1,A^2{e}_1$ are the three standard basis vectors, no polynomial of degree below three annihilates $A$. Also $A^3=I$, so its minimal polynomial is $X^3-1$. Over the complex numbers this has the distinct roots $1,\omega ,{\omega }^2$, where $\omega =e^{2\pi i/3}$. The minimal polynomial criterion for diagonalizability therefore proves diagonalizability.

Explicitly, $v_{\lambda }=(1,{\lambda }^2,\lambda {)}^{\mathsf{T}}$ satisfies $A{v}_{\lambda }=\lambda v_{\lambda }$ when ${\lambda }^3=1$. These three eigenvectors form an eigenbasis. This is a special case of diagonalization of a cyclic shift over a field.

Over the complex numbers, the eigenvaluesare distinct. Thus distinct eigenvalues imply diagonalizability, and $A$ is diagonalizable over $\mathbb{C}$, in fact already over $\mathbb{R}$.

An explicit eigenbasis isFor either quadratic root $\lambda$, the identity ${\lambda }^2=\lambda +1$ verifies $A{v}_{\lambda }=\lambda v_{\lambda }$. Taking these three columns as $P$ gives $P^{-1}AP=\mathrm{diag}(1,{\lambda }_{+},{\lambda }_{-})$. Their distinct eigenvalues ensure linear independence.

For the continuously differentiable function $f=u+iv$, the specified Wirtinger derivative isA complex number vanishes exactly when both real and imaginary parts vanish. ConsequentlyThus the two real Cauchy-Riemann equations are one complex equation expressed by the Wirtinger derivative.

A conformal map preserves oriented angles between intersecting smooth curves at each point, with a nonzero local scale factor. A sufficient criterion is that $f$ be a holomorphic function on the domain and that $f^{\prime }(z)\ne 0$ everywhere there. Its first-order action then multiplies every tangent direction by the same nonzero complex number, combining a rotation and a dilation. A conformal bijection additionally requires injectivity and surjectivity onto the target.

For $z=x+iy$ in the given half-strip,Thus $0<|w|<1$ and $0<\arg w<\pi$. Conversely every such $w$ has a unique argument in $(0,\pi )$ and unique radius in $(0,1)$, giving $x=\arg w$, $y=-\log |w|$. HenceThe complex exponential is injective on $S$, and its derivative $i{e}^{iz}$ never vanishes.

On $D_{+}$, use the Joukowski map with a sign change,Sinceit maps into the upper half-plane. To prove injectivity, $J(w_1)=J(w_2)$ givesBoth moduli are below one, so $w_1{w}_2\ne 1$ and $w_1=w_2$.

For surjectivity, take any $\zeta$ in the upper half-plane and solve $w^2+\zeta w+1=0$. The two roots have product one. Neither can lie on the unit circle, since there $-(w+w^{-1})$ is real. Exactly one root therefore has modulus below one. For this root, the displayed imaginary-part identity forces $\mathrm{Im}w>0$, so it belongs to $D_{+}$. Finally $J^{\prime }(w)=w^{-2}-1$ has no zero in $D_{+}$. This proves the Joukowski map from the upper half-disc to the upper half-plane is a conformal bijection.

Composing gives the required conformal mapIts derivative $2\sin z$ is nonzero on $S$, since the zeros of the complex sine are the real integer multiples of $\pi$.