If a common recovery quantum channel with Kraus operators restores every pure code state after each error , then each vector is parallel to . Linearity on basis vectors and their pairwise superpositions forces , with the scalar independent of the logical state. Insert between two error operators to obtain the displayed Knill--Laflamme condition. This proves necessity without presuming an orthogonal syndrome description of recovery.
Nonlinear compact operator Created 2026-10-25 Updated 2026-10-31
A nonlinear compact operator between Banach spaces is a continuous map that sends every bounded set to a relatively compact subset. Thus every bounded sequence of inputs has a subsequence whose images converge in the target norm. No linearity is assumed. On a bounded domain of definition it suffices that the entire image be relatively compact. For linear operators, this recovers the usual compact operator notion.
Nonlinearity 2026-11-05
Nonlinearity is failure of the linearity conditions appropriate to the objects being studied. For a function between vector spaces over the same field, being a linear map means
for all and all scalars . A function is nonlinear in this sense if even one permitted choice violates the identity. The spaces and their operations are therefore part of the claim.[ref]
For with , choose and . Then
The extra term in explains the failure of superposition. Doubling an input also multiplies its squared output by four, rather than two.
A straight-line graph alone does not establish linearity in linear algebra. The affine map has a straight-line graph but , whereas every linear map sends zero to zero. Its translated change is linear in the increment . This distinction matters when a physical instrument has an offset or a model is expressed relative to a nonzero operating point.
A nonlinear function can still have a useful local linear approximation. For the same square function,
The derivative at3 gives the linear increment , while the exact omitted term is . At , the actual change is0.0601 and the linear prediction is0.06. At , the actual change is7 and the prediction is6. Local accuracy over small increments does not turn the original function into a linear map. It states that the nonlinear remainder is small on a specified scale.
Orthogonal complement for a bilinear form Created 2026-10-14 Updated 2026-11-05
For a bilinear form on a finite-dimensional vector space , the right bilinear orthogonal complement of a vector subspace is
It is a vector subspace by linearity in the second argument. For a general nonsymmetric bilinear form, left and right complements must be distinguished.
If is a nondegenerate bilinear form, the map is a linear isomorphism from to its dual space. It identifies with the annihilator of a vector subspace , giving
If is also a symmetric bilinear form or an alternating bilinear form, reversing a zero pairing preserves zero. Hence , and the dimension formula gives equality. Nondegeneracy of the ambient form is required for this double-complement conclusion. For the zero bilinear form, every complement is all of , so a proper cannot be recovered that way.
Even in a nondegenerate ambient space, the restricted form can be degenerate. For on , the line equals . In general, for a symmetric bilinear form or an alternating bilinear form, the restricted radical of a bilinear form is ; quotienting by this radical of a bilinear form gives a nondegenerate bilinear form.
Taking the Laplace transform, using linearity and the preceding three formulas, gives
Since , division by gives for in the domain of convergence. There is no genuine singularity at : continuity of the Laplace transform there supplies the same value. One can also first work with , where division is harmless.
The formula in part (iii) identifies as the Laplace transform of . By uniqueness of the Laplace transform,
As a direct check, and . Any two solutions of this initial value problem differ by and have the same initial value, forcing . This also verifies uniqueness independently of transform inversion.
The adjoint on an inner product space is characterized by
Here is a finite-dimensional construction that supplies every required basis fact. If is any basis, its coordinate linear functionals form a basis of : a linear functional is uniquely specified by its values on these vectors. Hence . The linear map
is injective, because implies , and positive definiteness implies . Equal dimensions make an linear isomorphism. If is the dual map, then
This establishes existence and linearity. If two possible vectors represent the same linear functional through the inner product, then , so . Applied to every argument, this proves uniqueness of the adjoint on an inner product space.
For linear maps , two applications of the defining inner product identity give
Uniqueness therefore gives . Likewise , for real , and . An induction gives , and applying additivity to a polynomial with real coefficients gives
Symmetry of the real inner product also gives . If is the minimal polynomial of , the displayed identity gives , so the minimal polynomial of divides . Applying the same argument to gives reverse divisibility. Both polynomials are monic, hence their minimal polynomials are equal.
The distinct eigenvalues are exactly the roots of the minimal polynomial in the chosen field. An eigenvector with eigenvalue satisfies , so . Conversely, if and were a linear isomorphism, then would imply , contradicting minimal degree. Thus is not injective, giving an eigenvector. It follows that and have the same distinct eigenvalues. This includes the complex eigenvalues after complexification of a real vector space; over the real field it states equality of their real eigenvalues.
Write the arbitrary initial pure state as
The reference vectors need not be normalized or orthogonal. By linearity, the same quantum teleportation calculation, with the identity operator on , gives the post-gate quantum state
Thus each outcome still has probability . Bob's Pauli gate correction leaves the normalized joint quantum state
All operations act trivially on , so the result is independent of its holder or location. This establishes teleportation as an identity channel on a reference, preserving quantum entanglement with the untouched reference. Since every corrected branch is the same, discarding the classical outcomes also leaves the required joint density matrix.
Linearity follows from linearity of differentiation and point evaluation. For a test function supported in a fixed compact set , its value and derivative vanish at any point outside . Therefore
This proves the continuity estimate with and for every . Thus the stated mapping is a distribution of order at most one, supported in . In particular, a sequence tending to zero in the test function topology has both and .
The infinitesimal strain tensor and the divergence are linear in . Consequently the given is a symmetric bilinear form, and
For a matrix-valued function, here uses the Frobenius inner product pointwise and then the L2 norm. All expressions are finite for .
Expand the quadratic term at . The linearity of cancels its contribution to the difference, giving
For , this is nonnegative. Therefore
so is a convex functional on the whole Sobolev space. No boundary condition is needed for this conclusion. The argument uses nonnegativity of the quadratic term; uniqueness on the zero-boundary Sobolev space will instead use the Korn inequality in part (b).
Put and define the image term . The key step is to verify that inversion preserves the Stokes streamfunction equation for irrotational flow. Direct differentiation gives
where the quantities on the right are evaluated at . Hence
By linearity, obeys the same equation and describes an incompressible flow and an irrotational flow wherever the original exterior flow is regular.
On the sphere, and the two terms cancel identically:
Thus the sphere is a stream surface and satisfies the no-penetration boundary condition. Tangential slip is allowed in this potential flow model. For every finite , the image argument satisfies , where has no singularities. The prefactor is regular there. Therefore the construction creates no new finite exterior singularities; any original exterior singularities remain those of the prescribed incident flow. This is the sphere theorem for a Stokes streamfunction.
For the far-field claim, the stated bound gives
One must compare velocities, rather than require the correction to the Stokes streamfunction to tend to zero. Smoothness at the original origin, together with , gives and there. Thus and , and the correction has
These estimates hold away from the coordinate poles, with the regular-axis limits supplied by the original smooth physical flow. Consequently
The far-field velocity field is unchanged. For a fully smooth incident velocity field at the origin, the usual regular expansion is stronger and makes the sphere disturbance decay as .
Let . The end-wall forcing has transverse factor , which already satisfies both fixed-wall Neumann boundary conditions. By linearity and separation of variables, seek its periodic response as
Substitution into the wave equation and the moving-wall condition gives
The acoustic waveguide cutoff is therefore
It is the lowest nonzero transverse-mode frequency. The uniform transverse mode has no cutoff, but is not excited here because .
For , put . The axial equation has solutions . Boundedness removes the growing exponential, and fixes the coefficient. Thus
This evanescent wave oscillates in time but decays with penetration length . Its axial velocity is proportional to , while its excess pressure is proportional to . They are in phase quadrature, so their mean product, the axial acoustic energy flux, is zero.
For , put . The axial solutions are . The outgoing condition selects for the chosen time convention, and
Taking the real part gives
Its axial velocity is , so the moving-wall condition is satisfied with the correct sign. This is a traveling acoustic waveguide mode carrying energy toward positive . Its dispersion relation is
The larger axial phase velocity does not imply faster energy transport: the group velocity controls that transport.
At , the axial equation becomes . The imposed nonzero derivative forces a constant, which is unbounded. Thus there is no bounded periodic response at exact cutoff for this infinite, undamped, velocity-driven model. The divergent coefficients as or also show why the assumed small perturbations fail sufficiently close to cutoff at fixed forcing. Initial conditions can add free transients; the displayed formulas give the selected periodic forced response.
Figure 1.
An oscillating end wall excites either an evanescent disturbance or an outgoing acoustic wave
. The transverse shape is . Below cutoff, the normalized axial potential decays exponentially; above cutoff it oscillates downstream with an outgoing phase. The right panel shows the common cutoff and the propagating dispersion branch. Details.
A charge-coupled device converts absorbed photons into stored charge in semiconductor potential wells. An exposure accumulates a pixelated image; clocked electrodes transfer rows toward a serial register and output amplifier. Quantum efficiency, pixel sampling and optical throughput connect collected photons to the expected signal. In ordinary optical imaging it primarily counts photoelectrons rather than independently measuring every photon's energy.
The CCD noise budget combines source and sky shot noise, dark-current fluctuations and read noise. For an aperture containing pixels, known background expectation , total dark expectation , source expectation and per-pixel read noise ,
Estimating the background from a finite separate region adds its own uncertainty. Cooling reduces dark current; longer integration reduces the relative importance of one read but can encounter saturation, cosmic rays or changing conditions. Full well capacity, amplifier gain, linearity, blooming and charge-transfer efficiency limit useful detector dynamic range.
Bias frames establish the electronic offset; matched dark frames characterize time- and temperature-dependent dark signal. Flat fields calibrate pixel-to-pixel response and illumination, with appropriate attention to wavelength. Bad-pixel masks, repeated exposures and dithering help reject defects and cosmic rays. A calibrated PSF and astrometric solution are needed for reliable photometry and positions. High quantum efficiency and stable linear integration are advantages, but an uncalibrated count array is not yet an astronomical flux map.
Both terms in the graph norm are finite and nonnegative. Moreover, forces , hence ; conversely gives . This proves definiteness of a norm.
The linearity of and absolute homogeneity of a norm give, for each real ,
Applying the triangle inequality in both normed spaces gives
Thus
Let be a Cauchy sequence in the graph norm, and set . Since
is a Cauchy sequence in the Banach space . Write .
Use the bounded right inverse to remove the part seen by :
Thus , and the operator norm bound gives
The assumed completeness of supplies with in . Put . The linearity of and the right inverse identity give . Therefore
We have proved the completeness of a graph norm from a bounded right inverse:
Let be the Holder conjugate exponent of , with . The indicator function has Lp norm in , including the value one when . The Holder inequality therefore gives
The Lebesgue integral is unchanged by equality almost everywhere, so is well-defined on the Lp space; its linearity and the bound put it in the continuous dual space .
For , the function has Lp norm one and satisfies
For , use , whose L-infinity norm is one and whose image is . Thus all endpoints are included in
Put , the common operator norm from part (b). Given , choose with . Since , the scalar limit of exists. The Cauchy criterion for a function limit gives such that
Using the triangle inequality and the uniform operator norm bound,
This is the requested estimate. The completeness of makes the scalar Cauchy criterion for a function limit sufficient, hence exists and .
For and real , the linearity of gives , which also has a limit. Thus is a linear subspace. The preceding argument shows it contains every norm convergence limit of its sequences, so the sequential criterion for closed sets in a metric space gives
Write for bitwise exclusive or. Both quantum registers begin in . After the first Hadamard transform their joint quantum state is
The quantum oracle maps each component to . By linearity, the required quantum state is therefore
The different first-register computational-basis states are orthogonal, so there are orthogonal joint components of squared probability amplitude , even though some second-register values coincide. Thus the displayed quantum state is normalized.
For one input bit, a Boolean function is specified by the pair , and counts its satisfying assignments. In the ordered computational basis , the supplied phase oracle convention gives
Here is exclusive or: the oracle changes the sign of the inputs with . With the identity matrix and the Pauli Z gate, all four cases are
The two middle cases are balanced Boolean functions; the others are constant functions. The specified zero-state sign change and the Hadamard gate are
Use the top qubit as the first tensor product factor. Write the controlled unitary gate as . Reading the bracketed quantum circuit from left to right, its four operations are , , , . Thus the target operation in its control-one branch is
where the rightmost matrix acts first. The control-zero branch is the identity operator. The Hadamard conjugation of a controlled gate identity gives
Indeed, on control zero the replacement applies to the target, while on control one both sides apply . By linearity, the identity holds on every quantum superposition and therefore in every repetition of the bracket. This replaces the two internal controlled Hadamard gates as a pair.
The global phase of a controlled quantum gate must be preserved: , whereas . Consequently the minus signs in and the special phase oracles cannot be discarded as an unobservable global phase of the complete quantum circuit.
Let and be normalized qubit states. By linearity, the SWAP gate gives
The output remains a product state. Single-qubit unitary operators also preserve product states, so an induction over any quantum circuit made from these operations shows that it cannot create quantum entanglement from a product state. Equivalently, moves every exchange through the local operations, leaving only local gates and a permutation of wires. This is the product-state obstruction to SWAP universality.
Consequently SWAP gates and arbitrary single-qubit gates do not form a universal quantum gate set. For example, they cannot map to the Bell state , whereas a Hadamard gate followed by a CNOT gate does so.
The required identity is CNOT control reversal in the Hadamard basis. To derive it using standard quantum circuit identities, let be the Controlled-Z gate, which multiplies by and fixes the other computational-basis states. Since ,
The Controlled-Z gate is symmetric in its two wires. Combining this symmetry with gives
This is an exact operator identity, including its global phase, and applies to arbitrary inputs. One can also check it directly from the orthogonal projectors : conjugating by gives
For the three-wire quantum circuit, put . Conjugation distributes over products because : . Each CNOT gate in therefore reverses direction, while the Hadamard gates on untouched wires cancel. The Hadamard-conjugated linear oracle is
These are the simplified quantum circuits in the figure: for there are no gates; for there is ; for there is ; and for there are both. The ancilla qubit becomes their common control. On every computational-basis state, the entire simplified circuit acts as
Starting the data qubits at , the prescribed computational basis preparation of the ancilla qubit must therefore be : it activates the required flips and gives . Starting it at instead gives for every , so no information is obtained.
More generally, an initial ancilla qubit state in this same fixed quantum circuit gives
For nonzero , the desired data output has probability , and exact identification for every requires . This condition refers to the displayed ancilla preparation for the Bernstein-Vazirani algorithm: the state entering the function oracle must be , up to global phase. Other quantum state preparation procedures that deliver this same state are equivalent; is the prescribed input before the first Hadamard gate.
For arbitrary , linearity of the linear Boolean function supplies
This decomposition is for analysis: the Bernstein-Vazirani algorithm calls the unknown function oracle as one supplied operation. The common control starts at , so the simplified quantum circuit takes to . Equivalently, phase kickback gives a product state
which the final Hadamard transform decodes to . Thus one quantum oracle call suffices for every , compared with classical calls. This counts function oracle uses; the surrounding Hadamard gates and final computational-basis measurement still act on and qubits, respectively.