For tangent vectors on a slice, the extrinsic curvature is . Differentiating and using metric compatibility gives . Since the connection is torsion-free,
The final equality holds because tangent fields on a hypersurface have a tangent Lie bracket. All normal components are projected out, so is symmetric. This is precisely hypersurface orthogonality implies symmetric extrinsic curvature; without an integrable tangent distribution the corresponding antisymmetric vorticity need not vanish.
Write for the induced metric. By definition of the spatial covariant derivative,
The spacetime Levi-Civita connection is metric compatible, so . The remaining terms contain either or , each zero because . Therefore
This verifies metric compatibility of the spatial covariant derivative directly, without assuming that the unprojected derivative of vanishes.
This question uses proper cosmological time . The future-directed unit normal is
The non-null hypersurface projection removes all normal components. The only relevant Christoffel symbols are . Since the components of are constant,
Consequently
With the printed positive extrinsic curvature convention, this is the expansion of the normal comoving congruence. A fixed coordinate cell has proper volume proportional to , so : the fractional proper-volume expansion rate.
The spatial momentum operator acts only on the plane wave:
Thus the modes have fixed canonical/comoving wavevector momentum, not fixed physical momentum. In the usual positive-energy field-mode convention the local physical momentum and energy are and . This agrees with conserved spatial comoving momentum and cosmological redshift proportional to .
The overall particle-action sign noted in (i) reverses the literal worldline canonical label relative to this usual mechanical momentum: it is for a future-directed particle with that printed action. The conserved plane-wave label therefore has the opposite sign if it is identified with that literal worldline label. This sign convention does not change the wavenumber magnitude or either conservation/redshift conclusion.
Put . Direct differentiation of the previous equation yields
In radiation domination, , and for a massless scalar field both extra terms vanish. Each nonzero Fourier mode therefore satisfies . The general real radiative solution is
Summing over both wavevector directions supplies the two traveling-wave solutions, with constant amplitudes. In infinite space the sum is replaced by the corresponding Fourier integral.
There is a qualification to calling the printed oscillatory expression completely general. At , , so rather than a single zero-frequency exponential. The zero mode of a radiation-era massless scalar is
A constant nonzero field is an immediate counterexample to the completeness of the fixed-amplitude oscillatory formula at zero wavenumber. Include this homogeneous term, or explicitly restrict the displayed plane-wave expansion to the radiative modes with no homogeneous background.
For signature , and . The scalar action becomes
Vary with compactly supported variations and integrate its derivative terms by parts:
Setting this coefficient to zero gives the Klein-Gordon equation in the expanding background:
The additional first-derivative term is the conformal-time expansion damping; the time coordinate here is not the proper cosmological time used in Question 2.
The mass-shell condition and imply , so the affine parameter is proper time up to orientation. Choose its future orientation. With conformal time ,
In a local comoving orthonormal frame both time and spatial coordinate intervals acquire the same factor , so the measured peculiar velocity is precisely . Thus the physical momentum obeys
The fixed vector direction also gives . With the conventional opposite overall sign for the affine particle action, the familiar comoving momentum is instead. The redshift law is identical under either sign convention.
The spatial coordinates are cyclic because the flat Friedmann-Lemaître-Robertson-Walker metric depends only on time. Differentiating the printed affine Lagrangian gives the canonical momentum
The Euler-Lagrange equations give , so
This is the conserved quantity associated with spatial translation invariance. The overall minus sign in the stated action makes this canonical covector opposite to the usual future-directed mechanical momentum; it does not alter the geodesic trajectories or the conservation result. The canonical momentum sign in the affine particle action will be kept explicit below.
Take and . The hypothesis is exactly the required initial domination . Applying the extension proved in part (ii) gives
with linear. There is no reason that must be nonzero; for instance forces .
This is the sandwich form of the Hahn-Banach theorem. Conversely, any linear map between these two functionals satisfies the stronger mixed domination, since . Thus the mixed inequality used during extension is the appropriate invariant, not an extra final restriction.
We prove the extension by Zorn's lemma, retaining the full domination condition. Consider all pairs extending , with a subspace and linear, satisfying for every . Order these pairs by extension. A chain has an upper bound: take the union of its subspaces and maps. The union is a subspace, and its map is well defined and linear because any finitely many vectors lie together in one member of the chain. Its domination is inherited there. Thus a maximal extension exists.
Suppose its domain is proper, and choose . A linear extension to has the form . Define the admissible values for a sandwich extension by
with and . Part (i) shows every quantity in the supremum is at most every quantity in the infimum, hence . Both bounds are real and finite: choosing zero vectors provides and , and the pairwise comparison then bounds them from the other sides. Choose .
For , positive homogeneity and the upper bound on , used with , give
For , the lower bound on applied to gives
which rearranges to . For this is the existing domination. Thus is a legitimate larger extension, contradicting maximality. The maximal domain is therefore all of ; call its map .
Setting the first vector in the domination to zero yields . Setting it to and the domain vector to yields . Consequently
The one-dimensional extension has checked both signs of its coefficient; positive homogeneity alone does not permit treating negative coefficients as positive ones.
The hypotheses make a sublinear functional and a superlinear functional. In particular . Apply the domination property to and the vector :
Subadditivity of , with the inserted vectors and , gives
Superadditivity of gives . Combining these inequalities and moving terms yields exactly
Every vector appearing in the comparison is permitted by the assumed domination, so no membership of in is needed.
The real space is a Banach space in the uniform norm: a uniformly Cauchy sequence has a uniform pointwise limit by completeness of , and that uniform limit is continuous. Each functional from the preceding part is bounded, but their norms are unbounded.
For integers , define
Each is closed, being an intersection of inverse images of closed intervals under continuous functionals. It has empty interior. Otherwise some ball would be contained in it. For every of norm at most one, both and would belong to that ball, so
Taking the supremum over would give for all , contradicting the preceding part.
Thus the are nowhere dense. The Baire category theorem says their union cannot cover . A function outside that union satisfies
so its Fourier series diverges at zero. In fact these functions form a dense subset of . This proves the relevant Uniform boundedness principle argument directly and establishes generic unbounded Fourier sums at a fixed point.
Use and normalized measure . The Fourier partial sum at zero is the real linear functional
where the Dirichlet kernel is
The quotient follows by summing the finite geometric progression, with its removable value . It is a real continuous periodic function. If
then . This bound is its exact operator norm even on the real continuous functions. Indeed, for set
It is real, continuous and periodic with norm at most one, and
by dominated convergence. At zeros of the kernel the integrand is zero, and elsewhere its limit is .
For , . Using evenness and putting gives
For the last inequality, split into the first complete intervals : their sine integrals are two and . The harmonic sum tends to infinity. This proves the Dirichlet kernel harmonic lower bound.
Choose with , then choose sufficiently small that . Thus
This constructs continuous near-maximizers, rather than using the discontinuous sign of the kernel as the desired function.
For each nonzero integer tuple , put
If its first coordinates are all zero, then and is empty. Otherwise it is a closed proper affine hyperplane. It has empty interior: from any of its points, an arbitrarily small displacement in the nonzero normal direction leaves it. Thus every is nowhere dense.
There are countably many integer tuples, and is complete. The Baire category theorem therefore makes the complement of their union dense and nonempty. Choosing any point there gives
Equivalently, are linearly independent over : multiplying a rational relation by a common denominator produces just such an integer relation. This is an instance of Baire avoidance of countably many affine hyperplanes.
The Baire category theorem states that in a complete metric space, a countable intersection of open dense sets is dense. Equivalently, a nonempty complete metric space cannot be a countable union of nowhere dense sets, where a set is nowhere dense if its closure has empty interior.
Here is the proof. Let be open dense sets and let be any nonempty open set. Choose a point and a radius such that the closed ball lies inside . Inductively choose in the nonempty open set , and then a radius such that
Thus the closed balls are nested and their radii tend to zero. For , both centers lie in , so . They form a Cauchy sequence. Completeness gives a limit , and closedness puts it in every . Consequently . As was arbitrary, the intersection is dense.
To obtain the equivalent formulation, take complements of the closures of the nowhere dense sets; those complements are open dense. Conversely, complements of open dense sets are closed with empty interior. In particular, a countable closed cover of a nonempty complete metric space must contain a set with nonempty interior.
The Pauli X gate interchanges the two basis quantum states. Because the bit-flip outcome is a classical unobserved error rather than a coherent superposition, the quantum bit-flip channel gives
For , its explicit density matrix is
For a pure reference quantum state, the square of the paper's quantum fidelity is . Therefore
With , the expectation is , the component of the Bloch vector. Hence
“All possible quantum states” is interpreted as the rotationally invariant uniform pure-qubit average, with measure . Thus
so the average pure-qubit fidelity of a bit-flip channel is
Equivalently, rotational symmetry gives , since a pure-state Bloch vector has unit length. The eigenstates are unchanged as density matrices and have fidelity one, while a computational basis quantum state has ; these provide checks on the angular expression. A uniform distribution in rather than in solid angle would produce the wrong ensemble average. The requested quantity is the mean squared fidelity, not the square of the mean unsquared fidelity.
Write and . A pure-state density matrix is a rank-one orthogonal projector, so and
Taking its square root and trace yields the unsquared quantum fidelity
Use unitary invariance of trace distance and fidelity to choose a basis of the span of the two quantum states in which and , with and . Choosing state-vector phases to make the coefficients nonnegative does not change either density matrix. On that span,
Its eigenvalues are and , with zero eigenvalues on the orthogonal complement. The positive square root of therefore has two eigenvalues , so the trace distance is . Thus the pure-state trace distance and fidelity identity is
Identical pure quantum states give ; orthogonal pure quantum states give . If the span is one-dimensional, the identical-state result follows directly, so no second basis vector is required. This formula uses the unsquared fidelity convention in the paper; if fidelity denotes squared overlap instead, the square inside the formula is omitted.
For a positive operator , the spectral theorem writes with . Hence its unique positive square root of an operator is . Conjugating this spectral decomposition shows for a unitary operator .
Let and . Then and . The square-root covariance and the cyclic property of the trace give
For the quantum fidelity, covariance first gives . Therefore
Apply the same square-root identity and the cyclic property of the trace to obtain
Thus unitary invariance of trace distance and fidelity gives
The same acts on both quantum states: these quantities depend on the relative distinguishability of the quantum states, not on a choice of basis.
Use a concatenated quantum error-correcting code: each of the five outer-code qubits is encoded in its own five-qubit inner block. Independent physical errors and ideal inner correction make each decoded block act as one outer qubit with error probability . Errors in distinct inner blocks remain independent in this model. Outer recovery succeeds if at most one of the five decoded blocks is bad, giving
Thus the two-level logical failure probability is
This improves the leading error order from for a bare qubit to for one level and for two. At least two physical errors must occur in each of two different inner blocks to defeat the prescribed two-stage decoder. Many error patterns with more than one error in the full 25-qubit register are therefore corrected: one error in each of all five blocks is removed at the inner level, and a single failed inner block is corrected at the outer level. Concentrating several physical errors in one block can be easier for this decoder than placing two errors in each of two blocks.
More generally, levels use physical qubits with recursion . For , one has . Repeated concatenation decreases to zero: its limit must be a fixed point of the continuous function , and below the only fixed point is zero. A simple quantitative bound is , obtained by the union bound over the ten pairs of possible error positions. Induction gives
which proves rapid suppression when ; the exact threshold is the larger value . Above this recursion amplifies errors instead.
Figure 1.
One and two levels of ideal five-qubit error correction below and above the transmission-error threshold
. Details.
Below threshold, concatenation suppresses logical errors while allowing an entire bad inner block to be corrected at the next level. The cost is additional physical qubits, gates, syndrome extraction and recovery. The calculated threshold concerns the independent transmission-noise model with perfect encoding and recovery; including noisy operations or correlated channel errors requires a different error analysis.
Assume independent physical-qubit errors with common probability , ideal encoding and recovery, and the specified rule that every block with two or more errors fails. The number of physical errors has a binomial distribution with parameters . Correct recovery occurs for zero or one error, so
The corresponding logical failure probability is
An unencoded qubit succeeds with probability . Thus encoding improves this probability precisely when . Factoring gives
On , the sign is the sign of . Its derivative is : it is positive until and negative afterwards on . Since , and its interior maximum is positive, there is exactly one zero in . The five-qubit concatenation threshold is therefore
At the two success probabilities agree; above it this decoder makes the error rate worse. At both schemes succeed perfectly, and at both fail under the stated error model. The small- behavior exhibits cancellation of every single-qubit-error contribution.

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