Affine maps preserve affine combinations Created 2026-10-14 Updated 2026-10-31
For coefficients with sum one, the defining identity follows from linearity:
The translation appears once on both sides precisely because . In particular, midpoints map to midpoints, and a parameterized line segment , , maps to . A whole line has the same formula with ; its image is a line if , and a single point otherwise.
Suppose a family of linear operators, including its limiting operator, is pointwise dominated by a sublinear operator of weak type (1,1). Convergence almost everywhere on an -dense subspace then extends to every input. Approximate the input by errors of norm at most . The weak estimate and the Borel-Cantelli first lemma make the corresponding domination errors tend to zero almost everywhere. Linearity bounds the difference between the full and approximating convergence errors by twice that domination error. This argument does not need an uncountable supremum to be measurable.
Antiunitary time reversal preserves the energy spectrum Created 2026-09-24 Updated 2026-11-05
For antiunitary , conjugate linearity gives . Differentiating
therefore yields . Time reversal maps an energy eigenspace to itself and creates no negative-energy instability.
Bilinear form Created 2026-09-24 Updated 2026-10-14
A bilinear form takes two vectors in a vector space over a field and returns a scalar in . Its defining property is separate linearity: holding either input fixed gives a linear functional of the other. For scalars and vectors ,
This is a scalar-valued bilinear map; the chosen field is part of the definition.[ref]
Separate linearity does not mean that is a linear map on the vector space with componentwise vector addition and scalar multiplication. Over the real numbers, , whereas a linear map on the pair would give . The simplest example is on the one-dimensional vector space : fixing gives , but doubling both and quadruples their product.
A bilinear form measures how two inputs interact. The dot product measures alignment; a symmetric bilinear form can describe a quadratic form; an alternating bilinear form can measure signed area. A nondegenerate bilinear form turns each vector into a unique linear functional and so connects geometry with the dual space. The same short definition therefore supports lengths, bilinear orthogonal complements, and symplectic vector spaces, depending on the additional properties imposed.
Over the complex numbers, a bilinear form is linear in both inputs without conjugating either scalar. A Hermitian form instead is a sesquilinear form and conjugates when its inputs are exchanged. For complex matrices, the adjoint used with Hermitian forms and matrix C-star algebras is the conjugate transpose, whereas a bilinear form uses the ordinary transpose . For example, has , while the Hermitian form has .[ref]
Bit-flip repetition code Created 2026-09-28 Updated 2026-10-14
The -qubit bit-flip repetition code stores one logical qubit in and . Its stabilizer generators are for , and its logical operators are and . Interchanging the Pauli X gate and Pauli Z gate gives the phase-flip repetition code. For odd , majority-vote decoding of a repetition code corrects up to physical Pauli X gate errors, assuming ideal operations and a noise family containing only these bit flips.
For , prepare two quantum ancillas in and apply controlled-NOT gates from the input qubit to each of them. By linearity, encoding sends
This does not produce , which would contain cross terms. For example, encoding produces , whereas three independent copies would have eight equal computational basis amplitudes. The encoding creates quantum entanglement when both coefficients are nonzero and respects the no-cloning theorem.
The three-qubit bit-flip syndrome table corrects the family and its entire linear span, as specified by the Knill--Laflamme condition. It cannot correct arbitrary errors on one physical qubit: the phase flip
commutes with both checks and acts as logical . In particular, it takes the encoded to the orthogonal encoded with error syndrome . Thus its full quantum code distance is one, despite correcting one error of the restricted Pauli X gate type. The Shor code, Steane code and five-qubit error correcting code provide protection against arbitrary one-qubit errors.
Choi reconstruction formula Created 2026-10-05 Updated 2026-11-05
With normalized Choi state and the output factor first,
Expand . The partial trace multiplies each coefficient by , reconstructing by linearity.
Conditional Jensen inequality Created 2026-10-05 Updated 2026-11-05
Let be a real integrable random variable, let be a sub-sigma-algebra, and let be a finite convex function with integrable. Then
almost surely. These explicit integrability assumptions make both conditional expectations well defined.
A finite convex function on the real line is the supremum of a countable family of supporting affine functions, for example choosing supports at rational points and using continuity. Write them as . For each , monotonicity and linearity of conditional expectation give . Countability permits one exceptional null set for every . Taking the supremum proves the inequality.
With and square-integrable , the inequality says that retaining only the information in cannot increase its second moment. More generally it is the convex-loss step behind the Rao-Blackwell theorem.
Controlled unitary gate Created 2026-09-24 Updated 2026-11-05
A controlled unitary gate applies a unitary operator to a target system when a control qubit is , and leaves the target unchanged when the control is :
For a coherent control, linearity gives
The control has not been measured; the output may be entangled. The controlled-unitary entangling criterion states exactly when some product input becomes entangled.
The global phase of a controlled quantum gate matters: if , then acts as a phase gate on the control. A phase invisible on the isolated target is a relative phase between control branches. [ref]
Convergence on a dense subspace under a uniform operator bound Created 2026-10-25 Updated 2026-10-31
Let , , be bounded linear operators from a normed space into a Banach space, with . If converges as for each element of a dense subspace , then converges for every . The limit defines a bounded linear operator with .
For , the triangle inequality gives
Approximate by and use the Cauchy criterion for a function limit on . The completeness of supplies the limit; passing to the limit preserves linearity and the bound. When every limit on is zero, the inequality shows .
Cyclic property of the trace Created 2026-09-24 Updated 2026-10-14
If is an -by- matrix and is an -by- matrix over the same field, both products are square matrices and
The products can even have different sizes: for and , and , but both have trace .[ref]
Grouping all but one factor proves that is unchanged by a cyclic permutation whenever the cyclic products are defined and square. In particular, every commutator has trace zero, since by linearity.
Cyclic rotation does not allow arbitrary reordering. For
one has , so , but , so . Rotating to or preserves its trace; swapping just and need not.
The degree of precision of a quadrature rule is the largest integer such that for every polynomial of polynomial degree at most . By linearity, checking the monomials suffices. Exactness for one higher-degree polynomial alone does not raise this degree: every lower polynomial degree must also be covered.
Determinant Created 2026-09-24 Updated 2026-10-14
The determinant assigns a scalar to a square matrix. For a linear map on the real plane, it measures signed area scaling: its absolute value tells how much area grows, and its sign records whether the orientation of a vector space is preserved or reversed. In three dimensions, the same idea measures signed volume. Over a field, a square matrix is an invertible matrix exactly when its determinant is nonzero. These are two views of one phenomenon: losing an independent direction collapses full-dimensional volume and makes the original input impossible to recover uniquely.[ref]
Start with an explicit matrix and its action on a vector:
The columns are the images of the standard basis vectors: and . Consequently the unit square with corners becomes the parallelogram with corners . Its area is five. Every small patch of this square undergoes the same linear map, so the factor describes the whole deformation, rather than just one specially chosen boundary. The matrix mixes horizontal and vertical components, but its determinant compresses that combined effect into one area factor.[ref]
Now exchange the columns:
The parallelogram occupies exactly the same region, but its generating vectors arrive in the opposite order. Moving from the first column to the second now turns clockwise rather than counterclockwise. Ordinary area remains five; the oriented volume in two dimensions changes sign. A negative determinant therefore signals reversed orientation of a vector space, not a negative amount of material. Keeping the sign makes successive reversals calculable: two reversals restore the original orientation of a vector space.
Compare a singular matrix:
Its columns are linearly dependent: the second is twice the first. The unit square collapses onto the segment from to , which has zero area despite nonzero length. Since , the kernel of a linear map contains a nonzero vector; inputs differing by that vector have identical outputs. The collapsed picture explains why an inverse matrix cannot exist.
Figure 1.
The unit square, determinant five, reversed orientation, and collapse to zero area
. Details.
For , recovery is possible, and the complete matrix multiplication check is
Here is the identity matrix. The inverse matrix restores the original square, shrinking its area by . Generally, the adjugate identity gives whenever the determinant is nonzero over a field; this is why the denominator matters.[ref]
The multiplicativity of the determinant describes two successive deformations. Matrix multiplication means that applies first, then . Take
The first linear map doubles area; the second multiplies the resulting area by five. Thus the unit square passes through areas , with the last parallelogram bounded by . Direct calculation agrees:
This explains physically why area factors multiply instead of adding. The general identity holds for square matrices of the same size, including singular matrices. If either stage loses a direction, later processing cannot recover the discarded information.[ref]
Figure 2.
Successive linear maps multiply area factors: one becomes two, then ten
. Details.
The same interpretation works in three dimensions without drawing a new picture. The diagonal matrix
sends the unit cube to a rectangular box with side lengths two, three, and one. Its ordinary volume is six. The minus sign comes from reversing the third direction, so the oriented volume is minus six. Replacing the last diagonal entry by zero flattens the cube into a planar region: its area may be positive, but its three-dimensional volume is zero. This distinction matters whenever a linear map changes shape: the determinant measures size in the full input dimension, rather than the size of whichever lower-dimensional object remains.
The determinant measures neither trace nor perimeter. For , the trace happens also to be five, but the identity matrix in two dimensions has trace two and determinant one. The first parallelogram above has perimeter , compared with four for the unit square; boundary length follows a different rule. Nor does determinant one require every length to stay fixed: the diagonal matrix preserves area while stretching one direction and compressing the other.
These properties make the determinant useful when coordinates obscure what a deformation does. A nonzero determinant certifies that linearly independent input directions remain distinguishable; its magnitude counts the area or volume represented by a transformed cell. That second role reappears in the change of variables formula, where the Jacobian determinant corrects the sizes of small cells. Signed volume also separates a deformation that reverses the orientation of a vector space from one that merely stretches it, even when both give identical ordinary volume factors.[ref]
For general , regard the columns as ordered arguments. The determinant is the unique alternating multilinear map to the scalar field normalized by . The multilinearity of the determinant means linearity in each column separately, with all others held fixed:
Alternation means equal columns give zero; exchanging columns negates the result. Normalization sets the oriented volume of the standard basis to one. These properties also hold in rows. For real three-dimensional columns, their determinant is the scalar triple product, and its absolute value is the enclosed volume. Over other fields, the algebraic definition still works even without a geometric notion of positive volume.[ref]
Separate linearity does not mean the determinant is a linear map on the whole matrix. Scaling every column of an -by- matrix by gives . For our two-dimensional example, : doubling both directions quadruples area. The power records how many independent directions are being scaled together.
The properties suggest practical computations. Adding a multiple of one column to another preserves the determinant: the extra term has repeated columns and vanishes. This is the algebra behind an area-preserving shear mapping. Alternatively, expansion along a row uses cofactors, each a matrix minor multiplied by a sign:
where deletes row and column . The Leibniz formula for determinants supplies the general entry formula. Both calculations encode the same geometric invariant; the defining properties explain their structure without requiring memorization of a separate recipe for every size.[ref]
The motivating observation is that inserting an insulating material between fixed capacitor plates increases its capacitance. [ref]. To investigate this response, use two flat parallel metal electrodes with measured overlapping area and separation , a uniform specimen filling the gap, and an instrument that measures electrical impedance. Record the capacitance with and without the specimen at the same small applied electric potential difference, frequency and temperature, after capacitance measurement calibration. An increase in corrected capacitance indicates a larger permittivity, provided the geometry is unchanged. A guard electrode reduces the contribution of the fringing field of a capacitor. [ref].
For negligible dielectric loss in the parallel-plate capacitor approximation,
An air reference approximates ; it is not an exact vacuum reference. For the following synthetic example, stipulate , and the rounded vacuum permittivity . Then in this model, and relative permittivity four gives . A residual parallel capacitance of would make an uncorrected sample/reference ratio , rather than four. This additive error does not cancel in a ratio.
Figure 1.
Synthetic capacitance response to relative permittivity and frequency
. Left: the ideal scalar capacitance and a hypothetical additive stray capacitance of . Right: a hypothetical dielectric relaxation model, with , for the same geometry. The solid curve is the parallel capacitance ; the dashed curve is the loss component , not an independently measured storage capacitance. Every plotted value is synthetic. Details.
At nonzero frequency , measure both magnitude and phase of the electric current relative to the applied electric potential difference. Define , where is electrical impedance. For the stated complex permittivity convention, the ideal uniform specimen gives
Thus a parallel capacitor and electrical conductance describe the readout at that frequency; a single scalar capacitance cannot describe both components. The diagram's assumed dielectric relaxation gives and at . These are model predictions, not observations.
Repeat the reference measurement after removing the specimen and vary the small applied electric potential difference to test drift and linearity. Record specimen thickness, electrode area, contact conditions, frequency and temperature. Air gaps act as additional layers in series and can lower inferred relative permittivity; roughness, uncertain thickness and the fringing field of a capacitor limit the geometric formula. At sufficiently high frequency, the fixture itself changes the electromagnetic field, so low-frequency guarding and a lumped capacitor model require reassessment. [ref].
Let be the vector space of real polynomials of degree of a polynomial at most . Choose distinct real sample points and positive real weights . Then
is an inner product. Symmetry and bilinearity follow from linearity of polynomial evaluation. Its value at is nonnegative, and equality forces all . By the root bound for a polynomial, a nonzero polynomial of degree of a polynomial at most cannot vanish at distinct points. Thus the form has positive definiteness.
Equivalently, the polynomial evaluation map on a finite point set identifies with , equipped with a weighted Euclidean inner product. Too few sample points destroy positive definiteness: if the distinct points number at most , the nonzero polynomial lies in and has zero sampled squared norm.
For three equally weighted samples at , an orthonormal basis is
This construction gives a finite sampling version of orthogonal polynomials and permits exact Gram-Schmidt orthogonalization using only finitely many evaluations.
If linear operators have a common eigenbasis , then has the corresponding eigenvalues , counting algebraic multiplicity. This follows directly from linearity on each basis vector. The pairing is determined by the common eigenvectors; it is not the collection of all pairwise sums of arbitrary eigenvalues.
Electric polarizability Created 2026-10-14 Updated 2026-11-05
Electric polarizability relates an induced electric dipole moment to an applied electric field. In a weak-field model with linearity, . A tensor response allows different electric field directions to induce electric dipole moments in different directions. A response that changes with molecular rotation enables rotational Raman spectroscopy.
Electric susceptibility Created 2026-10-14 Updated 2026-10-20
The dimensionless quantity relating induced electric polarization to the internal electric field through in the static scalar model. It describes the material contribution; relative permittivity includes the vacuum term as well, . Zero electric susceptibility gives , not zero permittivity.
The scalar assumes a local response with linearity and isotropy, settled electric polarization, fixed material conditions, and no residual electric polarization at zero electric field. It relates to the averaged total internal electric field, which already includes the field of the bound electric charges. It does not relate to the field the external electrodes would produce in vacuum. The distinction is essential for a self-consistent calculation.[ref]
Substitute the scalar relation into the definition of electric displacement field:
Comparison with proves and . Both and have units , so is a dimensionless quantity. In a stipulated static model with , : at a prescribed internal electric field, the material contribution is twice . This is a hypothetical response, not a measured material constant. The electric susceptibility is a convenient bridge from microscopic dielectric polarization to a macroscopic capacitance measurement, but it is not a measure of electrical conductivity.
Energy eigenspace Created 2026-09-24 Updated 2026-10-14
The energy eigenspace at is the vector subspace
where is the Hamiltonian operator and is the identity operator. It is nonzero exactly when is an energy eigenvalue. Its dimension is the multiplicity of that energy eigenvalue; degenerate energy levels have multiplicity greater than one. The ground-state subspace is , and its dimension is the ground-state degeneracy. A vector in an energy eigenspace need not be one of a specially chosen orthonormal basis of energy eigenstates.
Linearity makes the useful point immediate: if and , then . Every normalized nonzero combination stays in the same energy eigenspace. For a time-independent Hamiltonian operator, its evolution is multiplication by the common global phase , so it is a stationary state. A quantum superposition within a degenerate energy eigenspace can change spatial shape when its coefficients are chosen differently, but its density does not subsequently beat under this unchanged Hamiltonian operator.
Across distinct energy eigenspaces, relative quantum phases evolve. For orthonormal eigenfunctions of the Hamiltonian operator with energy eigenvalues , an equal-weight quantum superposition has
and position probability density
The interference term can change local probabilities even though the Born rule assigns the same time-independent probability to each energy measurement outcome. Orthogonality makes its integral zero, preserving wavefunction normalization. This pure state is not a stationary state; some particular measurement distributions may nevertheless remain constant. An incoherent mixed state with the same energy populations has no such interference term.
Figure 1.
An excited energy eigenstate can be stationary while a two-energy superposition beats
. Exact infinite square well densities, not measured data, with and . The left panel shows the unchanged density of the second energy eigenstate at three times. The right panel shows a coherent equal-weight quantum superposition at ; its energy populations remain . The dashed curve is the density of the corresponding incoherent mixed state. Details.
For the pictured infinite square well, and the interference repeats after . At , direct integration gives ; halfway through the period it is . This is a moving expectation value, rather than a trajectory of an individual particle. The distinction between an energy eigenspace and a combination of different energy eigenspaces is what makes the different behavior possible.
For a constant and a polynomial , the product rule gives . Iteration and linearity prove the displayed identity. In particular , which reduces a repeated-root constant-coefficient linear ordinary differential equation to repeated integration.
The New Jersey Institute of Technology's Lab 2: FM Modulation, Demodulation and Bessel Zeros, Part I, prepares a voltage-controlled oscillator in low-frequency mode. A frequency counter reads its output while a buffered constant electric potential difference calibrates its sensitivity. Sweeping the control voltage checks linearity; the calibrated gain is then held fixed.[ref]
An audio oscillator replaces the constant control voltage. An oscilloscope displays the signal and its FFT frequency spectrum together. Zero modulation supplies a carrier reference. Increasing message amplitude reveals sidebands, compares their heights with the carrier, and locates a carrier minimum. These readouts test the spectrum and infer frequency deviation. This is a student procedure, not a report of measured results.[ref]
A carrier minimum is a minimum of one Fourier coefficient, not disappearance of the whole signal. In the ideal model the first positive zero of is approximately , while the wave envelope remains . The lab's introductory special-cases paragraph agrees with this rounded value; step T12 mistakenly repeats the equal-sideband value for the carrier zero.[ref]
The interpretation also has practical limits. A finite recording limits frequency resolution; inadequate sampling can cause aliasing; and nonlinear VCO response can introduce extra components. Keeping the gain fixed and first checking linearity helps distinguish those effects from a change in FM modulation index. The diagrams above are independent model calculations, not laboratory measurements.