The conclusions of (b) and (c) remain true. Indeed, the unit circle is a path-connected space, and the upper semicircle supplies a path from to ; restricting the proposed closed cover or two-valued continuous function to that path reduces either claim to the corresponding result on .
The fixed-point conclusion (d) fails. For example, any nontrivial spatial rotation of the unit circle has no fixed point when ; the antipodal map is the simplest example.
Suppose , where and are disjoint closed sets with and . Since each is the complement of the other, both are also open in . Define on and on . This locally constant function is continuous and contradicts part (c). Therefore .
Conversely, suppose a continuous satisfies and . The function is continuous, so part (d) gives . If , this forces , contradicting ; if , it forces , contradicting . Hence no such exists.
Suppose that the continuous function has no fixed point. Then is continuous and never zero, so
is a continuous function from to . Since and equality would be a fixed point, . Similarly . Multiplying by contradicts part (c). Thus has a fixed point.
If such a continuous function existed, the inverse images
would be closed, would cover , and would contain and respectively. Part (b) gives a point in , which is impossible.
Suppose for a contradiction that . Each grid point then belongs to exactly one of and ; colour it red in and green in . By part (a), there are adjacent points and , in either order, with
The interval is a compact set, so a subsequence of converges to some . Along the same subsequence . Since and are closed sets, , a contradiction. Hence .
Read the colours from left to right. If every neighbouring pair had the same colour, mathematical induction would make every point the same colour as , contradicting the different colour of . Therefore at least one adjacent pair has different colours.
Condition on a position retained after basis reconciliation, so Bob used Alice's basis. If Eve does not intercept, no error occurs. If she intercepts, her uniformly chosen basis agrees with Alice's with probability , again causing no error. With probability she uses the conjugate basis; her measurement and resent state then make Bob's bit uniformly random, giving an error with probability .
Therefore the bit error rate in the retained key is
Alice sends the conjugate-coded qubits through the noiseless quantum channel. Bob independently chooses a uniformly random basis bit for each qubit and performs a projective measurement in the computational basis when or the Hadamard basis when .
After all measurements, Alice and Bob publicly reveal and but keep the data bits secret. They discard every position with and retain the measured bits at positions where the bases agree. In the ideal channel those retained bits equal Alice's with certainty. Each pair of bases agrees with probability , so the shared secret key has expected length .
For each position , Alice uses to choose a basis and to choose a vector in that basis. Explicitly, she sends the qubit
Thus uses the computational basis , while uses the Hadamard basis .
In cylindrical coordinates,
The screw transformation
leaves and fixed, so it is the helical symmetry of a potential. Its infinitesimal generator has and . Noether's theorem therefore gives the conserved quantity
This is a linear combination of axial linear momentum and axial angular momentum.
Let
be the infinitesimal generator of the continuous symmetry, and let
be the canonical momentum. Noether theorem states that along every trajectory satisfying the Euler-Lagrange equations,
is conserved.
Indeed, differentiate the invariance of with respect to at zero:
On an Euler-Lagrange trajectory, , so
This proves the Noether conserved quantity for a mechanical point symmetry.
Use the suggested substitution
It maps to itself and satisfies
Hence
where is the complete elliptic integral of the first kind. Part (a) and the Gamma function recurrence now give
With , the change of variables formula gives
The beta-gamma identity, , and the Gamma reflection formula give
Therefore
Take context-free grammars for and rename their nonterminals so that they are disjoint. If their start symbols are , add a new start symbol and the production
All productions remain context-free. A derivation from produces a word from followed by a word from , and every such concatenation has a derivation. Thus the new grammar generates , proving closure of context-free languages under concatenation.
The pumping lemma for context-free languages states that for every context-free language there is a pumping length such that every with can be written
with
The Householder-John theorem states: if is Hermitian positive definite and is also Hermitian positive definite, then is invertible and
Now let be real symmetric positive definite and tridiagonal. For the Jacobi splitting, and . Positive definiteness of implies every diagonal entry is positive, so is positive definite. Introduce the alternating-sign diagonal matrix
Tridiagonality gives
Since is orthogonal, is positive definite whenever is. Both hypotheses of the Householder-John theorem hold, and hence the Jacobi iteration matrix satisfies . Therefore the Jacobi convergence for a symmetric positive-definite tridiagonal matrix follows.

There are unlisted articles, also show them or only show them.