Write with odd primes . The Jacobi symbol is
where each factor on the right is a Legendre symbol. The supplementary law is
For coprime positive odd , quadratic reciprocity gives
Applying this with gives
Finally, factor with odd. The supplementary laws for and , followed by reciprocity on every odd prime factor of , express solely in terms of the residue class of the positive odd integer modulo when or . If , all those factors, including the zero cases, agree; hence
Fix and put . If , then
uniformly for . Multiplication by the bounded continuous function and integration therefore prove continuity of at .
Take to be the positively oriented unit circle and . By the Cauchy integral formula, inside the circle and outside it, so no continuous extension across exists.
For the final assertion, cover by finitely many sufficiently small closed axis-parallel squares whose slightly enlarged squares lie in , choosing the grid so that no boundary meets . Apply the square Cauchy formula to on every selected square and add the results. Integrals over shared edges cancel with opposite orientations. The remaining finitely many oriented boundary polygons can be split into contours , and their sum is
for every .
The Reed-Muller code is spanned by the evaluation vectors of the square-free monomials
form a basis: every Boolean function has a unique algebraic normal form, so the monomials remain independent after evaluation on . Thus
Induction using the decomposition , with and , gives the lower bound for every nonzero weight. The monomial attains it, so the minimum distance is
The Mariner code is with parameters . Its information rate is , and it corrects
errors, a proportion of a codeword. The binary Hamming code of length has parameters : its rate is much higher, but it corrects only one error, a proportion .
A word of is the evaluation of an affine Boolean function
If , the two constants have weights and . If , choose with . Translation pairs every input where with one where . Hence every one of the other codewords has weight .
Let , , and
Then . Adding also produces ; for example is generated but lies in neither nor . Thus the proposed equality can fail because the new erasing rule may be used on a noninitial occurrence of .
After the first rule , every sentential form is obtained from a sentential form of by uniformly renaming as . Each rule of has exactly the corresponding renamed rule in , and conversely. Terminal words contain neither symbol, so this bijection of derivations proves
In the unstarred occurs only as the initial symbol and has precisely the alternatives
The first produces only . After the second, the renamed-derivation argument from part (b) produces exactly . Therefore
In a linear model containing an intercept, the normal equations make the residual vector orthogonal to every design column. In particular , so
up to floating-point rounding.
The second design matrix has random Gaussian columns plus the intercept, hence is a random matrix. It has full rank with probability one because the determinant vanishes only on a measure-zero algebraic set. Its column space is then all of , so the fitted vector equals , the residual sum of squares is zero, and .
The transition rates of this birth-death process are and . Thus, with ,
Multiplying by , summing, and shifting indices gives
At a finite-moment steady state with positive mean and ,
Since , this implies
If , both terms in the mean equation are nonpositive, and stationarity forces . Thus the population is extinct almost surely in any such steady state.
For any with , define
The definitions agree on overlaps by the recurrence, giving a meromorphic continuation to . Its only singularities are simple poles at . Since , repeated use of the recurrence gives
These residues are nonzero, so all the listed singularities really are simple poles.
The meromorphic continuations of and the gamma function have the same recurrence and the same value at . Hence their residues at every nonpositive integer are the same. Their difference therefore has removable singularities there and is analytic elsewhere, so it extends to an entire function. Equivalently, and show inductively that the apparent quotient singularities are removable.
The product is entire. From and ,
Its modulus is therefore periodic with period one. The assumed bound for on , together with the reflected bound for , bounds on that strip and hence on all of . By Liouville's theorem is constant, while forces that constant to be zero.
If were nonzero at one point, it would be nonzero on a neighborhood, so on an open set; the identity theorem would then give , a contradiction to that choice. Therefore and .
In Hamiltonian mechanics, the canonical momenta are
Hence
Because is independent of , Hamilton's equation gives . Put
Using
one obtains . Physically, is the component of angular momentum along the polar axis, while is the squared magnitude of the angular momentum.
The orbital plane has normal parallel to the conserved angular momentum. If its inclination to the equatorial plane is , then . Therefore
so
It vanishes when , equivalently at the greatest northern and southern latitudes reached by the inclined orbit. These are the turning points of the polar motion.
The Friedmann equation immediately gives
Using in the acceleration equation and eliminating with Friedmann gives
Differentiate and substitute this equation:
where was used in the last step.
For an expanding universe with , the coefficient is positive. Thus is unstable toward the future: an initial decreases away from one toward zero, whereas an initial increases and eventually corresponds to recollapse. In radiation domination, and
so a phase-line sketch has arrows away from the fixed point on both sides. Consequently the observed near-flatness today requires extremely fine tuning of the early value of .
During inflation , so . For expansion,
and the arrows point toward . Equivalently, accelerated expansion makes the curvature contribution rapidly decay. A sufficiently long inflationary epoch therefore drives a broad range of initial conditions extremely close to spatial flatness.
If the Schmidt rank is one, the decomposition is after absorbing its sole coefficient, so the state is a product. Conversely, a product state has coefficient matrix , which has rank one. Therefore a bipartite pure state is entangled exactly when its Schmidt rank is at least two.
The state is already
It therefore has Schmidt rank one across each of , , and .
Across the state is the product , so its Schmidt rank is one. Across it is
and the two states on each side are orthonormal, so the Schmidt rank is two. The same argument with and exchanged handles . This is precisely the entanglement of the Bell state shared by and .
Across , the GHZ state has the Schmidt decomposition
of rank two. Symmetry gives the same rank-two decomposition across and , so the state is entangled across every bipartition.
Projecting the GHZ state onto Charlie's outcome leaves the unnormalised state . After normalization Alice and Bob have , a product state.
Projecting the three-qubit state onto Charlie's outcome leaves
After normalization this is , a Bell state and hence an entangled state of Alice and Bob.
The reduction map sends onto with kernel of order , so . More explicitly, the lifting-the-exponent calculation
shows that has order modulo . Hence is cyclic of that order.
For the matrix claim, suppose and choose maximal such that , so some entry of is nonzero modulo . Replacing by a suitable power, we may assume its order is a prime . If , binomial expansion modulo gives
If , expansion modulo gives
because is odd. Both contradict , so .
For , fails because has order two. If , the same argument works; in the order-two case, for maximal ,
since the parenthesis is nonzero modulo two. Thus the smallest value is .
A language satisfies the regular pumping lemma if there is an integer such that every with can be written with
Let a deterministic automaton for have states. During the first input symbols of an accepted word of length at least , the run visits states, so two coincide. Write so that labels the nonempty loop between those visits and . Traversing that loop any number of times leaves the remainder of the accepting run unchanged, giving for every .
If an automaton with at most states accepted a word of length , the preceding loop argument would produce for every , with . These words have unbounded lengths and are distinct, contradicting the finiteness of .
Take pumping length . If a nonempty word , pump its first symbol; every pumped word remains in . Otherwise write with . If , pump the first symbol of , leaving a word of the same form. If , pump the initial : deleting it leaves , while retaining one or more copies lets the last pumped serve as the separator. Thus every required pumped word belongs to .
Choose a language that is not recursively enumerable; such a language exists because there are uncountably many languages but only countably many algorithms. Form as in part (d), which satisfies the pumping lemma.
If a grammar generated , enumerate its terminal derivations and retain precisely words of the form with . Since such a word contains only one separator,
This would enumerate , a contradiction. Hence is the required language.
Open ends impose . By separation of variables,
Expanding the initial constant gives , hence
The diffusive flux is . The total outward flux through both ends is therefore
It diverges as : the initially uniform profile is incompatible with the suddenly imposed zero boundary values, creating an idealized infinite initial gradient.
At late times the first sine mode dominates, with growth exponent
Thus
and the population grows precisely when . Faster diffusion carries organisms to the lethal ends more quickly and raises the threshold; a longer channel lowers the principal diffusion eigenvalue and therefore lowers the threshold.
Immediately after , thin boundary layers enforce zero concentration at both ends while the interior remains close to . The profile is symmetric about . Higher sine modes then decay rapidly and the shape approaches
For successive late-time curves have the same sine shape and decreasing height; for they have that shape and increasing height. Those features determine the two requested sketches.
The boundary conditions are now and . Their wave numbers are
The principal growth rate is , so long-term growth occurs when
Closing one end reduces the critical growth rate by a factor of four because there is only one absorbing escape boundary.
Each spatial mode acquires the factor
The oscillatory factor is bounded and does not affect the long-term exponential rate. With two open ends, growth therefore occurs exactly when
Only the time average of this spatially uniform fluctuating growth rate controls the asymptotic threshold.
Since and ,
To first order, continuity and the divergence of Euler give
Eliminating and using yields
The second term is Hubble damping, gravity drives growth, and pressure produces oscillatory restoration. Their balance defines
Modes longer than the Jeans length are gravitationally unstable; shorter modes are pressure supported.
Here
Since and , for a constant . With and , substitution of gives
so
For , the modes approach and . For , the exponents are complex with real part , giving logarithmic oscillations with decaying envelope . Taking would pressure-suppress structure on enormous, cosmologically important scales and is incompatible with the observed growth of smaller-scale structure.
Orthogonal projection gives the unique components
Choose
Then , , and the required decomposition follows. If one projection vanishes, its coefficient is zero and the corresponding normalized vector may be chosen arbitrarily in that subspace; the nonzero projected components remain unique.
Conjugating a reflection by a unitary reflects in the transported vector. Since ,
and every vector orthogonal to is fixed. Hence
in particular both sides act identically on .
Using as the horizontal axis and as the vertical axis,
Thus and
The operator reverses the component and fixes , so it is reflection in the horizontal axis. The operator reverses the component parallel to and fixes its perpendicular line; multiplication by reverses those roles. Hence is reflection in the line spanned by .
Articles were limited to the first 100 out of 284 total.

Articles by others on the same topic (0)

There are currently no matching articles.