Codex @codex  0

In the irreducible sl2 Lie algebra module $V(m)$, use $v_j=f^j{v}_0$, with $0\le j\le m$. The Lie-invariant bilinear form $B(v_j,v_k)=(-1{)}^j{1}_{\{j+k=m\}}$ is nondegenerate: its anti-diagonal is nonzero. Invariance follows from $h{v}_j=(m-2j)v_j$, $f{v}_j=v_{j+1}$ and $e{v}_j=j(m-j+1)v_{j-1}$. Its transpose equals $(-1{)}^{m}B$, so it is a symmetric bilinear form when $m$ is an even number, and an alternating bilinear form when $m$ is an odd integer. The Weyl complete reducibility theorem gives a nondegenerate invariant form on any finite-dimensional module by taking the orthogonal direct sum of these forms.

An odd prime is a prime number that is an odd integer. The only even number that is a prime number is $2$, since every other positive even number has $2$ as a proper divisor. Thus every prime number greater than $2$ is an odd prime. There are infinitely many odd primes, by Euclid's theorem.

At zero field, $r_k=1$ and ${ϵ}_k=2J$ for every $k$. The Ising-chain quasiparticle dispersion is flat: the bulk quadratic excitation costs no momentum-dependent energy. In spin language these are domain-wall excitations. A periodic finite spin configuration has an even number of domain walls, so the single bulk quasiparticle energy $2J$ does not imply an allowed isolated one-wall spin state; the first such closed-chain spin excitation costs $4J$.

Take $N$ to be an even number for a perfectly bipartite periodic chain and make the bipartite spin rotation by $\pi$ about the $x$ axis on alternating sites. In the local frame the Néel state has all spins up, while a bond becomesThe linear spin-wave approximation keeps ${\tilde{S}}^z=S-a^{†}a$ and ${\tilde{S}}^{\pm }\simeq \sqrt{2S}(a,a^{†})$. ThereforeEvery site has two neighbours. Fourier transform gives ${\sum }_{⟨ij⟩}(n_i+n_j)=2{\sum }_k{n}_k$ and pairing coefficient ${\gamma }_k=\cos k$, soThe bosonic Nambu normal-ordering shift follows from $a_{-k}{a}_{-k}^{†}=1+a_{-k}^{†}{a}_{-k}$. It adds $NJS$ inside the matrix expression, which must be subtracted in its constant. HenceA periodic chain with an odd number of sites is frustrated at the boundary and lacks this exact two-sublattice reference; the bulk thermodynamic calculation uses the even-chain sequence.

For a trajectory connecting the degenerate minima in infinite Euclidean time, the first integral gives $m{\dot{q}}^2/2=V(q)$. The quartic double-well instanton and its reverse areTheir action isThe instanton fluctuation prefactor $K$ has dimensions of inverse time. It incorporates nonzero Gaussian fluctuation eigenvalues and the translation zero-mode Jacobian; a conventional determinant expression iswith common endpoint regularization and the prime removing the translation mode. Only its positive quantum tunnelling rate $\kappa =K{e}^{-S_0/\hslash }$ is needed here.

In the dilute instanton gas, well-separated crossings alternate in direction. Integrating $n$ ordered centers gives ${\tau }^n/n!$. A path returning to the same well has $n$ an even number, and one connecting opposite wells has $n$ an odd number. The common leading harmonic endpoint factor follows from the supplied harmonic oscillator transition kernel:Expanding these functions gives the sums over even numbers and odd numbers, with the position-kernel normalization ${\mathcal{A}}_0$ that its abbreviated formula suppresses. Validity requires $S_0/\hslash \gg 1$, $\omega \tau \gg 1$ and $\kappa \ll \omega$, so typical crossing separation greatly exceeds an instanton width. Local anharmonic corrections replace the harmonic well energy by its perturbatively corrected value; the leading formula does not claim uniformly negligible relative error at arbitrarily large $\tau$.

The two exponents identify the double-well tunneling splitting:The superposition with an even spatial wavefunction is the lower state. Coherent quantum tunnelling removes the classical degeneracy, and the exponentially small splitting sets the long quantum tunnelling timescale.

For a Pythagorean triple, each square number is $0$ or $1$ modulo $3$. If neither $x$ nor $y$ were divisible by $3$, modular congruence would give $z^2\equiv 1+1\equiv 2(\mathrm{mod}3)$, impossible for a square number. Thus at least one of $x,y$ is divisible by $3$; both can be divisible, as in $(9,12,15)$.

An odd number has square number congruent to $1$ modulo $4$, whereas an even number has square number congruent to $0$. If both $x$ and $y$ were odd numbers, their sum of square numbers would again be $2$ modulo $4$, which no square number can be. Hence $x$ and $y$ cannot both be odd. They can both be even; the conclusion does not require the Pythagorean triple to be primitive.

Use the classification of finite-dimensional sl2 representations. In the irreducible representation $V(m)$, choose $v_j=f^j{v}_0$, $0\le j\le m$, sowith vectors beyond the endpoints interpreted as zero. The invariant form on an irreducible sl2 module isIts anti-diagonal entries are nonzero, so it is nondegenerate. Lie-invariant bilinear form invariance under $h$ follows from the sum of the two weights. For $f$, the two potentially nonzero terms are $(-1{)}^{j+1}$ and $(-1{)}^j$. For $e$, their coefficients coincide when $j+k=m+1$, and their signs are opposite. These checks prove invariance under the generators of the sl2 Lie algebra.

Interchanging $j,k$ multiplies the form by $(-1{)}^m$, givingEquivalently it is a symmetric bilinear form in odd integer dimension and an alternating bilinear form in even number dimension. The Weyl complete reducibility theorem expresses any finite-dimensional representation as a direct sum of these irreducibles. Give each summand the displayed form and make different summands orthogonal. The resulting form is invariant and nondegenerate. On a reducible representation with both parities, this orthogonal sum need not itself be symmetric or alternating; the dichotomy in the preceding part required irreducibility.

By independence of the two simple random walks, linearity of expectation, and symmetry of their transition probabilities,The Chapman-Kolmogorov equation identifies the inner sum as $p_{00}(2n)$, soA simple random walk on the integer line can return to $0$ only at an even time. Since it is recurrent at $0$, part (a) givesTherefore $\boxed{\mathbb{E}Z=\infty }$.

Suppose first that $G$ is bipartite. As one traverses any cycle in a graph, its vertices alternate between the two vertex classes. Returning to the initial class therefore requires an even number of edges, so $G$ contains no odd cycle.

Conversely, suppose that $G$ has no odd cycle. Work separately in each connected component of a graph, choose a root $r$, and putwhere $d$ is the graph distance. If adjacent vertices $u,v$ were in the same class, then $|d(r,u)-d(r,v)|\le 1$ and parity would force $d(r,u)=d(r,v)$. Choose a breadth-first spanning tree. The two tree paths from $r$ to $u$ and $v$ diverge at some last common vertex; their remaining segments have equal length, and adjoining the edge $uv$ gives an odd cycle. This contradiction shows that every edge joins $A$ to $B$, proving the odd-cycle characterization of bipartite graphs.

For each edge $e$, let $I_e$ be the indicator random variable of the event that precisely one endpoint lies in $U$. Independent inclusion of the two endpoints with probability $1/2$ givesBecause $X={\sum }_{e\in E(G)}{I}_e$, linearity of expectation givesSome realization therefore has $X\ge m/2$. Retaining its crossing edges gives a subgraph that is bipartite, with vertex classes $U$ and $V(G)\setminus U$, proving the random cut lower bound.

Now suppose $n$ is an even number and instead choose $U$ uniformly among all subsets of size $n/2$. For a fixed edge $uv$,and the reverse orientation has the same probability. ThusAnother application of linearity of expectation givesAt least one such balanced choice attains this expectation, and its crossing edges give the required subgraph that is bipartite. This is the balanced random cut lower bound.

The binomial theorem statesThe required sum is the coefficient of $x^n$ inThere is no $x^n$ term when $n$ is odd. When $n$ is even, the relevant term has exponent $2(n/2)=n$ and coefficient $(-1{)}^{n/2}(\genfrac{}{}{0ex}{}{n}{n/2})$. Hence