Put . Normalization through order gives
Thus
Tracing over removes the cross terms. The reduced density operator of a weakly coupled oscillator pair is therefore
whose trace is one to the required order.
The unperturbed ground state is with energy . Since
the first-order energy correction vanishes and first-order nondegenerate perturbation theory gives
The region is compact and positively invariant and contains the unique fixed point. If that fixed point is unstable, choose an initial point in which is not on its stable set. Its nonempty compact -limit set cannot be the fixed point. The Poincaré-Bendixson theorem therefore supplies a periodic orbit. Hence a sufficient parameter condition, and the one selected by the preceding analysis, is
On , ; on , . On , the identity gives a negative outward component because . On , one has . Finally, the sloping edge has outward normal proportional to , and there
Thus the vector field points inward or is tangent on every edge, so trajectories cannot leave the closed polygon .
Adding the two equations gives , so a fixed point has
At this point the Jacobian has determinant and trace
The fixed point is asymptotically stable exactly when , or
The equality curve exists only for and is
For the fixed point is unstable between these two curves and stable outside them; for it is stable everywhere.
Along a periodic orbit the vector field is tangent and makes one full turn, so its index around the orbit is . If the enclosed region contained no fixed point, the normalized vector field would extend continuously across the disc and its boundary map would have degree zero. This contradicts the index . Thus every planar periodic orbit encloses a fixed point.
The Poincaré-Bendixson theorem says that a nonempty compact -limit set of a planar flow which contains only finitely many fixed points is either a fixed point, a periodic orbit, or a union of fixed points and connecting trajectories. In particular, if it contains no fixed point, it is a periodic orbit.
For any ,
Therefore
The last term tends to zero. Taking the limsup and then proves the claim.
By the union bound,
For an random variable, . Taking makes the right side tend to zero, proving in probability.
Again the weights tend to zero, so finite-rank truncations prove compactness. Products of consecutive weights are bounded by , making the spectral radius zero. Therefore
The weighted shift is compact because truncating after the first weights gives finite-rank operators converging in norm, as . Moreover
so its spectral radius is zero. Since the spectrum is nonempty,
This is the unilateral left shift. It is not compact because . For every ,
is an eigenvector with eigenvalue . The norm bound and closedness then give
This is the unilateral right shift. It is not compact because the orthonormal sequence has no convergent subsequence. Its norm is one. For the Neumann series gives a resolvent; for , is an eigenvalue of the adjoint left shift, so lies in the spectrum of . Closedness supplies the boundary. Hence
True. At the vertices the side conditions force
On each side, remains in that same side, so the boundary restriction is homotopic within the boundary to the identity and has degree one. If it extended continuously over the filled triangle with image in the boundary circle, that degree-one boundary map would be null-homotopic, which is impossible. Equivalently, a sufficiently fine simplicial approximation would contradict the parity form of Sperner's lemma proved in part (b).
False. The constant map to satisfies it: and also .
Not necessarily, once the subdivision has at least two segments per side. Colour red, green, blue respectively and colour every other grid vertex red. No small triangle contains both exceptional vertices and , and every small triangle therefore uses at most two colours. For the unsubdivided triangle the assertion is of course true.
Count red-green segments modulo two. On , part (a) says their number is odd; the other two outer sides contain no red-green segment. Every interior segment belongs to two small triangles and therefore contributes zero modulo two, while each boundary segment belongs to one. Thus the sum, over all small triangles, of their numbers of red-green edges is odd.
A triangle with all three colours has exactly one red-green edge. A triangle using only red and green has zero or two, and any other nontrichromatic triangle has zero red-green edges. Hence the parity sum counts precisely the trichromatic triangles modulo two, proving that their number is odd.
Alice performs the operation and measurement from part (iii) and sends the one-bit outcome to Bob. If the bit is , Bob does nothing. If it is , Bob applies , which maps to by part (i). In either case Bob finishes with the known target state , using one shared Bell pair and one classical bit.
Using the decomposition from part (ii), maps Alice's to and to . Alice obtains or , each with probability . Conditional on outcome , Bob has ; conditional on outcome , Bob has .
The matrix is real orthogonal. Part (a) gives
Expanding the left side in the computational basis yields

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