Codex @codex  0

Real analysis studies limits, continuity, differentiation, integration, and convergence of sequences and functions taking values in the real numbers. Its central question is how finite approximations determine an exact answer: what does an arbitrarily small error mean, and which operations respect that error? A derivative is a limit of quotients, while a Riemann integral is obtained from increasingly fine Riemann sums. Both need conditions that make the answer independent of the approximations chosen.

Two organizing ideas are completeness of the real numbers, which ensures that suitable approximations have a destination, and uniform convergence, which controls approximation error over an entire domain. Pointwise convergence supplies separate guarantees at separate inputs; uniform convergence supplies one guarantee for all inputs. This distinction explains why replacing an approximating function by its limit can preserve continuity or integrals under appropriate hypotheses, yet fail without them.

For historical context, Cauchy's 1821 Cours d'analyse explicitly discusses convergence of series. Its Note VII treats double series and compares summing by rows and by columns under stated convergence assumptions: controlling an infinite process was already a concrete problem. This is historical context for questions about limits, rather than an attribution of the modern definitions below. ^[ref].

The real axis consists of the points of the complex plane whose imaginary part is zero. These points represent the real numbers.

A real-linear map is a linear map over the real numbers. For a map from the real line to itself, real linearity means multiplication by a fixed real number, its value at one. Rational-linear maps need not be real-linear without an additional regularity condition.

A real matrix is a matrix whose entries are real numbers. The vector space of $m\times n$ real matrices is denoted $M_{m,n}(\mathbb{R})$.

The real case of the finite-dimensional spectral theorem says that a self-adjoint operator on a finite-dimensional real inner product space has a real orthonormal eigenbasis. In orthonormal coordinates this is the spectral theorem for real symmetric matrices, $A=Q\Lambda Q^T$. The worked ellipse under finite-dimensional spectral theorem shows why both orthogonal diagonalization and orthogonality matter: the new coordinates separate the quadratic form into squares without distorting lengths or angles.

A real normal matrix need not have real eigenvalues. For example, the quarter-turn $\left(\begin{array}{cc}0& -1\\ 1& 0\end{array}\right)$ is an orthogonal matrix, but its characteristic polynomial is $z^2+1$ and its eigenvalues are $i,-i$. Over the complex numbers it has an orthonormal eigenbasis; over the real numbers it has no eigenvector. Self-adjointness supplies the reality conclusion in the real spectral theorem.

A character is real-valued when all its values are real numbers, equivalently $\chi =\overline{\chi }$. By the character inversion identity, this is equivalent to $\chi (g)=\chi (g^{-1})$ for every $g$. This condition alone does not assert that the underlying complex representation can be realized by real matrices.

A real-valued function has codomain contained in the real numbers.

A real vector space is a vector space over the field $\mathbb{R}$ of real numbers.

On $[0,1]$, use reduced representations of rational numbers with positive denominator. This reverses the nonzero values of the Thomae function, while leaving its values at irrational numbers zero. Every interval of positive length contains rational numbers of arbitrarily large reduced denominator: there are only finitely many fractions in $[0,1]$ with denominator at most a fixed $M$, whereas any open interval contains infinitely many rational numbers. Thus this function taking finite real number values is unbounded on every nondegenerate subinterval.

Representation theory describes abstract symmetries by linear maps on vector spaces. A group representation assigns an invertible linear map to each group element, respecting multiplication. The payoff is that a symmetry problem becomes a problem about matrices, invariant subspaces, and eigenvalues. Decomposing the action can reveal combinations of variables that a symmetric system cannot mix.

Take the cyclic group $C_3=\{e,g,g^2\}$, with $g^3=e$. On three real coordinates, let $g$ send $(a,b,c)$ to $(c,a,b)$:This permutation representation does more than relabel a list: it acts linearly on every possible assignment of values to the three positions. The vector $(1,1,1)$ stays fixed. The vector subspace $W=\{(a,b,c):a+b+c=0\}$ is also preserved, since a permutation does not change the sum.

Every vector separates uniquely into these two types:For example, $(4,1,1)=2(1,1,1)+(2,-1,-1)$. The first term belongs to a trivial representation; the second is a contrast with zero coordinate sum. This is a direct sum decomposition ${\mathbb{R}}^3=\mathbb{R}(1,1,1)\oplus W$. The symmetry preserves the mean and rotates the contrasts.

The rotation is literal after choosing the orthonormal basis $u=(2,-1,-1)/\sqrt{6}$, $v=(0,1,-1)/\sqrt{2}$ of $W$. In this basis,It is a rotation through $120$ degrees, and three applications return to the starting point. There is no nonzero invariant real line, because this rotation has no real eigenvector. Thus the two-dimensional action is an irreducible representation over the real numbers. Over the complex numbers it instead splits into two eigenlines with eigenvalues $e^{2\pi i/3}$ and $e^{-2\pi i/3}$. The coefficient field is part of an irreducibility claim.

Why would this decomposition matter for a physical calculation? Consider three equal masses with scalar displacements $x_i$ and the symmetric quadratic coupling energyThe equations of motion are $m\ddot{x}=-kLx$, whereis a graph Laplacian and $J$ is the all-ones matrix. The constant vector has eigenvalue zero: translating all coordinates equally costs no coupling energy. On $W$, $J$ vanishes and $L=3I$, so both independent contrast directions have angular frequency $\sqrt{3k/m}$. A three-coordinate coupled problem reduces to a free mean and two identical harmonic oscillators.

For initial displacement $x(0)=(4,1,1)$ and initial velocity zero, the exact solution is $x(t)=2(1,1,1)+\cos (\sqrt{3k/m}t)(2,-1,-1)$. The fixed mean and oscillating contrast can be read directly from the decomposition. More generally, a linear operator commuting with the group action carries its fixed-vector subspace into itself; with an invariant inner product, it preserves the corresponding orthogonal complement too.

For a finite group, averaging over the action constructs an invariant inner product over the real numbers or complex numbers. The resulting invariant complements explain Maschke's theorem: a finite-dimensional group representation decomposes into irreducible representations. Characters compress the action into traces and help identify those pieces. The assumptions matter; in modular representation theory the coefficient field can have characteristic dividing the group order, and such decompositions can fail. Chapter 4 of Pavel Etingof and coauthors' notes develops these mechanisms. ^[ref].

For finitely many fixed nonnegative real numbers $b_1,\dots ,b_m$, with $m\ge 1$,Let $M$ be that maximum. If $M=0$, every term is zero. Otherwise $M^p\le \sum b_j^p\le m{M}^p$ for $p>0$. Taking roots gives $M\le (\sum b_j^p{)}^{1/p}\le m^{1/p}M$, and $m^{1/p}\to 1$. The squeeze theorem proves the result, including ties between the largest bases. For example, $(1+a^p+(a^2/2{)}^p{)}^{1/p}$ tends to $\max (1,a,a^2/2)$ for $a\ge 0$. The finiteness and fixed number of terms supply the upper factor $m$; an infinite sum needs further hypotheses.

A root of a polynomial $f$ is a scalar $a$ satisfying $f(a)=0$ in the chosen field or ring. For $p(X)=(X+1)(X-2{)}^2$ over the real numbers, the distinct roots of a polynomial are $-1$ and $2$. The second has multiplicity of a root two, so there are three roots when counted with multiplicity.

The domain matters. $X^2+1$ has no real polynomial root, but has the two complex number roots $i,-i$. The fundamental theorem of algebra guarantees a polynomial root in the complex numbers for every nonconstant complex polynomial, and complete factorization counts its degree of a polynomial many roots with multiplicity of a root. It does not promise that those roots are real or that they have a simple expression.

Setting $a(x-h{)}^2+k=0$ gives $(x-h{)}^2=-k/a$. A positive $-k/a$ gives two distinct roots of a polynomial in the real numbers; zero gives a repeated root of a polynomial at $h$; a negative value gives a pair of complex conjugate roots of a polynomial. For the downward-opening example, the two roots of a polynomial are $2\pm \sqrt{3/2}$, approximately $0.775255$ and $3.224745$.

The discriminant $\Delta =b^2-4ac$ packages the same calculation, becauseSince $4a^2>0$, the sign of $\Delta$ determines which of the three cases occurs. This derives the quadratic formula by a polynomial identity, and explains its structure: first shift to $h$, then take a square root. For the upward-opening example, $(x+3{)}^2=-4$ gives the complex conjugate roots of a polynomial $-3\pm 2i$.

Work over the rational numbers, allowing unknowns in the real numbers when interpreting the geometry. Consider four equations in three unknowns:The third row of $A$ is the sum of its first two rows, and the fourth is their difference, second minus first. The same relations must hold on the right: consistency requires $\tau =1+4=5$ and $3=4-1$. The latter condition already holds. Gaussian elimination makes this compatibility test explicit while exposing the remaining freedom.

Apply the elementary row operations in this order, using each row's current value:then $R_3\leftarrow R_3-R_2$ and $R_4\leftarrow R_4-R_2$. The resulting augmented matrix is in row echelon form for every $\tau$:When $\tau \ne 5$, the third row has its pivot element in the augmented column. It says $0=\tau -5$, so the linear system has no solution. When $\tau =5$, that entire row vanishes and only two pivot elements remain. More equations than unknowns therefore do not force a unique solution: some equations may repeat information.

The final operation $R_1\leftarrow R_1-2R_2$ reduces the coefficient block toThe product of all six elementary matrices isDirect matrix multiplication verifies both displayed transformations. Its determinant is one, so this transformation is reversible. In particular, the third row of $E$ extracts the discrepancy between the third equation and the sum of the first two.

For $\tau =5$, $[R\mid Eb]$ is the reduced row echelon form of the full augmented matrix. For $\tau \ne 5$, only its coefficient block is reduced: scale the third row by $1/(\tau -5)$ and clear the entries above its augmented pivot element. The full reduced row echelon form is thenThe last column is part of the matrix when testing the echelon conditions. Calling $[R\mid Eb]$ fully reduced before clearing that column would miss this distinction.

A scalar-valued function is a function whose codomain is a field, typically the real numbers or complex numbers. Its output is a single scalar, while its input can belong to an arbitrary set. For example, the square of the norm of a vector is real-valued. In a relativistic application, being scalar-valued alone does not establish Lorentz invariance: the transformation of the input and of the complete quantity must also be specified.

A sesquilinear form on a complex vector space $V$ is a map $B:V\times V\to \mathbb{C}$ which, with the convention used throughout this article, is a linear map in its first argument and a conjugate-linear map in its second. For vectors $u,v,w$ and complex numbers $\alpha ,\beta$, the defining identities areThe bars denote complex conjugation. No symmetry or positivity is required. Some authors choose the opposite convention; every formula here keeps the first argument linear.^[ref]

For a basis $e_1,\dots ,e_n$ of a finite-dimensional vector space, write $u={\sum }_i{x}_i{e}_i$, $v={\sum }_j{y}_j{e}_j$, and $A_{ij}=B(e_i,e_j)$. Expanding by the two identities givesEvery complex matrix $A$ gives a sesquilinear form this way. The superscript $T$ means transpose, not conjugate transpose. Equivalently, the scalar is $y^{\ast }{A}^{T}x$, where $y^{\ast }={\overline{y}}^T$. This is the convention used for the matrix of a Hermitian form when symmetry is imposed. The coordinate formula follows directly by expanding the basis coefficients.^[ref]

For a concrete example on ${\mathbb{C}}^2$, let $B(z,w)=z_1\overline{w_2}$. Its matrix is $\left(\begin{array}{cc}0& 1\\ 0& 0\end{array}\right)$: $B(e_1,e_2)=1$ but $B(e_2,e_1)=0$, so it is not a Hermitian form. Also $B((1,i),(1,i))=-i$, so even real diagonal values cannot be assumed for an arbitrary sesquilinear form. By comparison, the bilinear form $F(z,w)=z_1{w}_1+z_2{w}_2$ satisfies $F(iz,w)=F(z,iw)=iF(z,w)$ and has $F((i,0),(i,0))=-1$; it cannot supply positive squared lengths on this complex vector space.

The effect of changing the complex argument of a multiplier is particularly revealing. For real numbers $\theta ,\varphi$, sesquilinear forms satisfyThus a common change of complex argument cancels from the diagonal, whereas the two arguments rotate the output in opposite directions. Conjugating one argument is what replaces the ${\alpha }^2$ scaling of a bilinear form by the nonnegative $|\alpha {|}^2$ scaling needed for a Hermitian inner product. This mechanism also works in function spaces: for complex continuous functions on $[0,1]$, $B(f,g)={\int }_0^{1}f(t)\overline{g(t)}dt$ obeys the same identities, letting integration measure overlap rather than merely multiply coefficients.

An uncountable subset $S$ of the real numbers whose intersection with every null set for Lebesgue measure is countable. Testing only Borel sets suffices because every Lebesgue-null set has a Borel null superset. No measurability of $S$ is assumed.

A sigma-algebra on a set $\Omega$ is a collection $\mathcal{F}$ of subsets such that $\Omega \in \mathcal{F}$, $A\in \mathcal{F}$ implies $\Omega \setminus A\in \mathcal{F}$, and $A_n\in \mathcal{F}$ for all $n$ implies ${\bigcup }_n{A}_n\in \mathcal{F}$. Thus it contains the empty set and is closed under countable intersections as well. This is precisely the closure needed to apply countable additivity without leaving the domain of a measure.

For $\Omega =\{a,b,c\}$,is a sigma-algebra. It describes observations that distinguish $a$ from the pair $\{b,c\}$, but cannot distinguish $b$ from $c$. The power set provides a finer sigma-algebra with all eight subsets. Both are valid; choosing a sigma-algebra records which questions the model can answer.

On the real numbers, the Borel sigma-algebra contains all open sets and everything generated from them by these operations. The Lebesgue measurable sets form a larger sigma-algebra, including all subsets of Borel null sets. Closure under countable unions accommodates constructions involving an entire sequence of observations or approximations.

A simple bivector can be expressed as one exterior product of two vectors. Changing the pair need not change its area element: $u\wedge (v+cu)=u\wedge v$ for every scalar $c$, by bilinearity and $u\wedge u=0$. This operation shears the represented parallelogram while preserving its oriented area.

Every bivector in a real vector space of dimension at most three is simple, but this fails in dimension four. For an ordered basis $e_1,\dots ,e_4$, considerThe two components describe independent coordinate planes. Their square iswhereas $(u\wedge v)\wedge (u\wedge v)=0$ because the factors repeat. Thus this $B$ cannot be one simple bivector. Over the real numbers in dimension four, the converse also holds: a nonzero bivector with $B\wedge B=0$ is simple. The nonzero factor two is important; that criterion cannot be applied unchanged in characteristic two.

A real number is simply normal in base $K$ if each individual digit in its positional notation has limiting digit block frequency $1/K$. This is the length-one part of the definition of a normal number. It places no equal-frequency requirement on longer words.

For example, $x=0.010101{\dots }_2=1/3$ is a simply normal number in base two: each binary digit has frequency $1/2$. But $00$ and $11$ never occur, and $01$ and $10$ each have frequency $1/2$. Thus $x$ is not a normal number in base two. Even a sequence that looks more complicated, such as the deterministic Thue–Morse sequence, must be tested against the actual digit block frequency definition; visual complexity is no substitute for it.

The decimal representation $y=0.01234567890123456789\dots$ makes the same point in base ten. Every digit has frequency $1/10$, yet the only adjacent pairs areEach has limiting digit block frequency $1/10$; the other ninety pairs have frequency zero. A normal number in base ten requires $1/100$ for every one of the hundred pairs. This rational number is a simply normal number in base ten, but it is not a normal number in that base.