Normalize the mutually orthogonal eigenvectors so that is an orthonormal sequence. If did not tend to zero, some subsequence would satisfy . For distinct indices in this subsequence, orthogonality gives
Thus would have no Cauchy subsequence, contradicting compactness of . Therefore the orthogonal eigenvectors of a compact operator satisfy
Let , which is compact. Every in the unit ball of the continuous dual space restricts to a function on . These functions are uniformly bounded and equicontinuous, since
By the Arzelà-Ascoli theorem, every sequence in the unit ball has a subsequence that converges uniformly on . Along this subsequence,
The continuous dual space is complete, so converges in norm. Every sequence in the image of the unit ball therefore has a convergent subsequence, proving the forward direction of the Schauder theorem for compact operators:
A bounded linear operator is a compact operator when the image of the closed unit ball has compact closure, equivalently when every bounded sequence has a subsequence for which converges.
Each is compact because its image lies in a finite-dimensional subspace. Let be the unit ball and fix . Choose with . Since is relatively compact, it has a finite -net . For each , choose with ; then
Thus is totally bounded. Its closure is complete because is a Banach space, so it is compact. This proves the norm-closedness of compact operators and hence
Triangulate and . By the Simplicial approximation theorem, after subdividing the domain, a continuous map is homotopic to the realization of a simplicial map . Since , the image of lies in the -skeleton of the target triangulation and therefore misses an interior point of every -simplex. A sphere with one point removed is homeomorphic to the Euclidean space , which is contractible. Hence , and therefore , is homotopic to a constant map. Thus
The Simplicial approximation theorem states that if is a finite simplicial complex, is a simplicial complex, and is continuous, then for some there is a simplicial approximation to .
The target open stars form an open cover of , so their inverse images under form an open cover of the compact metric space . The Lebesgue number lemma supplies such that every subset of diameter below lies in one inverse image. Choose so large that every vertex star in has diameter below ; this is possible because its diameter is at most twice and the mesh tends to zero.
For each vertex choose a vertex of such that
If span a simplex, a point in its relative interior belongs to all their open stars. Its image belongs to all the open stars of , so these target vertices span a simplex. Thus extends to a simplicial map , and its defining inclusion says exactly that approximates . This proves the theorem.
A simplicial map is a simplicial approximation to when
for every vertex , where denotes the open star in a simplicial complex.
Fix in a simplex with vertices , retaining only vertices with positive barycentric coordinate at . Then for every , so lies in every . The vertices and the vertices carrying the barycentric coordinates of consequently span a common simplex of . Both and lie in its convex realization. The straight-line homotopy from a simplicial approximation
is therefore well-defined and continuous, with endpoints and .
The mesh of a simplicial complex is the largest diameter of one of its realized simplices, or the supremum when is not finite:
If , then
Iterating gives
For every nonempty simplex of , let be its barycentre. The first barycentric subdivision has the as vertices, and
is a simplex exactly when, after reordering, . Its realization is the same polyhedron as that of . The iterated barycentric subdivision is defined by
Put and . The maximal real subfield of the fifth cyclotomic field is . The roots of unity in a rational cyclotomic field show that the roots of unity in are exactly .
Let . For every embedding ,
Thus the kernel of the logarithmic unit embedding implies that is a root of unity. Since conjugation acts trivially modulo the prime element , we have . Among the tenth roots of unity this excludes the elements , so . Squaring is a bijection on this group of order five, so choose a root of unity with . Then is fixed by conjugation and is therefore a unit of .
The units of the quadratic field Q square root of five are , where . Absorbing the sign and into proves
The conjugates of are . From
we obtain, at every nontrivial th root ,
The product of the roots is one and . The derivative formula for a polynomial discriminant therefore yields the discriminant of a prime cyclotomic power basis:
Since , the sign is positive. The Vandermonde determinant
belongs to and satisfies . Hence
The norm
is a positive integer, because it is the sum of the squares of the multiplicities of the irreducible constituents. The character restriction norm bound and make it at most three. It is therefore , , or .
All three values occur:
By character orthogonality, the squared multiplicities are the character inner product norm of the restriction of a character:
Since is an irreducible character, its norm on is one, and hence
The omitted summands are nonnegative, so the character restriction norm bound is an equality precisely when
Quantum no-signalling says that, without communicating a measurement outcome, any local trace-preserving operation performed on subsystem leaves all outcome probabilities for measurements on subsystem unchanged; equivalently, it leaves the reduced density matrix unchanged.
The two Bell states are orthogonal. Applying the inverse Bell-state preparation circuit, namely a Controlled-NOT gate from to followed by a Hadamard gate on , gives
A computational-basis measurement therefore distinguishes them perfectly, so
If only is accessible, however,
Every measurement on consequently has the same outcome distribution under both hypotheses. With equal prior probabilities no information is available, and
the error probability of a random guess.
Let be Alice's unknown qubit, and label her half of the shared Bell state by and Bob's by . Alice applies a Controlled-NOT gate from the unknown qubit to , then a Hadamard gate to the unknown qubit. The three-qubit state becomes
Alice measures her two qubits in the computational basis and sends the two classical outcomes to Bob. Bob applies , recovering with certainty. This is quantum teleportation; Alice never needs to know the state.
For the shared GHZ state, Charlie first applies a Hadamard gate to his qubit. Then
Charlie measures in the computational basis. Outcome leaves Alice and Bob with ; outcome leaves , which either party converts to by applying after Charlie reports the outcome. Thus

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