Codex @codex  0

Choose continuous argument lifts ${\theta }_1,{\theta }_2$ for the two curves. Their sum is a lift for their pointwise product, becauseSubtract its initial value from its final value to obtainIn particular, winding numbers subtract under pointwise division of curves avoiding zero.

For each integer $m$, take ${\gamma }_m(t)=e^{2\pi imt}$. It is a continuous closed curve avoiding zero and has the continuous argument $2\pi mt$. ConsequentlyPositive and negative integers correspond to opposite senses of traversal, and the constant curve gives zero.

Let $u(t)=\gamma (t)/|\gamma (t)|$, a continuous map into the unit circle. By uniform continuity, partition $[0,1]$ so finely that on each interval beginning at $t_j$, $|u(t)/u(t_j)-1|<1$. This ratio lies in the right half-plane and has a continuous complex argument with value zero at $t_j$. Starting from ${\theta }_0$, add these local arguments successively, matching endpoint values. This constructs a continuous real lift with $u(t)=e^{i\theta (t)}$.

Any two such lifts with the same initial value differ by a continuous function taking values in $2\pi \mathbb{Z}$, and hence coincide. Since the curve closes, $e^{i(\theta (1)-\theta (0))}=1$. Define its winding number byChanging the chosen initial argument adds a constant multiple of $2\pi$ to the whole lift, so the winding number is independent of that choice. No differentiability of the curve is required.

Both forms have discriminant of a binary quadratic form $-60$. The reduction algorithm for a positive definite binary quadratic form gives $|b|\le a\le c$ and $a\le \sqrt{60/3}<5$ for a reduced positive definite representative. Enumerating $a=1,2,3,4$ givesThe second and fourth forms are imprimitive and represent only even integers. Every odd prime represented by a form of discriminant of a binary quadratic form $-60$ must therefore be represented by $f$ or $g$.

For a prime $p\nmid 30$, quadratic reciprocity givesEvery prime $p\equiv 1(\mathrm{mod}15)$ has this symbol equal to one and hence is represented by one of the two primitive forms, by part (b). But an odd prime represented by $g$ and different from three is $2(\mathrm{mod}3)$, so these primes must be represented by $f$. Similarly, primes $p\equiv 2(\mathrm{mod}15)$ have both symbols equal to $-1$, and are represented by $g$, since a prime represented by $f$ is $1(\mathrm{mod}3)$. Both residue classes are coprime to 15, so Dirichlet theorem on primes in arithmetic progressions proves each form represents infinitely many primes.

The same modulo-three distinction excludes every prime other than three from being represented by both. The form $f$ does not represent three; $g$ represents three and five but neither is represented by $f$, and two is represented by neither. Therefore there are no primes represented by both forms.

Write an integral binary quadratic form as $Q(u,v)=A{u}^2+Buv+C{v}^2$, with discriminant of a binary quadratic form $d=B^2-4AC$. If $Q(u,v)=p$ is prime, then $\gcd (u,v)=1$: any common divisor would have its square dividing $p$. Complete $(u,v)$ to a matrix in ${\mathrm{SL}}_2(\mathbb{Z})$ using Bezout identity. After the associated integral change of variables, the properly equivalent form has leading coefficient $p$, say $[p,b,c]$. Its discriminant of a binary quadratic form gives $d=b^2-4pc$, hence $b^2\equiv d(\mathrm{mod}p)$.

Conversely suppose $b_0^2\equiv d(\mathrm{mod}p)$. Since $d$ is an integral-form discriminant of a binary quadratic form, $d\equiv 0$ or $1(\mathrm{mod}4)$. Choose $b\equiv b_0(\mathrm{mod}p)$ with even integer parity for $d\equiv 0(\mathrm{mod}4)$ and odd integer parity for $d\equiv 1(\mathrm{mod}4)$. This is possible because $p$ is odd. Then $b^2-d$ is divisible by $4p$, andis an integral form of discriminant of a binary quadratic form $d$ representing $p=Q(1,0)$. This proves the discriminant criterion for prime representation by a binary quadratic form, including the case $p\mid d$; no assumption that $d$ is a fundamental discriminant was used.

Dirichlet theorem on primes in arithmetic progressions states that if positive integer $q$ and integer $a$ satisfy $\gcd (a,q)=1$, then infinitely many prime numbers satisfyThe coprimality hypothesis is essential: if $a$ and $q$ have a common factor greater than one, a prime in the progression must divide that factor, giving at most finitely many possibilities.

The baryon-to-photon ratio is extremely small, of order $10^{-9}$. Thus even when the typical photon energy is below $I$, the high-energy tail of the blackbody radiation contains enough photons above the ionization energy to reionize almost every newly formed hydrogen atom. Cosmological recombination becomes effective only when this exponentially small tail is also small compared with the baryon-to-photon ratio. Consequently recombination occurs at a temperature much lower than $I/k$, consistent with $kT\simeq 0.03I$. The exact freeze-out history also depends on reaction rates and expansion; the equilibrium estimate explains the large suppression of the temperature.

Chemical equilibrium imposes ${\mu }_e+{\mu }_p={\mu }_H+{\mu }_{\gamma }$. For blackbody photons, ${\mu }_{\gamma }=0$. Define the positive Hydrogen binding energy by $I=(m_e+m_p-m_H)c^2$, approximately $13.6\mathrm{eV}$. Multiplying the two Maxwell-Boltzmann distribution number densities and dividing by the neutral-hydrogen density givesUse $g_e{g}_p/g_H=1$ and $m_p/m_H\simeq 1$ to obtain the Saha ionization equationThe assumptions are nonrelativistic, dilute, nondegenerate species at a common temperature, ground-state hydrogen with the stated degeneracy factors, negligible mass correction in the prefactor, and sufficiently rapid reactions to maintain chemical equilibrium.

Context-free languages are closed under union: use a new start symbol with alternatives for two renamed context-free grammars. If they were closed under complement in ${\Sigma }^{\ast }$, De Morgan's laws would givecontradicting the preceding intersection example. Therefore some CFL has a non-context-free complement. This is an existence argument; it does not assert that both complements of the particular $L_1,L_2$ are non-context-free.

A concrete choice is $L=\{a,b,c{\}}^{\ast }\setminus \{a^n{b}^n{c}^n:n\ge 0\}$. Words outside $a^{\ast }{b}^{\ast }{c}^{\ast }$ form a regular language. Among words inside it, membership in $L$ means the first two counts or the last two counts differ. Each unequal-count comparison has a context-free grammar: for $a^i{b}^j$ with $i>j$, use $T\to aTb\mid A$, $A\to aA\mid a$; for $i<j$, replace $A$ by $B\to bB\mid b$. Append any number of $c$'s, or prefix any number of $a$'s for the analogous $b,c$ comparison. Taking these unions gives a context-free language whose complement is the non-context-free equal-three-count language. These productions are definitions of the example, not a restriction to strict Chomsky normal form.

The context-free languages $L_1=\{a^n{b}^n{c}^m:n,m\ge 0\}$ and $L_2=\{a^m{b}^n{c}^n:n,m\ge 0\}$ have context-free grammars $S\to TC$, $T\to aTb\mid \epsilon$, $C\to cC\mid \epsilon$, and $S\to AT$, $A\to aA\mid \epsilon$, $T\to bTc\mid \epsilon$, respectively.

Their intersection is $L=\{a^n{b}^n{c}^n:n\ge 0\}$. Suppose $L$ satisfied the pumping lemma for context-free languages with length $p$. In a decomposition $a^p{b}^p{c}^p=uvwxy$ with $|vwx|\le p$ and $|vx|>0$, the window $vwx$ cannot meet both the $a$ and $c$ blocks. Pumping down changes at least one count and leaves at least one count unchanged. Thus the three counts are unequal, or the word order is invalid, contrary to the pumping lemma for context-free languages. Hence CFLs are not closed under intersection.

In strict Chomsky normal form, every production of a context-free grammar is $A\to BC$ or $A\to a$, with $A,B,C$ nonterminal symbols and $a$ a terminal symbol. Such a derivation cannot produce the empty word: it starts with one nonterminal symbol, and every step either increases the symbol count or replaces one symbol by one symbol. The context-free language $\{\epsilon \}$, generated by $S\to \epsilon$, is therefore not generated by any strict CNF grammar.

The convention matters: extended Chomsky normal form permits $S\to \epsilon$ with $S$ excluded from right-hand sides. Under that convention every context-free language has such a grammar, so the requested example would not exist.

Two consecutive steps multiply by the polynomial of the symmetric matrixThe Chebyshev polynomial bound on $[0,1]$ gives $|P(\lambda )|\le 1/8$, and the actual endpoints $0,1$ attain it. At the dominant eigenvalue, $P(1+ϵ)=1/8+ϵ+{ϵ}^2$. ThusFor a small prescribed error $\delta$ relative to a fixed initial-component factor $C$, the number of matrix-vector iterations is approximately $\log (C/\delta )/(-\log \rho )$. The three leading denominators are $ϵ,2ϵ,4ϵ$. Therefore the iteration counts are in the ratio $1:1/2:1/4$: the single shift halves and the alternating double shift quarters the leading count. A pair of double-shift steps costs two matrix-vector products, already accounted for by using $\rho$ per iteration rather than ${\rho }^2$.

With shift $1/2$, the unwanted eigenvalues lie in $[-1/2,1/2]$, and both endpoints occur. The dominant shifted eigenvalue is $1/2+ϵ$. HenceThe negative endpoint can alternate in sign, but the norm error has this factor, and the even-iteration comparison removes the alternation.

Expand the initial vector in the orthonormal eigenbasis. After $j$ unshifted steps, the coefficient ratio of mode $i<n$ to the dominant mode is $(c_i/c_n)({\lambda }_i/{\lambda }_n{)}^j$. Since ${\lambda }_{n-1}=1$ and $c_{n-1},c_n\ne 0$, the sharp asymptotic contraction factor isNormalization only changes the dominant coefficient by a higher-order error; its eventual sign is the sign of $c_n$.

In Minkowski spacetime with metric $-d{t}^2+d{x}^2+d{y}^2+d{z}^2$, takeIts tangent vector is $(1,-\sin t,\cos t,0)$, with metric tensor square $-1+{\sin }^{2}t+{\cos }^{2}t=0$. Its acceleration is $(0,-\cos t,-\sin t,0)$, nonzero and not proportional to the tangent because its time component is zero. Thus it is a regular null curve which is not a geodesic under any reparametrization.

Let $U$ be the smooth nonzero tangent along a regular null curve, and $a={\nabla }_{U}U$. Metric compatibility gives $g(U,a)=\frac{1}{2}U[g(U,U)]=0$. In a two-dimensional Lorentzian manifold, the orthogonal complement of a nonzero null vector is its own span; this follows directly in the preceding null basis. Therefore $a=\kappa (t)U$.

Consequently every regular null curve is a geodesic up to reparametrization. To obtain an affine parameter $\lambda$, write $q=dt/d\lambda >0$ and solve $dq/dt+\kappa (t)q=0$. Then ${\nabla }_{qU}(qU)=q^2(\kappa +q^{-1}dq/dt)U=0$. A solution $q=C\exp (-\int \kappa dt)$ exists locally and along any nonsingular parameter interval. The original parameter need not be affine; the literal assertion of zero covariant acceleration for every parameter would be false.

Write the nonzero tangent vector as $U=aV+bW$. Since $g(V,V)=g(W,W)=0$ and $g(V,W)=-2$, nullness gives $g(U,U)=-4ab=0$. Thus exactly one coefficient can be nonzero, proving $\boxed{U\parallel V\text{ or }U\parallel W}$. This pointwise argument does not require the curve to be a geodesic.

At $p$, choose local normal coordinates with $g_{\alpha \beta }(p)=\mathrm{diag}(-1,1)$. Let $e_0,e_1$ be their coordinate basis. The vectors $V=e_0+e_1$ and $W=e_0-e_1$ have zero metric tensor square, and their component matrix has determinant $-2\ne 0$. Thus two independent null vectors form a basis of the tangent space. Normal coordinates are only needed at the chosen point, not on a whole neighbourhood with flat metric.