Codex @codex  0

Suppose $X^2\equiv -1(\mathrm{mod}p)$. Then $X$ is a unit modulo n for modulus $p$, and Fermat's little theorem impliesSince $p$ is an odd prime number, $1$ and $-1$ are distinct residue classes. Therefore $(p-1)/2$ is even, and $p\equiv 1(\mathrm{mod}4)$.

Conversely, put $q=(p-1)/2$. Pair each integer $j\in \{1,\dots ,q\}$ with $p-j$ in the factorial. Wilson theorem yieldsWhen $p\equiv 1(\mathrm{mod}4)$, $q$ is even, so $X=q!$ satisfies $X^2\equiv -1(\mathrm{mod}p)$. This proves the first supplementary law for quadratic reciprocity without assuming a primitive root. HenceThe two solutions are $q!$ and $-q!$ modulo $p$: their difference is nonzero, and factoring $X^2-Y^2$ shows that a degree-two polynomial over the field of residues modulo $p$ has no further roots.

For $n\ge 2$, use the binomial coefficient identity $(n/k)\left(\genfrac{}{}{0ex}{}{n-1}{k-1}\right)=\left(\genfrac{}{}{0ex}{}{n}{k}\right)$. It reduces the left side to $\left(\genfrac{}{}{0ex}{}{n-1}{k-1}\right)(k/n{)}^{m-1}$. Put $t=(k-1)/(n-1)$. Then $k/n=((n-1)t+1)/n$, and the binomial theorem givesThus the required coefficients areFor $m=1$ the sum has the single coefficient $a_{n,1,0}=1$. For $k=1$, the power $t^0$ denotes the constant monomial $1$.

The original PDF allows $n=1$, but its displayed ratio $(k-1)/(n-1)$ is then $0/0$. Literally that expression is undefined. The meaningful endpoint identity is obtained before normalization:This polynomial identity is valid at $n=k=1$, giving $1$ on both sides. The normalized formula and the Bernstein monomial recurrence below are used only for $n\ge 2$.

For the constant monomial $f_0=1$, the binomial theorem gives $B_n(f_0)(x)=(x+1-x{)}^n=1$. For $f_1$, the binomial coefficient identity $k\left(\genfrac{}{}{0ex}{}{n}{k}\right)=n\left(\genfrac{}{}{0ex}{}{n-1}{k-1}\right)$ givesThus $\boxed{B_n(f_0)=1,B_n(f_1)=x}$, including $x=0,1$ by evaluation of the polynomials.

For $m\ge 1$ and $n\ge 2$, substitute the preceding coefficient identity into the Bernstein polynomial sum and write $j=k-1$. This yields the Bernstein monomial recurrenceThe coefficients are nonnegative and sum to $1$; $a_{n,m,0}=((n-1)/n{)}^{m-1}\to 1$ and the others tend to zero. The weights in any Bernstein polynomial sum are nonnegative and sum to $1$, so $0\le B_n(f_j)(x)\le 1$. Induction on $m$ therefore gives $B_n(f_m)(x)\to x{x}^{m-1}=x^m$: the $\ell =0$ term has that limit and the other finitely many terms vanish. In fact, the same estimate in the supremum norm proves uniform convergence on $[0,1]$.

As an independent quantitative bound, take a binomial distribution variable $K$ with parameters $(n,x)$. Then $B_n(f_m)(x)=\mathbb{E}[(K/n{)}^m]$. On $[0,1]$, factoring the difference of powers gives $|t^m-x^m|\le m|t-x|$; the Cauchy-Schwarz inequality and the variance of $K/n$ giveFor $m=0$ the error is exactly zero. Finally the requested sum equals $2^m{B}_{2n}(f_m)(1/2)$, so

The Lagrange cardinal polynomials areThus the Lagrange interpolation polynomial isIt has degree at most $n$ and takes the required values. Uniqueness follows because the difference of two such polynomials has $n+1$ distinct roots and degree at most $n$, so is zero. The source's phrase “degree $n$” must allow a smaller degree, for example when $f$ is constant.

Define the divided difference recursively by $f[x_i]=f_i$ andInduction on this recursion, or comparison of the leading coefficient in the Newton interpolation polynomial, givesFor completeness the induction works term by term: an interior term gets the coefficient $(1/(x_i-x_n)-1/(x_i-x_0))/(x_n-x_0)=1/((x_i-x_n)(x_i-x_0))$, multiplying the product over the other interior nodes; the two endpoint terms give the same formula. This is also the leading coefficient of $p$ directly from the cardinal formula, so $p^{(n)}=n!f[x_0,\dots ,x_n]$.

The function $f-p\in C^n[x_0,x_n]$ has $n+1$ distinct zeros. Repeated application of Rolle theorem gives $\xi \in (x_0,x_n)$ with $(f-p{)}^{(n)}(\xi )=0$ when $n\ge 1$. HenceFor $n=0$, this is simply $f[x_0]=f(x_0)$ and we take $\xi =x_0$.

Reducing coefficients modulo $p$ gives the ring isomorphismIf $d=\mathrm{deg}f>0$, its monic leading coefficient remains one modulo $p$, so $\mathrm{deg}\bar{f}=d$. Polynomial division gives a unique representative of degree less than $d$: existence follows by division, and the difference of two such representatives cannot be a nonzero multiple of a degree-$d$ monic polynomial. There are $p$ choices for each of the $d$ coefficients, provingIrreducibility of $\bar{f}$ is not needed for finiteness; without it the quotient ring need not be a field.

Write the Gaussian integer $\alpha =a+bi$, with $a,b\in \mathbb{Z}$, and set $R=\mathbb{Z}[\alpha ]$. Complex conjugation preserves $R$, because $\bar{\alpha }=2a-\alpha$. Choose a nonzero $\beta \in P$. Then $N=\beta \bar{\beta }$ is a positive integer in $P$. It cannot be one because $P$ is a proper prime ideal. Factoring $N$ into rational primes and applying primality repeatedly gives a prime $p\in P$.

The element $\alpha$ satisfies the monic polynomial $F(t)=t^2-2at+a^2+b^2$. Evaluation induces a ring homomorphism that is a surjectionThe source has $p^2$ elements by part (b), soIf $b=0$, use $F(t)=t-a$ instead and get at most $p$ elements. Moreover $R/P$ is an integral domain, so its finiteness makes it a field. This proves the finite residue-field theorem for Gaussian integer orders without incorrectly assuming that every Gaussian integer order is a principal ideal domain.

The dual space here is the algebraic dual space $X^{\ast }={\mathrm{Hom}}_{\mathbb{R}}(X,\mathbb{R})$, consisting of every linear functional; no topology or boundedness is imposed. For a basis $e_1,\dots ,e_n$, define $e_i^{\ast }({\sum }_j{x}_j{e}_j)=x_i$. These are linear functionals satisfying $e_i^{\ast }(e_j)={\delta }_{ij}$. Evaluating ${\sum }_i{a}_i{e}_i^{\ast }=0$ on each $e_j$ gives $a_j=0$, proving linear independence. Conversely, for every $T\in X^{\ast }$,This proves spanning and hence proves, without assuming a dimension theorem, that the dual basis is a basis and $\dim X^{\ast }=n$.

The canonical bidual evaluation map isIts definition makes no choice of basis and it is linear. If $x\ne 0$, one coordinate functional is nonzero on $x$, so $J$ is injective. For any $B\in X^{\ast \ast }$, choose $x={\sum }_{i}B(e_i^{\ast })e_i$. Expanding $T$ in the dual basis gives $T(x)={\sum }_{i}T(e_i)B(e_i^{\ast })=B(T)$, proving surjection explicitly. Thus $J$ is an isomorphism.

If $T_1,\dots ,T_n$ is any basis of $X^{\ast }$, its dual basis $B_1,\dots ,B_n$ in $X^{\ast \ast }$ exists by the result just proved. Put $v_j=J^{-1}(B_j)$. These vectors form a basis of $X$, and $T_i(v_j)=B_j(T_i)={\delta }_{ij}$. Every basis of the finite-dimensional dual is a dual basis, of a uniquely determined basis of $X$.

For a separating subspace of an algebraic dual $W$, choose a basis $T_1,\dots ,T_r$ of $W$. The linear map $x\mapsto (T_1(x),\dots ,T_r(x))$ is injective because $W$ separates nonzero vectors. The rank-nullity theorem implies $n\le r$; but $W\subseteq X^{\ast }$ implies $r\le n$. HenceThe zero-dimensional case also has this conclusion.

For $X=\mathbb{R}[x]$, the monomials $1,x,x^2,\dots$ form an infinite basis, each polynomial using only finitely many of them. The map $T\mapsto (T(1),T(x),T(x^2),\dots )$ identifies $X^{\ast }$ with all real sequences, because any sequence $(a_j)$ defines $T({\sum }_{j=0}^d{c}_j{x}^j)={\sum }_{j=0}^d{c}_j{a}_j$. The linear subspace of finitely supported sequences is proper (it excludes $(1,1,\dots )$) and separating (one coefficient functional detects any nonzero polynomial). Thus

The structure theorem for finitely generated modules over a principal ideal domain applies in particular to a Euclidean domain $R$: every finitely generated module has an isomorphismwith each $d_i$ nonzero and a nonunit. The rank of a free module $r$ and the invariant factors of a finitely generated module $d_i$ are unique up to multiplication by units; empty sums are allowed. This is the classification theorem being used, without a proof of that theorem.

The rational canonical form theorem states that for a linear operator $T$ on a finite-dimensional vector space over any field $F$, there are unique monic nonconstant polynomials $p_1\mid \cdots \mid p_k$ such that some basis givesHere, for $p(t)=t^d+a_{d-1}{t}^{d-1}+\cdots +a_0$, the companion matrix has ones on its subdiagonal and last column $(-a_0,\dots ,-a_{d-1}{)}^T$. The empty matrix covers a zero-dimensional space. Two linear operators have matrix similarity exactly when they have the same invariant factors of a linear operator.

For the proof, make $V$ an $F[t]$-module by $t\cdot v=T(v)$. It is a finitely generated module, since a vector-space basis also generates it as a module. It is a torsion module: the powers of $T$ have linear dependence in the finite-dimensional space ${\mathrm{End}}_F(V)$, so some nonzero polynomial annihilates every vector. Because $F[t]$ is a Euclidean domain, the classification theorem givesThere is no free summand, since a nonzero free module over $F[t]$ is not a torsion module. Choose monic generators of the ideals. On $F[t]/(p_i)$, the classes of $1,t,\dots ,t^{d_i-1}$ form an $F$-basis by polynomial division. Multiplication by $t$ is exactly $C(p_i)$ in that basis, proving existence. Uniqueness in the classification theorem proves uniqueness of the rational canonical form. Finally, an $F[t]$-module isomorphism is precisely an invertible $F$-linear map intertwining the operators, establishing the assertion about matrix similarity. In particular the characteristic polynomial is ${\prod }_i{p}_i$ and the minimal polynomial is $p_k$ for nonzero $V$.

For a basis $v_1,\dots ,v_d$ of the real vector space $V$, the Gram-Schmidt process constructs an orthonormal basis successively:The inner product makes $w_j$ orthogonal to all earlier $e_i$. Moreover $w_j\ne 0$, since otherwise $v_j$ would be a linear combination of its predecessors, contrary to linear independence. Induction gives $\mathrm{span}(e_1,\dots ,e_j)=\mathrm{span}(v_1,\dots ,v_j)$. Starting with a basis of a linear subspace $U$ and extending it to a basis of $V$ gives the same construction with the first $r=\dim U$ vectors spanning $U$.

The orthogonal complement is $U^{\perp }=\{v\in V:⟨v,u⟩=0\text{ for every }u\in U\}$. For every $v\in V$, set $u={\sum }_{i=1}^r⟨v,e_i⟩e_i$. Then $u\in U$ and $v-u\in U^{\perp }$. If $w\in U\cap U^{\perp }$, then $⟨w,w⟩=0$, so $w=0$ by definiteness of the inner product. Thus the direct sum isThis also covers $U=0$ and $U=V$.

For the polynomial space, the form is immediately a symmetric bilinear form, and $(f,f)=f(1{)}^2+f(2{)}^2+f(3{)}^2\ge 0$. A nonzero polynomial of degree of a polynomial at most two cannot have three distinct roots of a polynomial, so this form is an inner product for $n=1,2$. For $n\ge 3$, the nonzero polynomial $(x-1)(x-2)(x-3)$ has $(f,f)=0$. Therefore, among the stipulated positive integers,

This subpart is also present in the original PDF but missing from the local TeX. Put $p(x)=1-x^2$ and ${\lambda }_n=n(n+1)$. Multiply the Legendre differential equation for $P_n$ by $P_m$, multiply the equation for $P_m$ by $P_n$, and subtract. The product rule givesIntegrating from $-1$ to $1$, the boundary term vanishes: $p(\pm 1)=0$, and the Legendre polynomials and their derivatives are finite there. For distinct nonnegative integers $m,n$, ${\lambda }_m\ne {\lambda }_n$. Thus the Orthogonality of Legendre polynomials isThe vanishing coefficient at the endpoints causes no difficulty here because the solutions are polynomials.

The original PDF contains this subpart; the local TeX has omitted it. Write $a_n$ for the leading coefficient of $P_n$. The Legendre polynomial recurrence relation and the starting polynomials give $a_0=a_1=1$, and induction givesIndeed, $x{P}_n$ has degree of a polynomial $n+1$, while $P_{n-1}$ has smaller degree of a polynomial and cannot cancel its leading term. HenceAt $x=1$, the same linear recurrence relation gives $(n+1)P_{n+1}(1)=(2n+1)P_n(1)-n{P}_{n-1}(1)$. Starting from $P_0(1)=P_1(1)=1$, induction yields

Repeated integration by parts against a compactly supported test function gives the bilinear formal adjointThere is no boundary remainder because $v$ has compact support. The product rule makes this an order-at-most-$m$ linear differential operator with real analytic coefficients. The displayed integral pairing has no complex conjugation, so this is the formal transpose; for a sesquilinear pairing the coefficients would be conjugated.

For uniqueness, suppose $Q$ is the difference of two candidates. Then $\int uQv=0$ for every smooth compactly supported $u$ and $v$, so $Qv=0$ for every such $v$. At an interior point, a polynomial times a cutoff can prescribe every derivative of $v$ through order $m$ independently. Hence each coefficient of $Q$ is zero. This proves uniqueness as a differential operator, not only uniqueness of its integrated action.

The coordinate change has inverse $x=\tilde{x}-{\tilde{y}}^2+\epsilon$, $y=\tilde{y}$. Thus the coefficient function needed after changing variables isThe PDF's displayed formula has an undefined subscript $f_{\alpha }$ and writes the forward change in the argument. It is not the coefficient pullback by the stated coordinates; the inverse expression above is the one used in transforming the equation. The forward polynomial composition, if intended instead, has the same type of uniform bounds, but is not that pullback.

For $|(\tilde{x},\tilde{y})|\le 1/2$ and $0\le \epsilon \le 1/32$, the inverse image lies in the fixed compact subset specified by $|x|\le 25/32$, $|y|\le 1/2$, whose Euclidean radius is less than one. A real analytic function extends holomorphically to a complex neighborhood of this compact set: local extensions agree on overlaps by uniqueness, and a finite covering gives a common smaller neighborhood. The polynomial inverse maps a fixed small complex neighborhood of the closed half-ball into that neighborhood, uniformly in $\epsilon$. The extensions are bounded there by a common constant $A$. Applying the multivariable Cauchy estimate on equal-radius polydiscs givesThis is uniform analyticity under polynomial coordinate changes. The argument gives a compact margin and a common complex radius, not merely separate analyticity for each parameter.

In the flattened coordinates, ${\partial }_x={\partial }_{\tilde{x}}$ and ${\partial }_y=2\tilde{y}{\partial }_{\tilde{x}}+{\partial }_{\tilde{y}}$. The transformed formal adjoint consequently has coefficients obtained from finitely many real analytic coefficient pullbacks and polynomial factors. They have uniform analyticity bounds on a fixed small ball. By the preceding non-characteristic argument, its coefficient of ${\partial }_{\tilde{x}}^m$ has modulus bounded away from zero there, uniformly for small $\epsilon$. Division by it preserves uniform real analytic bounds.

The transformed forcing ${\tilde{g}}_{\epsilon }$ has analogous bounds, with constants that may depend on $g$. Apply the Cauchy-Kovalevskaya theorem in normal form with zero normal data through order $m-1$ at $\tilde{x}=0$. The supplied majorant series radius result yields a common solution radius $r_g>0$ for all sufficiently small parameters. Tangential differentiation of zero normal data shows that the entire boundary jet through order $m-1$ is zero; changing coordinates preserves this vanishing.

For $(x,y)$ in the closed cap, $|\tilde{x}|\le \epsilon$ and $|\tilde{y}|\le \sqrt{\epsilon }$. Choose $\epsilon$ so small that $\sqrt{{\epsilon }^2+\epsilon }<r_g$, with a strict margin. The whole closed cap then lies in the common real analytic solution neighborhood. Pulling the solution back provesIn fact $v$ is real analytic on a neighborhood of its closure, which is useful for the boundary integration below.

Fix the coefficient normal form and a positive analyticity exponent ${\zeta }_0$ once and for all. If $g$ is a polynomial, its pullback ${\tilde{g}}_{\epsilon }=g(\tilde{x}-{\tilde{y}}^2+\epsilon ,\tilde{y})$ is again a polynomial, with degree bounded independently of $\epsilon$. On a fixed closed coordinate ball, its finitely many nonzero derivatives are uniformly bounded as the parameter ranges over a fixed compact small interval. Hence there is a finite $A_g\ge 1$ such thatAll higher derivatives vanish, so arbitrarily high polynomial degree causes no failure of this bound; it only changes $A_g$.

The normalized forcing belongs to one common majorant class. The Cauchy-Kovalevskaya theorem therefore gives a radius $r_{\ast }>0$ independent of $g$. The problem is linear with zero data, so multiplying the normalized solution by $A_g$ solves the original forcing without changing its radius. Choose one $\epsilon$ with the cap inside this radius. ThusThis is the uniform Cauchy radius for polynomial forcing. It asserts a common domain, not a uniform solution-amplitude bound over all polynomials.