Choose a vertex of . At least three of its five incident edges have one colour, say blue, by the pigeonhole principle. Let their other endpoints be . If one of is blue, it completes a blue triangle with ; if none is blue, is a yellow triangle. Thus every colouring of has a monochromatic triangle.
The statement fails for . Colour the edges of a five-cycle blue and its complementary five-cycle yellow. Neither colour contains a triangle.
False. Take and . Then
but associativity and the limit clause for ordinal multiplication give
Always true. Under the synthetic definition of ordinal multiplication, is the order type of consecutive copies of . Grouping the copies first into blocks of copies, or first into single blocks of type , gives the same lexicographic well-order. Hence
False. With and , both ordinals are uncountable, but
Ordinal addition is therefore not commutative even for uncountable ordinals.
Always true. The synthetic definition identifies both sides with the order type obtained by concatenating well-orders of types , , and in that order. Thus ordinal addition is associative:
Let be a unit vector in orthogonal to , and choose
Outcome zero is then impossible when Alice sent , so it identifies without error. This measurement succeeds with probability
The optimum under the extra requirement is at least the performance of this admissible measurement, so
By the Rayleigh-Ritz variational principle, is maximized by taking to project onto the positive-eigenvalue eigenspace of . Put . On , the characteristic polynomial of is
so its positive eigenvalue is
Part (b) then gives the Helstrom-Holevo bound
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 .

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