Codex @codex  0

Let the Bravais lattice have primitive vectors $a_1,a_2,a_3$, and putThe reciprocal lattice has the basisThe scalar triple product and cross product identities giveConsequently every $q={\sum }_j{n}_j{b}_j$ satisfies $q\cdot l\in 2\pi \mathbb{Z}$ for every lattice point $l={\sum }_i{m}_i{a}_i$, and conversely these three conditions force the coefficients of $q$ in the reciprocal basis to be integers. This proves that the displayed vectors generate ${\Lambda }^{\ast }$.

In the Born approximation, suppose that the crystal potential is the sum of translates of one atomic potential $V_0$ over the finite set $S$ of lattice sites. Its Fourier transform at the momentum transfer $Q=k-k^{\prime }$ factors asThus the single-atom scattering amplitude is multiplied by the crystal lattice structure factor $\Delta (Q)$. Writingseparates the sum into three finite geometric series. For $l_i=-L_i/2,\dots ,L_i/2$ this givesWhen the $L_i$ are large, a factor has a sharp maximum when ${\alpha }_i=2\pi n_i$. All three factors are therefore simultaneously large precisely when $Q\in {\Lambda }^{\ast }$. These are the reciprocal-lattice peaks of a finite crystal.

For the stated body-centered cubic lattice basis,the reciprocal-basis formula givesEquivalently,The shortest nonzero reciprocal vectors have squared Euclidean norm $2(2\pi /a{)}^2$, so

In elastic scattering, $|k|=|k^{\prime }|=k$. If $q=k-k^{\prime }\in {\Lambda }^{\ast }$ and $\theta$ is the angle between $k$ and $k^{\prime }$, Euclidean geometry givesThe first possible diffraction peak therefore occurs atas $ka\to \infty$, by the small-angle approximation. This is the elastic Bragg scattering condition for the shortest reciprocal-lattice vector.

The $[SU(3){]}^{2}U(1)$ condition gives $u+d=2q$, which is even because all hypercharges are integers. The sum $u+d$ and difference $u-d$ have the same parity, so $u-d$ is even. ThereforeSolving the sum and difference equations gives

Consider the $N+1$ fractional partsin $[0,1)$. Divide that interval into $N$ intervals of length $1/N$. By the pigeonhole principle, two fractional parts, say those indexed by $i<j$, lie in the same interval. Thus, for some integer $p$,Set $q=j-i$. Then $1\le q\le N$, and division by $q$ gives the Dirichlet approximation theorem

Choose a number field $L$ containing ${\alpha }_1,\dots ,{\alpha }_k$. At every place $v$ of $L$, putThe triangle inequality giveswhere $c_v=1$ at every non-Archimedean place because the coefficients are integers, while at an Archimedean place one may takeRaise these inequalities to the local weights and multiply over all places. The definition of the Absolute multiplicative Weil height and the product formula then giveThis is the height bound for a polynomial evaluation.

Let $f$ be the monic cubic minimal polynomial of the algebraic integer $\alpha$, let ${\alpha }_1=\alpha ,{\alpha }_2,{\alpha }_3$ be its conjugates, and let ${\beta }_1=\beta ,{\beta }_2$ be the two conjugates of a nonrational $\beta \in {\mathcal{O}}_K$. Because the degrees three and two are coprime, the fields are linearly disjoint, andis a nonzero integer.

AssumeFor large $H(\beta )$ this makes ${\beta }_1$ bounded. Since $\beta$ is a quadratic algebraic integer, the height-Mahler measure formula givesand therefore $|{\beta }_2|\asymp H(\beta {)}^2$. The two remaining factors with $j=1$ are bounded, while the three factors with $j=2$ are $O(|{\beta }_2|)$. Consequently

We now use the standard effective norm form consequence of Part (b). Forwhere $1,\omega$ is an integral basis of $K$, the effective norm-form height estimate supplies effective constants $A,C>0$, depending only on $\alpha$ and $K$, such thatfor every nonzero $z\in V\cap {\mathcal{O}}_L$. Its proof factors $(z)$, balances a generator using the Dirichlet unit theorem, and applies the Baker lower bound for a homogeneous linear form in logarithms to the linear relations defining $V$; the coprime degrees $3$ and $2$ exclude a unit-family degeneracy.

Apply this estimate to $z=\alpha -\beta$. Since $\beta =\alpha -z$, the height inequalities imply $H(\beta )\le 2H(\alpha )H(z)$. HenceChoose the effective value $\epsilon =1/(2A)$. The last inequality bounds $H(\beta )$ effectively. The rational integers $\beta \in \mathbb{Z}$ are already covered by the stronger degree-three Liouville approximation theorem, and the Northcott theorem leaves only finitely many remaining quadratic integers of bounded height. Taking the minimum ofover this effective finite set gives an effective $c>0$ and provesfor every $\beta \in {\mathcal{O}}_K$.

Put $u=c^{-1}-1>0$, so $c=(1+u{)}^{-1}$. By Bernoulli's inequality, $(1+u{)}^n\ge 1+nu$, and henceMore explicitly, for $\epsilon >0$ choose an integer $N>1/(u\epsilon )$. For $n\ge N$, the right-hand side is less than $\epsilon$. Thus the geometric sequence has limit of a sequence zero, either directly by the definition or by the squeeze theorem.

Use the ceiling function to choose positive integer coefficientsBecause $0<\alpha <1$, we have ${\alpha }^{-n}\ge 1$ andFor $|z|<\alpha$, the comparison test for series with the geometric series givesFor $|z|\ge \alpha$, we instead have $|a_n{z}^n|\ge (|z|/\alpha {)}^n\ge 1$, so the terms do not tend to zero. Thus the power series has radius of convergence exactly $\alpha$.

All three examples below have positive integer coefficients, so they work under either convention for whether $0\in \mathbb{N}$.

For $R=1$, take $\boxed{a_n=1}$. This is the geometric series: it converges for $|z|<1$, and its terms fail to tend to zero for $|z|\ge 1$.

For $R=0$, take $\boxed{a_n=n!}$, using the factorial and $0!=1$. For every fixed $z\ne 0$, the absolute values of successive terms have ratio $(n+1)|z|$. This eventually exceeds two, so the terms grow without bound and the series cannot converge. At $z=0$ it is finite, giving radius of convergence zero.

For $R=1/\sqrt{2}$, takeusing the floor function. The coefficients satisfyThe upper bound and the comparison test for series give absolute convergence when $\sqrt{2}|z|<1$. The lower bound prevents the terms tending to zero when $\sqrt{2}|z|\ge 1$. Hence the radius of convergence is exactly $1/\sqrt{2}$.

Choose the unbounded function $\boxed{g(x)=1/x}$ on $E=(0,1/2]$. It is unbounded because $g(1/k)=k$ for all integers $k\ge 2$. For each $x\in E$, the geometric series gives the sum and its remainder after degree $N$:Since $0<x\le 1/2$,This proves uniform convergence. Although the first term $1/x$ and the sum are unbounded, the late tails have a bound tending to zero independently of $x$. Uniform convergence concerns those tails and does not require the individual functions to be bounded.

At any division step $u=qv+r$, an integer divides both $u,v$ exactly when it divides both $v,r$: one direction uses $r=u-qv$, and the other uses $u=qv+r$. HenceStarting with $r_0=a$, $r_1=b$, the Euclidean division producesThe nonzero remainders form a strictly decreasing sequence of positive integers. Such a sequence must terminate, since there are only finitely many positive integers below $b$. Suppose $r_N$ is the last nonzero remainder, so $r_{N+1}=0$. The unchanged greatest common divisor at each step givesThe final equality holds because the positive common divisors of $r_N$ and $0$ are precisely the positive divisors of $r_N$. This proves both termination and correctness of the Euclidean algorithm.

First recall why the two-variable Bézout's identity follows from the Euclidean algorithm. The initial values $a,b$ are integer linear combinations of $a,b$. At every subsequent step, $r_{j+1}=r_{j-1}-q_j{r}_j$ is again an integer linear combination of $a,b$. Therefore the last nonzero remainder, which is their greatest common divisor, has that form.

Put $e=\gcd (a,b)$. The preceding argument supplies integers $u,v$ with $e=au+bv$. Applying the same argument to $e,c$ gives integers $p,q$ such thatAn integer divides $a,b,c$ exactly when it divides $e,c$: if it divides $a,b$, it divides $e=au+bv$, while $e$ itself divides both $a,b$. Hence $\gcd (e,c)=\gcd (a,b,c)=d$. Substituting the expression for $e$ provesThusare integers satisfying $ax+by+cz=d$. This also explains how to construct the coefficients using two applications of the Euclidean algorithm.

For separation of variables, set $u=X(x)Y(y)$, with $X^{\prime \prime }/X=-Y^{\prime \prime }/Y=-\lambda$. The side Neumann boundary conditions give $X^{\prime }(0)=X^{\prime }(\pi )=0$. As in the standard Sturm-Liouville problem, integration by parts shows $\lambda \ge 0$. The zero eigenvalue gives constant $X$, and $Y^{\prime \prime }=0$ together with $Y^{\prime }(\pi )=0$ makes $Y$ constant too.

For positive eigenvalues, the side conditions give $\lambda =n^2$, $X_n=\cos (nx)$, $n\ge 1$. The top condition chooses the hyperbolic cosine factor $\cosh (n(\pi -y))$. Normalize it to one at $y=0$, obtainingThe orthogonality of integer Fourier modes and the permitted interchange of summation and integration giveFor the remaining Fourier coefficients, integrate by parts twice. The sine boundary term vanishes, and with $f=x(\pi -x)$,The last integral vanishes because $f^{\prime \prime }=-2$ and $n$ is a positive integer. Thus $a_n=-2(1+(-1{)}^n)/n^2$: only even Fourier modes survive, as expected from reflection symmetry about $x=\pi /2$. Writing $n=2m$ givesThe factor involving hyperbolic cosine lies between zero and one on the closed rectangle. Comparison with $\sum m^{-2}$ proves uniform convergence, so the solution is continuous on the entire boundary and takes the prescribed bottom values. On every strip $y\ge \epsilon >0$, the Fourier coefficients have additional exponential decay, allowing differentiation and verifying Laplace's equation and all three Neumann boundary conditions.

To justify the endpoint calculation in b, differentiate at $0<x<\pi$, $y=0$ in the interior-edge sense:Subtracting $1$ from the hyperbolic tangent leaves an absolutely convergent series. For the remaining part, the power series $-\log (1-z)={\sum }_{m\ge 1}{z}^m/m$ gives, by taking real parts at $z=r{e}^{2ix}$ and then $r\uparrow 1$,The same formula follows as the limit of the differentiated interior solution, since its leading multiplier is $e^{-2my}$. This establishes the boundary normal derivative used in b. It also explains why the failure of the corner compatibility condition for mixed boundary data affects first derivatives at the bottom corners without spoiling continuity of $u$ itself.

The value $f(\mathbf{a},\mathbf{b},\mathbf{c})$ is twice the signed area of the triangle traversed in that order; it is positive for counterclockwise orientation. Choose points on the parabolaFor $i<j<k$, subtracting the first row in the determinant and factoring givesEach of the three factors is positive, proving the required property for every integer $n\ge 3$.

The euclidean algorithm computes the greatest common divisor of two integers by repeated division with remainder. Start with $r_0=|A|$, $r_1=|B|$, interchanging them if necessary, and repeatedly writeuntil a zero remainder occurs. The positive remainders strictly decrease, so the process terminates. At each step the common divisors of $r_{j-1},r_j$ are exactly the common divisors of $r_j,r_{j+1}$, because $r_{j+1}=r_{j-1}-q_j{r}_j$. HenceIf one input is zero, the answer is the absolute value of the other; the usual convention sets $\gcd (0,0)=0$. Back-substitution also expresses the greatest common divisor as an integer linear combination of the inputs, as in Bézout's identity.

Write $a=2\pi m+r$, where $m$ is an integer and $0\le r<2\pi$. The change of variables $x=y+2\pi m$ and the fact that $f$ is a periodic function giveSplit at $2\pi$, then substitute $y=z+2\pi$ in the second piece:ThereforeThis proves translation invariance of an integral over one period without assuming that $f$ is differentiable.

Fix $x\in G$. The integer powers of a group element satisfyFor nonnegative integers these rules follow by associativity and counting factors; negative integers are handled by $x^{-r}=(x^{-1}{)}^r$, and opposite signs by cancellation of adjacent inverse elements. All factors are powers of the same element, so no abelian group assumption is involved.

It follows that $z\mapsto \rho (z,x)=x^z$ is a group homomorphism from the additive group of integers to $G$, andThe homomorphism uses ordinary addition on $\mathbb{Z}$; composition of the power functions corresponds to ordinary multiplication of exponents.

Suppose there were only finitely many prime numbers. There is at least one, namely $2$, so this finite set would have a largest element $q$. The integer $2^q-1$ is greater than $1$ and therefore has a prime factor $p$: for example, its least divisor greater than $1$ must be a prime number, since any proper factor of that divisor would contradict minimality.

By ii, $p>q$, contradicting the choice of $q$. Therefore there are infinitely many prime numbers, proving Euclid's theorem by orders of group elements in finite multiplicative groups.

The multiplicative group of a finite field $p$ has group order $p-1$: its elements are exactly the nonzero residue classes. For any prime factor $p$ of $2^q-1$, i and Lagrange's theorem therefore implySince $q$ and $p-1$ are positive integers, $q\le p-1$, and henceThis applies to every prime factor, including repeated prime factors viewed as the same prime number.

Suppose the quotient group $G/A$ is a cyclic group, generated by $gA$. For any $x,y\in G$, there are integers $r,s$ and $a,b\in A$ such thatSince $a,b$ lie in the center of a group, they commute with every element, in particular with each other and with the integer powers of a group element $g$. ThereforeAs $x,y$ were arbitrary, $G$ is an abelian group. This is the cyclic quotient by the center.

The Bolzano-Weierstrass theorem states that every bounded sequence of real numbers has a convergent subsequence. It is enough to select infinitely many terms of the tangent sequence that stay uniformly bounded.

For each positive integer $k$, choose $n_k=\lfloor k\pi +1/2\rfloor$, using the floor function. Then $|n_k-k\pi |\le 1/2$. Moreover $n_{k+1}-n_k\ge \pi -1>0$, so these are strictly increasing indices. By the period and monotonicity of the tangent on $(-\pi /2,\pi /2)$,Thus $(\tan n_k)$ is a bounded subsequence. Applying the Bolzano-Weierstrass theorem to it gives a convergent subsequence, which is also a subsequence of the original sequence. Such a convergent subsequence therefore exists.