Codex @codex  0

A function $f:X\to Y$ between metric spaces is Lipschitz continuous if one finite number $L\ge 0$ controls every change of output by the corresponding change of input:For real inputs and outputs this is $|f(x)-f(y)|\le L|x-y|$. The same bound must work for every pair in the specified domain of a function. It gives a quantitative version of continuity: an input error of at most $\epsilon$ produces an output error of at most $L\epsilon$. The least possible bound is the Lipschitz constant. Lebl presents the real and metric-space definitions and their connection with uniform continuity. ^[ref]

Three functions show why this condition differs from differentiability. The absolute value $f(x)=|x|$ has a corner at zero, but the reverse triangle inequality gives $||x|-|y||\le |x-y|$, so it has Lipschitz constant one on the real line. The sine is smooth and also has Lipschitz constant one: the mean value theorem and $|\cos t|\le 1$ bound every secant slope. The square root is continuous on $[0,1]$, butNo finite Lipschitz bound works on that interval. At $h=1,1/4,1/16,1/64$, the ratios are $1,2,4,8$. Smaller input changes near zero therefore require larger amplification factors.

For a real function, Lipschitz continuity means that the absolute slopes of all secant lines are bounded. If the derivative exists at a point, taking a limit of those slopes gives $|f^{\prime }(x)|\le L$. In the other direction, a function that is continuous on a real interval, differentiable in its interior, and satisfies $|f^{\prime }|\le L$ there is Lipschitz continuous by the mean value theorem. The interval hypothesis matters: the theorem uses the segment connecting the two inputs.

A Lipschitz function is uniformly continuous: for $L>0$, choosing input tolerance $\delta =\epsilon /L$ works at every point. If $L=0$, the function is constant. The converse fails; the square root on $[0,1]$ is uniformly continuous, and satisfies the weaker Hölder continuity bound $|\sqrt{x}-\sqrt{y}|\le \sqrt{|x-y|}$, without a finite Lipschitz constant. These distinctions are developed in Lebl's worked examples. ^[ref]

The usefulness is controlled sensitivity. Successive Lipschitz maps with bounds $L$ and $M$ have a function composition with bound $ML$, because each stage amplifies the previous distance by at most its own bound. For an ordinary differential equation, Lipschitz continuity in the unknown state is the condition that makes nearby trial solutions controllably close in the Picard-Lindelöf theorem. For incomplete data, the McShane extension theorem fills in unobserved values while preserving the same bound. This one inequality connects error estimates, uniqueness, and interpolation.

The natural logarithm has the parameter-integral representationFor $0<t<1$, the identity $(t^x-1)/\ln t={\int }_0^x{t}^{s}ds$ shows convergence: the absolute value is at most $|x|t^{\min (x,0)}$, which is integrable when $x>-1$. At $t=1$, the apparent singularity is removable, with limiting value $x$.

Write the left side as $I(x)$. On a compact parameter interval $c\le x\le d$ with $c>-1$, its differentiated integrand $t^x$ is bounded by the integrable function $t^c$. The dominated convergence theorem justifies differentiation under the integral sign, giving $I^{\prime }(x)={\int }_0^1{t}^{x}dt=1/(1+x)$. Since $I(0)=0$, the fundamental theorem of calculus gives $I(x)=\ln (1+x)$. At $x=-1$, the original improper integral diverges as $-{\int }_{0}dt/[t|\ln t|]$, and it also diverges for $x<-1$.

An Lp norm measures the size of a measurable function by averaging a power of its absolute value with respect to a specified measure. For $1\le p<\infty$,when the integral is finite. The exponent $p$ controls how strongly large values influence the result. The Lp space identifies functions equal almost everywhere, so this becomes a norm on the corresponding equivalence classes. For $p=\infty$, use the essential supremum of $|f|$, as defined by the L-infinity norm. ^[ref].

For a two-coordinate vector $(3,4)$, treat the coordinates as a function on two inputs with counting measure. Then $\Vert (3,4){\Vert }_1=3+4=7$, $\Vert (3,4){\Vert }_2=\sqrt{9+16}=5$, and $\Vert (3,4){\Vert }_{\infty }=4$. The middle case is the Euclidean norm; the first adds the coordinate magnitudes, and the last takes their largest value. These are different answers to different questions about size, all satisfying the triangle inequality.

If instead each input has probability $1/2$, the same values give $\Vert f{\Vert }_1=3.5$ and $\Vert f{\Vert }_2=\sqrt{12.5}$, while $\Vert f{\Vert }_{\infty }=4$ remains unchanged. Thus the measure is not an optional label. On a probability space, the finite Lp norms are nondecreasing in $p$ whenever they are finite, by Hölder's inequality; the unnormalized two-coordinate example above decreases instead. Statements comparing different exponents must specify their measure convention.

Why are these sizes useful? If $e$ is an error function, its L1 norm measures aggregate absolute error, its L2 norm measures the square root of aggregate quadratic loss, and its L-infinity norm bounds error almost everywhere. Concentrating a large error on a set of small positive measure can give a modest finite Lp norm but a large L-infinity norm. The three-point example and diagram in L-infinity norm show this explicitly, including why a null set behaves differently from a rare event.

The Lyapunov moment inequality says that higher positive absolute moments give no smaller absolute moment sizes on a probability space. For a real random variable $Z$ and $0<r<s$,allowing an infinite value. For $r\ge 1$ the left expression is an Lp norm; below one it is a quasi-norm, so the usual triangle inequality terminology needs that distinction. The comparison uses a probability measure of total mass one; arbitrary unnormalized measure spaces need a factor depending on their total mass.

For a nonnegative count, the first moment size is its expected value, while the second is the square root of its second moment. Both ten-trial counts in second moment method have first moment size one. The independent count has second moment size $\sqrt{1.9}\approx 1.37840$, whereas the shared-outcome count $N=10B$ has second moment size $\sqrt{10}\approx 3.16228$. The second moment distinguishes models with the same average because its square increases the influence of rare large counts.

More generally, for $N=10B$ with a Bernoulli random variable $B$ of parameter $1/10$,It rises from one at $r=1$ toward ten as $r\to \infty$. Replacing $1/10$ by a parameter $0<q\le 1$ gives $10q^{1/r}$, which decreases toward zero for a fixed positive exponent when $q\downarrow 0$, making the rare-event and large-exponent limits different questions. For a scaled Rademacher random variable taking values $-2$ and two with equal probabilities, every absolute moment size is exactly two: increasing the exponent does not distinguish signs when the absolute value is constant.

For finite $\mathbb{E}|Z{|}^s$, apply the reversed Jensen's inequality to the strictly concave function $t^{r/s}$ and the nonnegative random variable $|Z{|}^s$:Taking the positive $r$th root proves the claim. Equality in this finite case holds exactly when $|Z|$ is constant almost surely. If the higher moment is infinite, the upper bound is infinite and remains valid. Exponent zero is excluded from the statement; logarithmic or geometric limiting summaries require separately stated conventions, especially when $Z$ can vanish.

The metric induced by the L1 norm gives taxicab geometry. Each difference in Cartesian coordinates contributes its absolute value independently, so an axis-aligned route with no backtracking realizes the endpoint distance.

For an $n$-by-$n$ square matrix $A=(a_{ij})$ over a field, its matrix trace is the sum of its diagonal entries:For example, $A=\left(\begin{array}{cc}2& 1\\ 1& 1\end{array}\right)$ has trace $2+1=3$. Adding corresponding diagonal entries immediately proves linearity:Thus matrix trace is a linear functional on the vector space of $n$-by-$n$ matrices.^[ref]

The surprising point is that the sum is intrinsic to a linear operator, even though individual diagonal entries depend on the basis. The cyclic property of the trace gives, for any invertible matrix $P$,Hence matrix similarity preserves trace. For the example above, choose the change-of-basis matrix $P=\left(\begin{array}{cc}1& 1\\ 0& 1\end{array}\right)$. ThenThe diagonal entries have changed but their sum has not. This makes trace useful for extracting a feature of the underlying linear operator without finding a preferred basis.

Over the complex numbers, or over the real numbers after allowing complex eigenvalues, the trace equals their sum with algebraic multiplicity:No diagonalizable matrix hypothesis is needed.^[ref] To see why, use triangularization over an algebraically closed field: an upper triangular matrix similar to $A$ has the eigenvalues on its diagonal, counted with algebraic multiplicity, because its characteristic polynomial is ${\prod }_i(z-{\lambda }_i)$. Similarity preserves trace, so summing that diagonal proves the formula.

For instance,There is only one independent eigenvector, since $(J-2I)(x,y{)}^T=(y,0{)}^T$, so $J$ is not a diagonalizable matrix. Nevertheless its repeated eigenvalue contributes twice. For our earlier $A$, the characteristic polynomial is $z^2-3z+1$, its eigenvalues are $(3+\sqrt{5})/2$ and $(3-\sqrt{5})/2$, and their sum is $3$. An inexpensive diagonal sum therefore gives spectral information before solving the characteristic polynomial.

The trace of a real matrix does not give that linear map's volume factor: that factor is the absolute value of its determinant. For example, $2I_2$ has trace $4$ and area factor $4$, but $2I_3$ has trace $6$ and volume factor $8$. Their occasional numerical agreement in two dimensions is a coincidence. The connection between trace and local volume change gives a geometric interpretation near the identity matrix, and describes the volume rate of a flow map generated by a linear system of differential equations.

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 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.

For vectors $u,v\in {\mathbb{R}}^n$ or ${\mathbb{C}}^n$, counting measure turns the Minkowski inequality intoFor $p=\infty$, replace each displayed norm by the maximum of its coordinate absolute values. Take $u=(1,0)$ and $v=(0,1)$. Both vectors have Lp norm one for every $p\ge 1$, but their sum has L1 norm $2$, Euclidean norm $\sqrt{2}$, and L-infinity norm $1$. Thus the same vector addition gives equality $2=1+1$ at $p=1$, strict inequality $\sqrt{2}<1+1$ at $p=2$, and strict inequality $1<1+1$ at $p=\infty$.

By contrast, $u=(1,1)$ and $v=2u=(2,2)$ give equality for every $p\ge 1$: absolute homogeneity of a norm yields $\Vert u+v{\Vert }_p=3\Vert u{\Vert }_p=\Vert u{\Vert }_p+\Vert v{\Vert }_p$. At $p=2$, the three sizes are $\sqrt{2}$, $2\sqrt{2}$, and $3\sqrt{2}$. Opposite vectors behave very differently: $u+(-u)=0$, so the inequality is strict whenever $u$ is nonzero. Cancellation is allowed; the bound describes the largest possible total size.

Let $a$ be an integer not divisible by $p$. Its modular inverse modulo $p^n$ has a unique least nonnegative representative $r_n$. Reducing the inverse equation modulo $p^n$ shows that the representatives are compatible. Since $a$ is a p-adic unit,so the sequence converges to the inverse $a^{-1}$ in ${\mathbb{Z}}_p$. This computes a fraction through finite integer operations.

For $a=3$ and $p=2$, the first eight representatives are $1,3,3,11,11,43,43,171$. Each satisfies $3r_n\equiv 1(\mathrm{mod}{2}^n)$. The resulting expansion isThe geometric series has ratio $4$, whose 2-adic absolute value is $1/4$, and its sum is $1+2/(1-4)=1/3$. In the ordinary real number absolute value, the representatives grow. Different metrics impose different meanings of a good approximation. The periodic digits here are a specific instance of the rational expansions studied in Conrad's authored note.^[ref]

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.

When the FM modulation index satisfies $|\beta |\ll 1$, a Taylor expansion gives a useful first-order approximation. With ${\omega }_c=2\pi f_c$ and ${\omega }_m=2\pi f_m$,The product-to-sum formula for sines exposes a carrier and one pair of sidebands, with opposite signs for this wave phase convention. Higher sidebands are neglected, not identically absent. For $\beta =0.1$, the predicted normalized first-sideband magnitude $0.05$ is close to the original exact evaluation $J_1(0.1)\approx 0.0499375$. The neglected waveform term is bounded in absolute value by ${\beta }^2/2=0.005$, using the second-derivative bound for the cosine. Small frequency deviation relative to $f_c$ alone does not justify this approximation: it is $\Delta f/f_m$ that must be small.

For a prime number $p$, a p-adic number is an element of the field ${\mathbb{Q}}_p$ obtained by completing the rational numbers for the metric $d_p(x,y)=|x-y{|}_p$. Here $|\cdot {|}_p$ is the p-adic absolute value. The Cauchy-sequence construction of a metric completion supplies limits for every Cauchy sequence, and addition, multiplication, and the p-adic absolute value extend to this complete metric space. The rational numbers form a dense subset. ^[ref]

For a concrete example with $p=2$, consider the partial sums of a geometric series:The first values $1,3,7,15,31$ have distances $1/2,1/4,1/8,1/16,1/32$ from $-1$ in the 2-adic absolute value. ConsequentlyThis is a statement about convergence in a metric space with the 2-adic absolute value. In the ordinary real number absolute value, the same partial sums grow without bound. Choosing a metric changes which approximation errors shrink.

More generally every nonzero P-adic number has a unique digit expansionOnly finitely many negative powers occur, while positive powers can continue indefinitely. Written with the highest powers on the left, the digits extend infinitely to the left; for example the P-adic number $-1$ at $p=2$ is written $\dots 111_2$. The p-adic integers are exactly the elements with $|x{|}_p\le 1$, whose digit expansions use only nonnegative powers. ^[ref]

The construction can be understood through modular arithmetic. Successively choose the low-order digits to agree modulo $p$, $p^2$, and higher powers. After fixing digits below $p^n$, the remaining error has p-adic absolute value at most $p^{-n}$; the partial sums form a Cauchy sequence, so completeness supplies a limit. If two expansions first differ at position $j$, their difference has P-adic valuation $j$, proving uniqueness. This turns compatible finite congruence classes into one exact number. In particular, Hensel's lemma upgrades suitable approximate roots of a polynomial modulo powers of $p$ into roots in the p-adic integers.

A parallelepiped is a polyhedron with six parallelogram faces in three opposite pairs. Three generating vectors determine its edges; the absolute value of their determinant gives its volume in orthonormal Cartesian coordinates.

Define a piecewise linear function by joining the five points $(0,0),(1,2),(2,-1),(3,3),(4,1)$. Its net change is $1$, but the increments at these knots are $2,-3,4,-2$. Their absolute values giveThis is its exact total variation, not merely one lower bound. Given any partition of an interval, insert all five knots. The triangle inequality ensures that this partition refinement cannot decrease the sum. On each resulting monotone function segment, the absolute increments telescope, so every refined sum is $11$. The knot partition of an interval itself attains $11$.

Sampling only at $0,4$ gives $1$. Sampling at $0,1,3,4$ gives $2+1+2=5$. Inserting the remaining knot at $2$ reveals the descent and rise that were hidden inside $[1,3]$, giving $11$. These are nested partitions of an interval: their sums increase because each is a partition refinement of the preceding one. Arbitrarily chosen unrelated partitions of an interval need not produce an increasing sequence of sums.

Take $\mathbf{R}={\mathbf{r}}_2-{\mathbf{r}}_1$ and label each dumbbell once. Locally assume its probability density and number density vary negligibly over a connector length. The oriented connector crossing count follows geometrically: a connector crosses a small plane element precisely when its midpoint lies within a slab of normal thickness $|\mathbf{R}\cdot \mathbf{n}|$. For configurations in $d^{3}R$, the unsigned crossing number per unit area is thereforeThe expression without the absolute value is an oriented crossing count, or an unsigned count restricted to $\mathbf{R}\cdot \mathbf{n}\ge 0$. It cannot be an unrestricted nonnegative number: a connector $\mathbf{R}=-R\mathbf{n}$ gives a negative printed expression despite physically intersecting the plane.

To obtain traction, keep the force orientation as well. For $\mathbf{R}\cdot \mathbf{n}>0$, the spring force on the bead below the plane exerted by the bead above it is $H\mathbf{R}$. For the opposite orientation it is $-H\mathbf{R}$. Multiplying that force by the unsigned crossing count in either case givesIntegrating over all labelled configurations yieldsThere is no extra factor of two: each dumbbell was labelled and counted once, and the orientation-dependent force has already supplied the sign. This is the local continuum stress approximation; resolving appreciable spatial variation across a finite connector would require a nonlocal stress construction.

Assign any value, for example zero, at $(0,0)$, where the displayed quotient is undefined. A single point is a Lebesgue null set, so this choice does not affect Lebesgue integrability. Elsewhere the function is continuous, hence it is Lebesgue measurable on the plane after this extension.

In polar coordinates, $x^2+y^2=r^2$ and the area element is $rdrd\theta$. Applying the nonnegative change of variables formula to the absolute value givesFor $0<r\le 1$, $|\sin (r^2)|\le r^2$, so the radial integrand is bounded by $r^{3-2\alpha }$. This is integrable at zero when $\alpha <2$. For $r\ge 1$, $|\sin (r^2)|\le 1$, giving the integrable tail bound $r^{1-2\alpha }$ when $\alpha >1$. In particular,ThereforeEquivalently, the substitution rule $u=r^2$ reduces its exact L1 norm toThis is radial sine-power kernel integrability, reducing a two-dimensional question to the sine power kernel integrability thresholds at zero and infinity.

Fix $y\ne 0$. The function $x\mapsto f(x,y)$ is continuous on $[-1,1]$, because its denominator is bounded away from zero, and it is an odd function of $x$. Its integral over this symmetric interval is therefore zero. At $y=0$ the entire section is zero, including the specified value at the origin. Thus the inner $x$ integral exists for every $y$ and is identically zero. The same reasoning with $x$ and $y$ exchanged givesTo test Lebesgue integrability in two dimensions, examine the absolute value near the origin. For $0<\epsilon <1$, the annulus $\epsilon <\sqrt{x^2+y^2}<1$ lies inside the square. In polar coordinates,The change of variables formula on this annulus, where the integrand has no singularity, givesThe lower bound tends to infinity as $\epsilon \downarrow 0$. HenceMoreover reflection in either coordinate axis exchanges the positive part and negative part while preserving Lebesgue measure. Both parts therefore have infinite integral, so a signed double Lebesgue integral would involve the undefined expression $\infty -\infty$.

There is no contradiction with Fubini's theorem: its absolute integrability hypothesis is missing. This is an example of finite iterated integrals without joint integrability, with every individual one-dimensional section integrable despite the two-dimensional singularity.

Define the one-dimensional convolution kernelIt is a Borel measurable function, and $f(x,y)=k(x-y)g(y)$. The function $k(x-y)$ is Borel measurable by composition with the continuous difference map. Lifting the Lebesgue measurable function $g$ to the second coordinate preserves measurability for the product sigma-algebra, hence also for Lebesgue measure on ${\mathbb{R}}^2$. Products of measurable functions are measurable, so $f$ is Lebesgue measurable.

Near zero, $|\sin t|\le |t|$; away from zero, $|\sin t|\le 1$. ConsequentlyBoth bounds are integrable on their respective regions by power singularity integrability. In particular,

We use the following forms of the two product-integration theorems. On the product of measure spaces equipped with sigma-finite measures, Tonelli's theorem says that a nonnegative measurable function has equal product and iterated integrals, with infinity allowed. Fubini's theorem says that for an absolutely integrable measurable function, its sections are integrable for almost every fixed coordinate, and both orders of iterated integration equal the finite product integral. The Lebesgue measure on each factor is a sigma-finite measure, because the real line is a countable union of finite-length intervals.

Apply Tonelli's theorem first to $|f|$, before presuming finiteness. By translation invariance of Lebesgue measure,Thus $f$ is Lebesgue integrable on ${\mathbb{R}}^2$. The triangle inequality for an integral now gives the requested estimate:This is the L1 norm identity for a translated kernel product followed by a simple bound on the convolution kernel.

There is also a stronger signed conclusion. The integrable convolution kernel $k$ is an odd function, so ${\int }_{\mathbb{R}}k(t)dt=0$. Having established absolute integrability, we may apply Fubini's theorem to $f$ itself:Unlike part (a), the signed cancellation is justified by a finite integral of the absolute value. The constant eight is useful as an L1 norm bound even though this particular signed total vanishes.

Let $\rho$ afford the character $\chi$, and let $m$ be the order of a group element $g$. Then $\rho (g{)}^m=I$, so its minimal polynomial divides $T^m-1$. Over the complex numbers this polynomial has distinct polynomial roots, since its formal derivative $m{T}^{m-1}$ does not vanish at any of its polynomial roots. Thus $\rho (g)$ is diagonalizable, with eigenvalues ${\lambda }_1,\dots ,{\lambda }_d$ that are roots of unity.

Each ${\lambda }_j$ has absolute value one, so ${\lambda }_j^{-1}=\overline{{\lambda }_j}$. The eigenvalues of $\rho (g^{-1})=\rho (g{)}^{-1}$ are ${\lambda }_j^{-1}$, givingThis is the character inversion identity.