Since , the success probability is
The operator vanishes on the orthogonal complement of , so it has rank at most two. The states are distinct rays, hence they are linearly independent and has dimension two. In an orthonormal basis of , its determinant is
Thus its two eigenvalues on are nonzero and have opposite signs. All remaining eigenvalues are zero.
Under the gauge transformation,
because the curl of a gradient vanishes, and
The transformed Lagrangian is
A total time derivative changes the action only by endpoint terms, whose variation vanishes for fixed endpoints, so the Euler-Lagrange equations are unchanged.
The new momentum is
Use the type-two generating function for a canonical transformation
It gives , , and
This equals , so the gauge change is a time-dependent canonical transformation.
The canonical momentum is , and the Legendre transform gives
Its Hamilton's equations are
and, componentwise,
Combining the second equation with recovers the Lorentz force law.
The canonical momentum is
In components, the Euler-Lagrange equation is
Thus
The last term is the th component of , so
the Lorentz force law.
Apply the Hankel representation with replaced by :
Enlarge to a modified Hankel contour that encloses the simple poles , . In a strip where the deformation and residue sum converge, the outer pieces vanish and the orientation gives the Hankel integral as minus times the sum of the enclosed residues. Part (b) gives
Substitution therefore yields
Both sides are meromorphic functions of , so the identity theorem extends the equality from the initial strip to every point where either side is defined.
For , the denominator has derivative
Hence the simple-pole residue is
Take the Hankel contour about the negative real axis: it starts at just below the cut, circles the origin counterclockwise, and returns to just above the cut. The notation records this return side of the branch point. Choose the branch for .
For , collapse the contour onto the two banks of the cut. Their phase difference is determined by
and the resulting sine factor, together with the Gamma reflection formula , recovers the integral representation (‡). The Hankel integral converges exponentially at its unbounded end and, after the standard local subtraction of the singular part at zero, depends holomorphically on . The apparent poles of are cancelled by zeros of the contour integral except at . It therefore gives the analytic continuation of the Riemann zeta function to .
True. The Huffman tree is a full binary tree, so its leaves form a complete prefix code. The Kraft inequality is therefore an equality:
False. For probabilities , every length-two code is optimal. A code in which the and symbols are sibling leaves is optimal, but no Huffman construction produces that labelled tree, because its first merge must pair with a symbol.
False. For probabilities , first merge the two symbols. Subsequent ties allow Huffman trees with length multisets and , both of expected length .
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 .

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact