The printed normalization has its factors reversed. For the displayed map , the condition says , which is unitality. Trace preservation instead requires
These are distinct trace-preserving and unital Kraus conditions. To disprove the printed equivalence, take and
They obey , but
Thus their completely positive map is not trace preserving. They are the adjoints of the operators of an amplitude damping channel. That channel is trace preserving but sends to , so it cannot satisfy the printed normalization in any Kraus representation either. The corrected characterization is proved next.
Work in finite-dimensional input and output Hilbert spaces, with a linear map on operators. Suppose first that and . For every auxiliary dimension and every positive operator on the extended space,
Each summand is positive because conjugation preserves positivity. This is exactly the definition of a completely positive map. Cyclicity of the trace gives
so the map is also trace preserving.
Conversely, suppose is completely positive and trace preserving, and let be an orthonormal input basis. Use the unnormalized entangled vector , with the reference factor first. Complete positivity makes the corresponding unnormalized Choi matrix positive:
Its spectral decomposition can be written , absorbing the nonnegative eigenvalues into the vectors. Define linear operators uniquely by
Expanding the outer products and comparing their reference blocks yields
The matrix units span all operators, so linearity proves the Kraus representation for every . Finally, trace preservation gives
for all . Taking matrix units as test operators shows that the matrix in parentheses is zero. This proves both directions of the corrected CPT characterization, including the normalization rather than assuming it.
For an input quantum state ensemble , write and . Its output Holevo quantity is
The Holevo capacity is the optimized one-use quantity
where the supremum ranges over finite input ensembles and is the Von Neumann entropy in bits.
For uses of a memoryless quantum channel, the map is . An -use code consists of a finite message set of size , an encoding state on the inputs for each message, and a decoding POVM on the output space, with and . The encoding states may be entangled across uses. The measurement outcome is the receiver's decoded message, with conditional probability
For uniformly distributed messages the average error and rate are
A rate is achievable if there is a sequence of such codes with and . The unassisted classical capacity of a quantum channel is the supremum of achievable rates; the sender and receiver do not share prior entanglement.
The operational content of the Holevo-Schumacher-Westmoreland theorem is that is the capacity for product-state input encodings with collective output measurements. Allowing arbitrary entangled block inputs gives the regularized formula
The limit equals the supremum because superadditivity of Holevo capacity follows by taking product ensembles for two blocks and using additivity of the Von Neumann entropy on product states. The coding theorem makes every rate below the one-block Holevo quantity achievable through many independently encoded blocks, with collective decoding.
The converse can be seen explicitly from the Holevo bound and Fano's inequality. For a uniform transmitted message and decoded message ,
The first inequality is obtained by subtracting the Fano bound on from . Dividing by and letting the average error vanish bounds every achievable rate by the regularized expression. The block-coding achievability just described supplies the reverse bound.
Under the assumed additivity of Holevo capacity across tensor powers, for every . Thus
The stated conditional assertion is true: under this additivity assumption, entangled input states cannot increase the asymptotic unassisted classical rate beyond the rate already achievable with product inputs. The decoder may still use collective measurements across channel outputs.
The -qubit Pauli group is
A stabilizer group is an abelian subgroup of excluding . Its associated stabilizer code is the common positive eigenspace
The exclusion of is necessary for a nonzero code, since no nonzero vector has eigenvalue under .
Every is a signed Hermitian tensor product of Pauli matrices. An imaginary-phase Pauli element would have , contradicting closure of and exclusion of ; hence and . If , it cannot be a nontrivial scalar Pauli element, and at least one of its local factors is or . Each of these has trace zero. Using gives .
The spectral theorem for Hermitian operators and show that all eigenvalues are or . If their multiplicities are and , then
Thus the balanced spectrum of a nonidentity stabilizer is
This concerns a nonidentity stabilizer acting on the entire physical space; on the code every stabilizer acts with eigenvalue .
Because all elements commute and square to , is a vector space over under multiplication. Its independent stabilizer generators satisfy that no nonempty product is ; all products are distinct. The stabilizer-projector formula is
To verify it, group multiplication gives , Hermiticity gives , and for every . Conversely every code vector is fixed by this average, so its range is exactly . All nonidentity stabilizers have trace zero by the preceding proof. Therefore
For a code of dimension , the number of independent generators is consequently . One can list additional redundant generators, but an independent generating set has exactly this size.
For a correctable Pauli error , define the syndrome bit to be zero when commutes with and one when it anticommutes. On an encoded state,
Measure the commuting stabilizer generators; their eigenvalues reveal the error syndrome without revealing logical amplitudes. In a nondegenerate quantum code, the distinct specified correctable errors have orthogonal images of the code and distinct syndromes. A syndrome therefore identifies the error representative, and applying the inverse Pauli operator restores the encoded state.
If an actual error operator is a coherent linear combination of the specified errors, its state is a sum of these orthogonal syndrome components. Syndrome measurement selects one component, followed by the same inverse operation. The linearity of coherent quantum error correction ensures the logical state is recovered in every outcome. The same procedure handles noise Kraus operators in that error span; it does not require a probabilistic Pauli-noise assumption.
A Pauli error commuting with every stabilizer has the all-zero syndrome and preserves the code space. If it is a stabilizer up to global phase, this silent action is harmless. If it lies in the centralizer of a stabilizer group but is not a stabilizer up to phase, it acts as a nontrivial logical operator, and syndrome measurements cannot detect it. More generally, a non-scalar component of an error is an undetectable logical action. This distinguishes harmful undetected errors from scalar actions that satisfy quantum error detection algebraically.
The three-qubit bit-flip repetition code has basis and generators
A single phase flip commutes with both and has zero syndrome, but
It is a nontrivial logical phase operation. In particular, is not scalar, so the error set violates the Knill--Laflamme condition and cannot be corrected. Thus the code corrects single bit flips but not single phase flips; its distance against arbitrary quantum errors is one.
For probability distributions and on a finite alphabet, their classical relative entropy in bits is
A zero- term contributes zero, including when ; a term with and makes the result . In that infinite case nonnegativity is immediate. Otherwise on the support of . For every , : the function has derivative and its minimum zero at . Apply this with to obtain
The last inequality uses normalization of . Thus . Equality requires wherever and no -mass outside that support, hence occurs precisely when .
For density matrices, use
when the support of a positive operator is contained in that of , and set it to otherwise. The data-processing inequality for quantum relative entropy states that for any quantum channel ,
Thus the relative entropy of the two output states cannot exceed that of the inputs.
For the states with a classical flag, omit indices of weight zero. On a positive-weight block, the matrix logarithms obey
on the relevant supports. The logarithms of cancel. Taking the trace block by block therefore gives the relative entropy of classically flagged states:
If support inclusion fails in a positive-weight block, both sides are infinite. A zero-weight block makes no contribution, even if its unweighted relative entropy is infinite.
Tracing out the flag is a quantum channel with operators , since . It sends the two flagged states to and . Applying the data-processing inequality for quantum relative entropy to this partial trace proves joint convexity of quantum relative entropy:
For a bipartite state, set and . Its quantum mutual information is
where is the Von Neumann entropy. The support of lies in . To justify this when marginals are singular, let project onto . Then ; positivity implies . Applying the same argument on proves the claimed support inclusion.
On that support, product eigenvectors show
The definition of the partial trace therefore gives
Consequently .
For completeness, nonnegativity of quantum relative entropy also follows from the classical proof above. Diagonalize in a basis , with eigenvalues , and put . These are two classical probability distributions. Scalar concavity of the logarithm applied to the spectral weights of gives whenever and support inclusion holds. Hence
The support-failure case is again infinite. Applying this to the product of the marginals proves without requiring an additional entropy inequality.
The physical space of qubits is . An error operator is a linear operator on this space, for example one Kraus operator of a noise quantum channel. The usual channel description assumes initially uncorrelated system and environment, with the environment subsequently ignored; more general initial correlations need not define a channel on arbitrary system inputs. Finite dimension and the tensor decomposition into identifiable qubits allow an exact Pauli expansion of a quantum error. No independence between errors on different qubits is assumed by this expansion.
The tensor products of form an orthogonal basis of the operator space under the Hilbert-Schmidt inner product. Equivalently, absorbing phases into coefficients, every error has an expansion
For a computational basis vector labelled by , this gives
where addition and the dot product in the exponent are modulo two. Thus changes a bit, changes its phase, and performs both up to a scalar phase. A general error is a coherent linear combination of such actions; it need not be a classical random choice of Pauli operators. A restriction to at most faulty qubits is an additional locality assumption, expressed by the span of Pauli operators of weight at most .
The weight of a Pauli operator is the number of tensor factors different from , ignoring global phase. Let be the orthogonal projector onto a -dimensional code . Quantum error detection means
Indeed, a projective measurement of flags departure from the code, while its code-space outcome acts as the scalar on every encoded state and hence does not change logical information. Harmless scalar actions are included in this criterion. The quantum code distance is
Thus every Pauli operator of weight at most is detectable. The condition is linear in , so it holds for any error in their span. This proves detection of arbitrary errors affecting at most qubits, including coherent errors.
For correction, put and take all phase-free Pauli operators of weight at most . Their pairwise products satisfy
These are the Knill--Laflamme conditions. Here is their recovery construction, rather than merely using the criterion's name. For any normalized code state , the matrix is a Gram matrix, since , and is therefore positive semidefinite. Choose linear combinations of the errors diagonalizing this matrix, so that
For , the operators are isometries from the code into mutually orthogonal error-image subspaces: . Measure the projectors and, on outcome , apply . Complete this recovery arbitrarily on the remaining orthogonal subspace to make a trace-preserving quantum channel.
For an error and any encoded density operator , the recovered contribution is
Terms with annihilate the code. For a physical noise channel whose Kraus operators belong to this span, summing the displayed scalar over those operators gives one by trace preservation. The resulting recovered state is exactly . This proves the constructive recovery from the Knill-Laflamme condition and the requested guarantee
This argument allows degenerate codes; distinct physical errors may have identical actions on the code.
For the Shor code, define . Its two normalized basis codewords are
Six stabilizer generators are ; the two phase checks are
All eight have eigenvalue on both basis codewords. A phase error commutes with the six checks and anticommutes with both and . Their projective measurements therefore return
The two negative phase checks identify the middle three-qubit block. Apply the Pauli Z gate to restore the state, since . This procedure acts identically on every logical superposition, and the checks reveal no logical amplitudes. The syndrome cannot distinguish from or , but all three have the same action on the code: their pairwise products lie in the stabilizer group. Correcting with any one of them is sufficient. Thus the degeneracy in the syndrome is harmless.
Use base-two logarithms throughout, so classical rates are measured in bits and quantum compression rates in qubits. A memoryless classical information source is a sequence of independent and identically distributed random variables on a finite alphabet , with fixed probability mass function . A length- word has probability , and the one-symbol Shannon entropy is , with .
For , the typical set is
This is weak typicality: it constrains the normalized self-information, not each empirical symbol count separately.
The typical sequence theorem gives the following three facts for fixed . The probability tends to one; each word in the set has probability between and ; and, once the set has probability at least ,
The concentration assertion follows from the weak law of large numbers applied to the iid information variables , whose finite-alphabet mean is . The probability bounds are the definition of typicality exponentiated. Summing the lower bound over the typical words and using total probability at most one proves the cardinality upper bound; summing the upper bound and using total typical probability at least proves the lower bound.
Fix and choose . Enumerate all words in and assign a distinct fixed-length binary index to each. Reserve one more index as a failure symbol for every atypical input. For all sufficiently large ,
so these indices can be transmitted using bits. The decoder inverts the typical-word enumeration; on the failure index it returns any fixed word. This describes both the compressor and decompressor, and its block error probability obeys
Its rate tends to bits per symbol. Thus every permits reliable fixed-rate compression, with no claim that atypical words are reconstructed correctly.
For the memoryless quantum information source, the average one-use density matrix is
Its trace is one and determinant , so its two eigenvalues are
The source-coding limit in Schumacher compression is the Von Neumann entropy of this average state: every larger qubit rate allows asymptotically faithful recovery of the emitted states, and a smaller rate cannot do so. Applying that limit gives
where is the binary entropy. The quantum typical subspace of has dimension about and carries asymptotically all source weight, which explains the compression rate. The entropy of the classical emission label is one bit; it is not the quantum rate because the two emitted pure states are nonorthogonal.
Write , where and is the character of an irreducible representation. An irreducible representation is a cuspidal representation of a finite reductive group exactly when its Harish-Chandra restriction to every proper rational Levi subgroup of a rational parabolic subgroup is zero.
The needed identity is the Harish-Chandra restriction of a Deligne-Lusztig character. For a rational parabolic subgroup , the torus case of the induction-restriction formula gives
Here . The geometric meaning of the indexing condition is that only a rational conjugate of the inducing maximal algebraic torus lying in the Levi can survive taking -invariants. This is the established torus case of Deligne-Lusztig induction, valid without a restriction on ; it is not an appeal to an unrestricted induction-restriction conjecture. See Dudas and Michel's lectures, Theorem 14.4.
Suppose first that is an elliptic maximal torus, meaning it lies in no proper rational parabolic subgroup. For any proper rational , the indexing set in the displayed sum is empty. Indeed with would imply , itself a proper rational parabolic subgroup. Hence , and multiplication by gives . This proves cuspidality.
Conversely suppose for a proper rational parabolic subgroup. There is a unique Levi subgroup of containing this particular maximal algebraic torus: relative to , it is generated by and those root subgroups for which both the root and its negative occur in . Call it . Uniqueness and , imply , so this is a proper rational Levi. Transitivity of Deligne-Lusztig induction through this rational parabolic says
Set , allowing it to be a virtual character. Adjunction of Harish-Chandra induction and Harish-Chandra restriction, extended linearly to virtual characters, gives
Thus this Harish-Chandra restriction cannot vanish, so is not cuspidal. No positivity or irreducibility of is needed, and the sign in causes no cancellation problem. We have proved
The term elliptic maximal torus is relative to the ambient group: split central factors are allowed. The actual condition is absence of a proper rational parabolic subgroup containing .
Let and be rational parabolic subgroups with rational Levi subgroups. Work with complex representations of their finite groups of Lie type. Here Harish-Chandra induction and Harish-Chandra restriction mean
The latter is an -module, and it is adjoint to the former by Frobenius reciprocity.
Define
For , put and let transport an -module to a -module. The Mackey formula for Harish-Chandra induction is the natural functor isomorphism
On characters the direct sum becomes a sum. The intersection parabolics displayed in the subscripts are important: they specify exactly which Harish-Chandra induction and Harish-Chandra restriction occur.
We use the following parabolic-intersection lemmas, stating explicitly the geometric input to the proof. First, representatives of represent exactly the double cosets . Second, for such , the groups and are parabolic subgroups of and , respectively, with common Levi subgroup and respective unipotent radicals and . If , projection maps onto with kernel . Projection maps onto with kernel . These assertions hold on rational points as well. The surjectivity on rational points uses connectedness of the unipotent kernels and the Lang theorem for algebraic groups. These are the compatible-Levi and rational double-coset lemmas; they follow by applying the root-subgroup decomposition after choosing the common maximal algebraic torus.
For completeness, the representation-theoretic reduction is as follows. The group algebra realization of induced representation splits according to the double cosets:
as a -bimodule. Tensoring on the right with an inflated -module identifies each summand with induction from . This proves the finite-group Mackey restriction formula in the form
Here is trivial on .
We next record the elementary normal-subgroup identity underlying Harish-Chandra restriction. If are finite groups, with a normal subgroup, and , then for a complex -module ,
To see this, replace invariants by coinvariants using the averaging idempotent . Taking coinvariants in first replaces by , and forces to act trivially on . Thus it yields ; averaging over identifies this last module with the one displayed. This also shows why characteristic zero makes the argument exact.
Apply this identity to , , . By the intersection lemmas, . Since is trivial on , its -invariants are exactly
Moreover acts trivially on this module, so induction from to is precisely Harish-Chandra induction from . Substituting into each double-coset summand gives the boxed formula. This proves the formula for rational parabolics; it does not assume a general Mackey formula for nonrational Deligne-Lusztig induction.
For the special linear group , let , and choose a generator of the character group of . Every linear character of the diagonal rational maximal torus has a unique expression
The upper triangular Borel subgroup is rational. Consequently its Deligne-Lusztig induction is the actual principal series of a finite reductive group
where is the inflation of a group representation across . The geometric reason for this split case is : the associated torus covering supplies , and the auxiliary unipotent fibres contribute a single even cohomological degree, hence no minus sign.
The rational Bruhat decomposition indexes by . Applying the Mackey restriction formula and Frobenius reciprocity gives
Each intersection contains , and the two linear characters are trivial on its unipotent part. Its contribution is therefore one exactly when fixes , and zero otherwise. Complete reducibility over makes this character inner product the sum of squares of irreducible representation multiplicities. Thus the principal series of a finite reductive group is irreducible exactly when the Weyl group stabilizer is trivial.
To compute that stabilizer, represent by the triple . Two triples give the same linear character on determinant-one diagonal matrices exactly when they differ by a common factor . For example, triviality of on all such matrices first gives by varying , and then by varying . The Weyl group permutes the three entries.
A transposition fixes precisely when its two interchanged entries coincide: the third, fixed entry forces the common factor to be one. These three obstructions are , , and . A three-cycle can also fix without any two entries coinciding. Its common factor must satisfy ; in the nontrivial case the entries, up to order and common factor, are . This happens exactly when and .
The complete condition is therefore
In particular pairwise distinct coordinate characters alone are insufficient. For the only distinct triples have the order-three symmetry, and no character of this split rational maximal torus gives an irreducible principal series of a finite reductive group.
Write , and let be the entrywise th-power Frobenius endomorphism of an algebraic group on the general linear group . The algebraic closure is visible in the original PDF; it is lost in the converted TeX. Let be the diagonal maximal algebraic torus and the upper triangular Borel subgroup.
Choose with . Such a exists because is an algebraic closure, and . Put
Transporting the standard -model through the algebraic group automorphism gives a rational structure on an algebraic group over the same field . In particular these are genuine Frobenius endomorphisms of an algebraic group, and their fixed-point groups are
The auxiliary need not be rational for the original structure: it changes the identification with the geometric group, not the field over which the transported model is defined.
For either sign, take the rational maximal torus and Borel subgroup
Indeed for , so both subgroups are -stable. Conjugacy also preserves maximality of the algebraic torus and the property of being a Borel subgroup.
Finally,
Neither nor is central, so neither endomorphism is . If , surjectivity of on would imply that is central. But
is not scalar in any characteristic. Thus the two nonstandard rational structures have distinct Frobenius endomorphisms, including when .

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