Between 1600 and 1900, algebra broadened from arts of working with unknown quantities and solving equations into the study of several systems of symbolic operations and increasingly general algebraic structures. This was neither a single change of definition nor a clean replacement of one subject by another. Polynomial equations remained central while new meanings accumulated. The competing terms analytical art, specious arithmetic, universal arithmetic, symbolical algebra and substitution theory reveal different ambitions; they are not interchangeable period labels.
Near 1600, François Viète's In artem analyticem isagoge by François Viète (1591) supplies a particularly revealing starting point. His analytical art uses letters for known quantities as well as unknown ones. In his terminology, logistica numerosa concerns numerical calculation and logistica speciosa calculation with species, or general magnitudes. Vowels represent unknowns and consonants known magnitudes. This allows a single relation to represent many particular problems, but it is still tied to geometrical homogeneity: a square and a length do not simply become quantities of the same kind because they are written with letters.[ref][ref]
For example, a relation we write as has quantities of compatible dimensions if and are lengths and is an area. Letters do more than abbreviate a numerical question: they express relations between whole families of magnitudes. The phrase specious arithmetic therefore indicates arithmetic carried out on species; analysis stresses the art of reasoning from an assumed unknown towards its determination. Neither term should be reduced to the modern subject real analysis.
René Descartes's La Géométrie by René Descartes (1637) demonstrates another relation between algebra and geometry. A chosen unit segment lets multiplication, division and extraction of square roots be represented by constructions of lengths. The product of two measured lengths can itself be represented by a length relative to that unit. In modern dimensional notation the construction gives for unit length , removing the obstacle that a product must always be treated as an area. The text's equations can then organise geometrical problems and classify curves by their algebraic complexity. Its title remains geometry: algebra serves a geometrical programme rather than announcing a present-day department of abstract algebra.[ref]
A further term, universal arithmetic, stresses the extension of calculation from particular numbers to general quantities. Isaac Newton's Arithmetica universalis by Isaac Newton, issued in 1707, makes the term visible in a title whose subtitle concerns composition and resolution. A title is evidence for the vocabulary, not a sufficient definition of all contemporary usage.[ref] In Leonhard Euler's Elements of Algebra by Leonhard Euler, published in German in 1770, general numerical calculation and the solution of equations remain a substantial conception of the subject. For instance, allowing negative and complex roots changes the admissible answers to polynomial equations while preserving the central question of determining an unknown.[ref]
The eighteenth-century elimination theory exemplified by Alexandre-Théophile Vandermonde's memoir broadens the scale of the task. Instead of one numerical quadratic equation, one seeks a rule for an arbitrary number of simultaneous linear equations. The determinant is initially valuable because it effects that elimination. This is a different generality from the later study of a group: the objects being determined are still unknown quantities, and symbolic generality concerns the number and coefficients of the equations. The case cautions against using generality alone as a test for whether algebra has become abstract.[ref]
In nineteenth-century British discussion, George Peacock's A Treatise on Algebra by George Peacock (1830) distinguishes arithmetical algebra from symbolical algebra. If the symbols mean positive numbers, has no positive-number result. Yet algebraists manipulate this expression without restriction. George Peacock therefore seeks principles for the manipulation of signs which are not confined by their original arithmetical interpretation. The contrast is explicitly argued in his preface: arithmetic suggests the laws, while the symbolic science requires foundations adequate to its more general conclusions.[ref]
The familiar extension illustrates the stakes. From distributivity, , so the rule is forced if these operations obey the assumed laws. This explains how a law can survive a change in interpretation. It does not establish that every familiar law must survive every extension: once the allowable systems themselves change, an argument must state which laws it assumes. The name symbolical algebra consequently carries a stronger methodological claim than simply writing an unknown as .
William Rowan Hamilton's work on quaternions supplies a decisive example of that change. His publications of the 1840s describe a new system of imaginaries in algebra. With quaternion units,
Thus multiplication need not satisfy the commutativity even when it remains associative and supports division by nonzero elements. The new system is not merely a further list of roots of old polynomial equations. It has its own operations, interpretation and laws. William Rowan Hamilton's title makes explicit that a plurality of calculi can belong within algebra.[ref]
George Boole's An Investigation of the Laws of Thought by George Boole (1854) offers a different interpretation of symbols. If represents selection of a class, repeating that selection gives ; multiplication can represent intersection and a complementary class. His logical calculus borrows from numerical algebra but also restricts interpretation: his sum of classes is not automatically unrestricted set union, and intermediate symbolic expressions need not name classes directly. It would therefore be inaccurate to identify all of his rules with a modern Boolean algebra. The example nevertheless shows why algebraic reasoning could extend beyond magnitudes.[ref]
The shift can also take a concrete linear form. Arthur Cayley's A Memoir on the Theory of Matrices by Arthur Cayley (1858) treats matrices with operations of their own. The identity matrix is no longer the scalar , though it plays an analogous role; matrix multiplication is generally noncommutative. For example,
produce and . This is a checkable reason why universal arithmetic can no longer mean that every rule of ordinary numbers applies unchanged.[ref]
Meanwhile, substitution theory studies permutations and their compositions, originally in close relation to polynomial equations. Évariste Galois's work connects the solvability by radicals of an equation with its associated group. Augustin-Louis Cauchy's work on substitutions and Heinrich Weber's 1882 definition illustrate successive forms of generalisation: from particular permutations towards arbitrary elements satisfying operational conditions. This is not a claim that one man supplied the complete modern hierarchy of groups, rings and fields at once. It identifies the change in the question: one can now investigate what follows from the laws of an operation, independently of whether the elements are numbers, substitutions or classes.[ref]
By 1900, algebra could concern the laws and structures of several calculi. Earlier meanings persisted in teaching and in the theory of equations. The strongest account of the change therefore combines continuity with enlargement: letters for general quantities, symbolic operations with explicit laws, nonnumerical interpretations, and structural questions about those laws. Analytical art foregrounded a method of discovery, universal arithmetic foregrounded general calculation, symbolical algebra foregrounded formal operations, and substitution theory foregrounded a particular class of transformations. Their differing uses help explain the expansion more precisely than a single date for the birth of abstraction.
Standards of mathematical proof changed between the seventeenth and nineteenth centuries because both the objects studied and the operations performed on them changed. A finite geometrical construction, an infinite expansion, and an abstract group raise different questions about justification. There was no universal seventeenth-century indifference to rigour followed by its sudden nineteenth-century invention. The more defensible thesis is that successful methods repeatedly exposed unstated assumptions; later work made some of those assumptions into explicit definitions, hypotheses and existence arguments.
Pierre de Fermat's adequality illustrates the distinction between an effective method and its justification. For , comparing neighbouring expressions gives
Dividing by and suppressing the remaining term in produces . There is an independent finite verification:
Thus the result can be secure even when the general procedure raises a question: why is the increment first nonzero for division and then discarded? In the parabola construction of question 2, the same issue appears in replacing a strict geometrical comparison by adequality and extracting the subtangent. A historical explanation must describe this operation on its own terms rather than silently equate it with a modern derivative.[ref]
Isaac Newton and Gottfried Wilhelm Leibniz supplied different languages for the new calculus. Isaac Newton's Introduction to the Quadrature of Curves by Isaac Newton, first published with the 1704 Opticks, presents quantities generated by motion and considers their rates of change. Its mature language of first and last ratios seeks exact relations as increments vanish; it should not be confused with simply asserting that a small error is harmless. Gottfried Wilhelm Leibniz's 1684 Nova methodus pro maximis et minimis by Gottfried Wilhelm Leibniz presents a calculus of differentials and operational rules. Their common problem was to explain why procedures using vanishing increments establish exact results, while their chosen objects and modes of explanation differed.[ref][ref]
George Berkeley's The Analyst by George Berkeley (1734) exposes the logical pressure point. For the cube,
The finite identity does not become a legal division at . The modern repair is to keep throughout the identity and prove that its right-hand side tends to . That limit is different from a quotient evaluated at zero. George Berkeley's criticism therefore concerns the grounds of inference, not whether the established rules often produce correct answers. His theological polemic also reminds us that standards of mathematical proof could be contested outside specialist calculation.[ref]
The infinite introduced another burden. Joseph Fourier's 1822 use of trigonometric series to represent arbitrary functions greatly extended what calculations in mathematical physics could express. But deriving Fourier coefficients by orthogonality only shows what those coefficients must be if the proposed operations are legitimate. It does not prove convergence, equality with the initial data, or interchange of an integral and an infinite sum. The example of a constant expanded in a Fourier sine series makes a hidden qualification visible: the terms all vanish at the endpoints, even when the assigned data do not. The correct theorem must specify the domain and mode of representation.[ref]
Peter Gustav Lejeune Dirichlet's 1829 memoir supplies a particularly precise example of changing proof obligations. It criticises a convergence argument of Augustin-Louis Cauchy's which used complex substitution into an arbitrary function and an insufficient comparison between signed series. Peter Gustav Lejeune Dirichlet supplies the instructive pair
The first series converges by the alternating series test; the second diverges because their difference is the harmonic series. Nevertheless . Thus asymptotic equality of terms does not transfer convergence between conditionally convergent signed series. A comparison principle valid for positive terms needs additional justification when cancellation is involved. The example refutes a mode of inference rather than merely correcting a numerical answer.[ref]
Augustin-Louis Cauchy's own foundations programme is part of this change. The 1821 Cours d'analyse by Augustin-Louis Cauchy makes limits, continuity and series convergence central to elementary reasoning. Yet its Sum theorem of Cauchy also shows why announcing rigour does not make every proof adequate. In modern terminology, continuous functions can have a discontinuous pointwise limit. An explicit series version is
Each term is a polynomial and the partial sum is . The convergence does not hold in uniform convergence: with , the error tends to rather than zero. The modern uniform limit theorem repairs the inference by requiring one bound on the error to work throughout the domain. This example diagnoses the missing control under a pointwise reading; it does not settle every historical interpretation of Augustin-Louis Cauchy's infinitesimal language.[ref]
The issue is the order of dependence in quantifiers. Pointwise convergence permits the threshold to depend on both the error tolerance and the point. Uniform convergence requires a threshold depending only on the tolerance. If is continuous near and the convergence is uniform, choose so that nearby, then use the continuity of this fixed to make . The triangle inequality proves . Writing out this proof reveals what a vague statement that the tail is small leaves unproved.
Another nineteenth-century development concerns the foundations of the real numbers themselves. Richard Dedekind's Continuity and Irrational Numbers by Richard Dedekind (1872) asks for an arithmetical account of the continuity often borrowed from a drawn line. A Dedekind cut separates the rational numbers into lower and upper classes. For instance,
defines a gap in the rational numbers corresponding to . The cut is determined without assuming that a rational number fills it. The extended number system then supports existence theorems that a geometrical picture alone had suggested.[ref]
This matters for apparently elementary proofs. Suppose is continuous on with . Repeated bisection constructs nested intervals whose endpoint values have opposite signs and whose lengths tend to zero. To conclude that there is a common limiting point, one needs the completeness of the real numbers. Continuity then forces its value to be zero. Over the rational numbers, changes sign between and but has no rational zero. Thus even a proof that avoids pictures must explain the existence of its limiting object. Richard Dedekind's account makes that requirement an explicit part of the mathematical setting, rather than an intuition about a continuous line.[ref]
There is a parallel change in algebra. Heinrich Weber's 1882 definition in question 6 describes arbitrary elements through laws of composition. To assess such a definition one proves implications between axioms. The passage's finite set hypothesis implies that cancellative multiplication has an identity element and inverse elements; without that hypothesis, the positive integers under addition supply a counterexample. This is a new kind of proof obligation: one must establish that a proposed abstract definition has the intended consequences, rather than rely on their familiarity in particular numerical or permutation examples.[ref]
The principal change was towards explicit control of operations, hypotheses and existence. Effective symbolic algorithms persisted, and geometric reasoning remained valuable. What became increasingly demanding was the passage from success in examples to a general claim: an infinitesimal step needed justification, an infinite expansion needed a convergence theorem, a limiting point needed a complete number system, and an abstract definition needed its consequences proved. The examples also prevent a simple progress story: nineteenth-century mathematicians disagreed about admissible reasoning, and a programme devoted to rigour could itself become the object of a successful critique.
We construct a cube root of a matrix on each Jordan block. Since is an invertible matrix over the complex numbers, its Jordan normal form is
Consider one block , where is a Nilpotent Jordan block and . Choose a complex cube root of , so .
We need a polynomial with constant term one satisfying
This can be constructed using only polynomial multiplication. Write . Once have been chosen, the coefficient of in is plus an expression depending only on those earlier coefficients. Choose to make this coefficient one at and zero at . Division by three is possible over the complex numbers, so the recursion always succeeds. Its first coefficients are
This is the truncated binomial cube root of the identity plus a nilpotent matrix; equivalently , where the generalized binomial coefficient is and the empty product is one.
Substitute . The polynomial remainder is a multiple of , hence zero. It follows that
For , take , so the same construction covers single-entry blocks. Assemble the block diagonal matrix . Taking matrix powers respects these blocks, and conjugating back gives
Thus every invertible matrix over the complex numbers has at least one cube root of a matrix. The construction uses only finitely many matrix powers.
For the given nondegenerate bilinear form, define the linear map
By part (a), is a linear isomorphism. The paper's bilinear orthogonal complement uses in the first argument; with this convention,
Here is the annihilator of a vector subspace . Since is a linear isomorphism, its restriction gives a linear isomorphism .
For completeness, choose a basis of and extend it to a basis of . In its dual basis , a linear functional vanishes on exactly when its first coefficients are zero. Therefore
Consequently
The argument includes and , and requires no symmetry assumption on the bilinear form.
Take and let with the other parameters fixed. The nullclines are the cubic polynomial graph and the line . In the phase plane, increases below the cubic polynomial graph and decreases above it; increases below the line and decreases above it. The fast ordinary differential equation, in time , freezes and gives .
At , the fast roots are . Their linear stability follows from , and . Thus a fixed falls towards the resting branch, whereas a fixed rises towards . If , the first fast segment instead settles down towards , followed by the same recovery excursion. The threshold is the leading singular perturbation threshold; finite- corrections matter for initial values approaching with .
Let
These are the roots of . The outer branches and of the critical manifold are attracting under fast motion; the middle branch is repelling. The full excursion has four stages.
  • Fast activation: nearly horizontal movement towards , on the time scale, apart from the usual matching tails.
  • First slow phase: motion along from down to . Here rises and slowly falls, because on the positive outer branch. This takes order-one time for fixed .
  • Fast repolarization: near the right fold point of a critical manifold, the attracting branch ends. With nearly constant, drops to the negative root of . The jump takes the fast time scale; a thin neighborhood of the fold has an intermediate fold delay.
  • Second slow phase: motion along the negative attracting branch from towards from below, while falls towards zero. This is the refractory recovery and has order-one duration to a fixed small cutoff; exact return to the equilibrium takes infinite time.
For this cubic polynomial, the landing point is explicit. Since , comparison of the quadratic coefficients gives
Thus a graph of has a rapid rise, a slowly falling elevated plateau, a rapid fall through zero to a negative undershoot, and a slow approach back to zero. The figure shows both the phase plane and a computed time trace. The smaller initial perturbation stays near the resting branch and produces no elevated plateau.
Figure 1.
Excitation threshold and the four stages of a FitzHugh-Nagumo pulse
. Details.
The four-stage description concerns the singular limit. Close to a simple fold point of a critical manifold, balancing the local quadratic activation term with the slow drift gives and for fixed parameters. These layers shrink compared with the slow phases and do not alter the leading time integrals below.
Let denote the four critical wavevectors, and write . A spatial translation by acts on the amplitudes as
The two independent translation directions in phase space are and . Their common orthogonal complement is spanned by and . Hence translation invariants of Fourier-mode phases can be chosen as
Away from zero amplitudes, a translation-invariant function of the phases is a function of these two invariant angles. The four magnitudes are themselves invariant. Thus an equivariant dynamical system on the eight-real-dimensional centre manifold descends, after quotienting translation symmetry, to four magnitude equations and two invariant-phase equations. The phase coordinates are singular where an amplitude vanishes; the original complex-amplitude equations remain smooth there.
The wavevector selection rule for equivariant monomials proves the cubic regularity. For a monomial in the first equation, put . Translation covariance requires
At total degree , additionally and is even. Conversely, any integer vector satisfying these conditions yields a monomial, with any remaining even degree supplied by factors . This makes the degree test exhaustive. For example, eliminate the first two entries:
Checking the integer pairs , retaining only integral with the norm and parity conditions, gives
At degree three the only possibility is therefore , . Square symmetry gives the same conclusion for every other equation. All cubic terms are regular.
Two generators of the square dihedral group act as follows. Reflection in the axis gives , while interchange of gives . Rotation by conjugates every amplitude, forcing the coefficients in a steady normal form of a dynamical system to be real. With real unfolding parameter and real coefficients , define
The most general cubic normal form is . There are no further coefficient identifications: the square-group stabilizer of one of these oblique wavevectors is trivial, so its three couplings to the other magnitudes are independent. At cubic order and all phases, including , are constant.
The degree-five row of the wavevector selection rule for equivariant monomials in part (a) has two vectors other than . They correspond exactly to
The vector gives only regular fifth-order terms . Omitting those as required, and applying the same two square-symmetry generators, the truncated normal form of a dynamical system is
Here are real because rotation by acts by complex conjugation. These are equations for steady patterns, so all four complex right-hand sides must vanish; constancy of the two invariant angles alone would only establish a relative equilibrium and could allow translation drift.
Take a nonzero equal-magnitude state, , and set , , . Dividing each equation by its nonzero amplitude gives, in order,
Taking imaginary parts, adding and subtracting pairs, yields
Thus, unless , each invariant phase is zero or modulo . Equality of the real parts further gives
This identifies the equal-amplitude states of an eight-mode square pattern completely. For generic , the two nonzero phase types, with their amplitude equations, are
Representatives are respectively and . Spatial translations change individual phases but leave the indicated phase pair fixed. Reflection acts on the invariant angles as , and interchange of as . Thus the two rows are not equivalent under square symmetry and translations. Every positive root of the corresponding polynomial gives an amplitude branch of that type; if there is no positive root, that type is absent at those parameter values.
There are two coefficient degeneracies to include. When , the mixed pairs and are allowed and are equivalent under square symmetry. They form one additional phase type, with amplitude equation ; is a representative. When , all invariant phases are unrestricted, and the same cubic amplitude equation gives a continuous family modulo translations and the finite square-group action. Even if but , only the original two phase types remain: the equality of their amplitude equations does not remove the phase constraints. Finally, the all-zero state is always a separate steady state and has no defined polar phases.
The spatial mean is conserved: averaging every term in the partial differential equation over the periodic cell gives . Adding a constant to also preserves the equation. We therefore fix the mean, conveniently at zero. This qualification is essential: without it the constant Fourier mode contributes an additional neutral direction, so the centre subspace would have five real dimensions rather than four.
On a Fourier mode , the linearized linear operator has eigenvalue
On the fixed-mean subspace, the first eigenvalues to reach zero are those with . At these are the modes ; every other nonconstant Fourier mode is strictly damped. The reality condition leaves two complex amplitudes, hence a four-real-dimensional centre manifold on the fixed-mean subspace. The trivial state loses linear stability as increases through one.
Use slow time , and write , where
There is no quadratic nonlinearity, so no forced second-order correction is needed. At order , with , projection onto the critical Fourier modes gives
The correction does not contribute to the critical projection because the linear operator vanishes on those modes. To find the nonlinear coefficient of , split the divergence term into
The first term contributes . In the second, only the zero- Fourier coefficient of contributes; it is , and differentiating once more gives . The third term has zero -average, and the fourth has no -dependent critical component. Interchanging gives the other amplitude equation. Thus the conserved-mean convection amplitude equations are
To establish the selected planform, put , . The phases are constant and the magnitudes obey
For , the square state has . Its magnitude Jacobian matrix is , with eigenvalues and . Its two neutral phases correspond to translation symmetry. The pure roll has ; an infinitesimal disturbance grows at rate . The other pure roll is equivalent, while the trivial state is unstable for . Consequently squares, with , are the stable small-amplitude planform, modulo translations. For the trivial state is stable.
Let denote the right-hand side of the temperature partial differential equation. For a periodic variation , integration by parts gives
Along the evolution, , so this is a gradient flow with increasing functional:
For , completing the square gives
Thus the increasing-gradient functional for poorly conducting convection converges to a finite limit along any globally smooth solution, and
In particular, there are arbitrarily late times at which is arbitrarily small. A nonstationary time-periodic solution is impossible: it would have a strictly positive increase of over a temporal period. More generally, if the orbit is precompact in a topology strong enough for the equation, its limiting states are stationary. With the conserved mean fixed, the displayed square completion bounds , and periodic elliptic estimates give an bound; the usual smoothing and compactness for a globally regular parabolic solution support this limiting-state conclusion. The inequalities alone do not prove convergence to one uniquely specified equilibrium, and stationary families related by translation symmetry can remain.
Now take a smooth, nonconstant periodic roll . Multiplying its stationary partial differential equation by and using periodic integration by parts yields
The primes here are essential: the first and fourth terms involve , not . Write , , , , and . The orthogonal-roll perturbation has
The cross term in the squared Laplacian averages to zero since . Independence of the cell integrals then gives the exact polynomial difference
Its leading coefficient is half the variance of over the period. That variance is strictly positive: a nonconstant smooth periodic function has a derivative which vanishes somewhere and is nonzero somewhere, so is not constant. Hence arbitrarily small transverse perturbations increase above the roll value.
One can turn this energy comparison into linear instability. The linearized evolution at the roll is the self-adjoint operator
Choose the fixed-mean perturbation . Since , the Rayleigh quotient is positive. The periodic self-adjoint fourth-order operator therefore has a positive eigenvalue. This proves the transverse energy instability of nonconstant temperature rolls: every nonconstant roll is unstable wherever it exists.
The existence qualification matters. Constants are also stationary and are stable on the fixed-mean subspace for . Moreover, the periodic Poincaré inequality gives , so the roll identity implies for a nonconstant -periodic roll. Such rolls require on this specified cell; the conclusion for all positive is conditional on a nonconstant roll being available.
A steady transverse bifurcation requires a zero eigenvalue, hence . This gives
The inequality is required for a positive amplitude. Since , the numerator cannot vanish. The zero eigenvalue is simple provided the other eigenvalue, the trace , is nonzero. Equivalently,
With fixed, , so the simple zero eigenvalue crosses transversely. If this is to be the first instability of the stable pure branch, its other eigenvalue must still be negative. Comparing with gives the stronger condition
For , a simple steady threshold still exists, but it lies after the Hopf threshold and the pure branch is already unstable there. At both transverse eigenvalues vanish, so the event is a double-zero degeneracy rather than an ordinary simple steady bifurcation.
The reduced system has the reflection symmetry . At a generic simple steady threshold, the new mixed states therefore occur in a reflection-related pair, with small nonzero and a corresponding correction to the magnitude and common frequency. In the original variables they are phase-locked periodic solutions involving both spatial modes: , , with constant nonzero complex . The odd spatial component breaks the reflection symmetry of the pure even mode; the two branches are exchanged by . Determining whether the branches are supercritical or subcritical, and their stability, requires the reduced nonlinear coefficient and is not determined by this linear threshold alone.
A Hopf crossing of the transverse stability matrix requires zero trace and strictly positive determinant. Since , the trace condition gives the positive threshold
The determinant there is
Thus the required coefficient condition and the rotating-frame Hopf frequency are
The trace derivative is strictly positive, so with fixed the real parts cross zero with nonzero speed. Under this condition the determinant stays positive from to ; the pure branch first loses linear stability through this Hopf bifurcation. When its first instability is instead the steady one of part (a), and prevents a Hopf pair at the trace-zero point. Equality gives the already noted double-zero degeneracy.
Generically the new branch is periodic in the symmetry-reduced rotating frame, with a small oscillating odd-mode amplitude and a modulation of the even-mode amplitude. Reconstructing the common temporal phase combines the modulation frequency with the carrier frequency. The original amplitudes therefore describe modulated periodic oscillations, generically a two-frequency quasiperiodic state. If the two frequencies are rationally related, the reconstructed motion can be periodic instead. The spatial pattern no longer has a fixed mixture of the even and odd modes: their relative amplitudes and phase oscillate. As with the steady case, nonlinear nondegeneracy is needed for an ordinary Hopf branch, and its criticality or stability cannot be inferred from the trace and determinant alone.
The spatial reflection acts on the two complex amplitudes as , because the first spatial eigenfunction is even and the second is odd. The first equation must therefore be even in , and the second odd. For a nonresonant double Hopf bifurcation, the temporal phases give independent actions , in the cubic normal form of a dynamical system. A cubic monomial in the first equation must have net phase weight one and net phase weight zero. Only satisfy this; the second equation similarly has . Parametrizing the independent cross-saturation coefficients gives
All coefficients can be complex: their real parts determine amplitude growth and their imaginary parts frequency shifts. These are cubic truncations of a family of reduced vector fields on the four-real-dimensional extended centre manifold, with the two unfolding parameters entering .
The nonresonance assumption must be made explicit. Merely having does not imply this form: for , the quadratic terms in and in satisfy both temporal resonance and spatial parity. Thus the initial form is the generic nonresonant double-Hopf form, rather than a statement for every possible unequal frequency pair.
At the one-to-one reflection-symmetric one-to-one Hopf resonance, only the common temporal phase action remains. Cubic terms must then have total phase weight one. Spatial reflection retains, in the first equation, the three terms ; the second retains . Common phase covariance excludes all quadratic terms. The additional resonant terms are consequently and , with independent complex coefficients. This is the reflection-symmetric one-to-one Hopf resonance.
In the specified equal-coefficient specialization, put . A nonzero pure- periodic branch exists for and has
Its radial eigenvalue is , and its phase is neutral. For a transverse perturbation the linear equation is
Its time dependence can be removed exactly by . Using and gives
Writing , , yields the constant real stability matrix
Let . The transverse characteristic polynomial is
Both transverse eigenvalues have negative real part exactly when
These hold at because . Thus a sufficiently small pure branch is transversely stable; it is stable modulo its neutral temporal phase until one of the two inequalities fails. The secondary steady and Hopf thresholds of a resonant pure mode are derived in the two parts below. They refer to accessible points on the pure branch; in a multi-parameter problem may also vary, so a proposed parameter path must actually cross the corresponding surface.
A periodic pattern breaks continuous translation symmetry: translating it changes its phase without changing its shape or its energy. Consequently a uniform phase change is neutral. A slowly varying phase change alters the local spacing or orientation and can grow even while ordinary uniform amplitude perturbations decay. These are long-wavelength sideband instabilities. The relevant wavelengths are long compared with the carrier pattern, so their leading dynamics is often a phase modulation equation. Positive phase diffusion smooths spacing errors; negative phase diffusion amplifies them. Near onset, an amplitude equation computes this diffusion explicitly. Away from onset, one must calculate it from the full nonlinear periodic pattern.
For a supercritical stationary pattern in one dimension, rescale the real Ginzburg–Landau equation to
A detuned periodic pattern is represented by , with . Perturb its magnitude and phase by . Linearization gives
For a Fourier mode proportional to , the two eigenvalues are the sideband spectrum of a real Ginzburg-Landau plane wave:
The magnitude branch remains damped at small . The phase branch expands as
Hence the Eckhaus-stable band is , narrower than the existence band . This Eckhaus instability is longitudinal: it compresses and dilates the pattern along its wavevector. The coupling to the relaxing magnitude is crucial; examining phase diffusion while holding the magnitude fixed would miss the destabilizing correction. At the stability boundary the coefficient vanishes, and the next term is negative, . Beyond the boundary, a phase distortion can create amplitude zeros and phase slips, changing the number of periods. These nonlinear events are possible outcomes, not conclusions of the linear calculation.
A fixed periodic domain allows only discrete sideband wavenumbers. Indeed, the displayed spectrum is unstable only if . A domain too short to support such a Fourier mode can suppress the nominal long-wave instability. Thus an infinite-domain stability band and a finite-domain threshold must be distinguished.
The zigzag instability concerns transverse bending of rolls in an isotropic two-dimensional system. Let be the preferred carrier wavenumber, use an -directed carrier, and denote its slow longitudinal detuning by . Rotational covariance near onset leads to the anisotropic envelope equation
The derivative combination comes from expanding : a small transverse carrier component changes the length of the wavevector only at second order. A straight-roll envelope has . For a purely transverse phase perturbation , magnitude and phase decouple at linear order, and
The transverse growth rate is therefore
Rolls with , whose total wavenumber is below the preferred value, are zigzag-unstable to sufficiently long transverse modulations. Bending increases their local wavevector length and can relieve this mismatch. Rolls with are transversely stable in this near-onset model; at the restoring force first appears at fourth spatial order. Combining this with the longitudinal Eckhaus instability gives the robust interior stable band for this simplest isotropic roll model. Anisotropy, a pinned orientation, additional mean fields, or other pattern symmetries can modify this conclusion.
For oscillatory patterns the coefficients of the amplitude equation are generally complex. Consider the scaled complex Ginzburg–Landau equation
where measures linear dispersion and the amplitude-dependent frequency shift. The uniform oscillation is . Put , with real infinitesimal . The linearized magnitude and phase equations are
Their characteristic polynomial for a sideband of wavenumber is
The magnitude mode has leading eigenvalue , while the neutral phase mode has
Thus the Benjamin-Feir instability occurs for ; the complementary Benjamin-Feir stability condition is . Both dispersive couplings matter: the phase perturbs the magnitude through , and the magnitude feeds back into phase through . In the unstable regime, higher spatial derivatives regularize sufficiently short disturbances. On a finite domain, an unstable mode must satisfy . At equality of the phase-diffusion coefficient to zero, the leading phase damping is fourth order, not exponential growth at order .
Oscillatory plane waves with a nonzero carrier detuning also have a generalized Eckhaus boundary. For the Ginzburg-Landau plane wave , one has and . Eliminating the damped magnitude mode to second order in a sideband wavenumber gives
The imaginary linear term transports the modulation; the sign of determines its leading growth. If , the long-wave stable carrier band is
For this reduces to the real-equation Eckhaus band. If , even the zero-detuning oscillation has the Benjamin-Feir instability. Nonlinear outcomes can include smooth phase modulation, defect production or phase turbulence, depending on the equation and parameters.
The general nonlinear-pattern problem starts from a periodic solution of the full field equations, not from a small-amplitude envelope. Linearize about it to obtain an operator with periodic coefficients. Write a disturbance as with periodic on the pattern cell. The Bloch stability operator
acts on this fixed cell and determines the entire sideband spectrum. Translation covariance gives in one dimension, and corresponding neutral directions for each independent broken translation in several dimensions. Oscillatory base patterns require the analogous Floquet theory calculation over their temporal period, or a rotating frame where applicable.
For a simple translational zero eigenvalue, the phase-diffusion calculation can be made explicit. Expand
where and . Choose an adjoint neutral function with , , and impose . First-order solvability, using the Fredholm alternative, gives
At second order, applying the same adjoint solvability condition gives the phase-diffusion coefficient from a Bloch cell problem:
This calculation exhibits why the nonlinear pattern profile matters: both and the cell correction depend on it. A negative signals a long-wave instability provided the rest of the spectrum is stable. With several phase directions, or an extra neutral conserved mean, one obtains a coupled modulation system and diffusion matrices rather than this scalar formula. A two-dimensional phase equation can schematically have . Changing the sign of gives the longitudinal Eckhaus instability; changing the sign of gives the transverse zigzag instability. For oscillatory waves, nonvariational magnitude-phase coupling gives the Benjamin-Feir instability.
These mechanisms extend beyond onset, but the near-onset numerical boundaries do not: their coefficients must be replaced by those obtained from the actual nonlinear pattern and its cell problems. Long-wave linear stability is also only one part of stability; finite-wavenumber eigenvalues, additional modes, defects, and boundary constraints can intervene. The unifying calculation is the splitting of translation-induced neutral modes at small modulation wavenumber, together with the coupling to the relaxing magnitude and any other slow fields.
The cubic spline is even, so the symmetry of the normalized B-splines gives . It therefore suffices to extract three coefficients. The two polynomial pieces join with matching values and first two derivatives at zero, so the function belongs to the stated cubic spline space. At zero its right-hand derivatives are
Use the supplied De Boor–Fix spline coefficient functional with the unnormalized knot polynomial . In this sign convention the coefficient is
For , . Taking the right-hand limit at kills the first three terms and gives . For the next two coefficients take the right-hand limit at zero. Their knot polynomials and derivatives there are
Consequently and . Although the third derivative jumps at zero, its multiplier vanishes for these two functionals; taking either one-sided limit gives the same coefficients. Symmetry gives and . Thus
For a normalized B-spline basis, define the synthesis linear map from the maximum coefficient norm into the spline space with its supremum norm. Nonnegativity and partition of unity give , including equality on the all-ones vector. The coefficient condition number of a normalized B-spline basis is
On , . The only interior extremum is at , where ; at zero and one, . Reflection therefore gives . Its largest absolute coefficient is , proving
The Korovkin theorem says that a sequence of positive linear operators on continuous functions on converges uniformly to the identity on every continuous function if it does so on , and . Necessity is immediate; the quadratic barrier argument establishing sufficiency is given in Solution 6.
There is an endpoint misprint in the original PDF: the repeated knots at the right end must equal , not . Otherwise the advertised nondecreasing spline knot sequence on does not exist. Use the corrected clamped spline knot sequences, with fixed order and maximum gap . Let denote the number of B-splines for the th sequence. Nonnegativity and partition of unity show that the Schoenberg spline operator is positive and .
The monomial B-spline coefficients reproduce the first two nonconstant test polynomials. Put
The pair sum uses , as in the PDF; the converted TeX incorrectly includes . Every sampling point and every knot entering these coefficients lie in , whose length is at most . Thus . Also all these numbers belong to , so
The positive B-spline weights give
Together with , the three limits prove
Under the usual interior knot multiplicities at most , the splines are continuous and the quoted form of the Korovkin theorem applies directly. If full interior multiplicity is allowed, the output can be discontinuous. The same positive-operator quadratic barrier proof still works with bounded output functions and the supremum norm, and proves exactly the stated uniform error limit without asserting continuity of each output. Indeed the stronger local-support error bound for a Schoenberg spline operator, , follows by comparing with each active sample value. The restriction is needed for the displayed quadratic reproduction argument, not for this direct support estimate.
The Weierstrass approximation theorem asserts that every real continuous function on a compact interval is a uniform limit of polynomials. An affine change of variable reduces the interval to . There are two complementary routes: construct positive approximation operators, or construct an algebra dense enough to approximate absolute values and hence pointwise maxima and minima.
For the first route, the Korovkin theorem reduces convergence of positive linear operators on continuous functions to the three tests . Here is its proof. Given and , uniform continuity supplies a such that for . For all one then has
Apply positivity to the two real inequalities obtained from this bound. At this gives
The expression in brackets is nonnegative and tends uniformly to zero by the three test assumptions. Also uniformly. Taking the upper limit of the supremum norm and then letting proves convergence for every . This is the quadratic barrier estimate for positive approximation operators.
The Bernstein polynomial supplies the constructive corollary
The binomial theorem makes its nonnegative weights sum to one. Differentiating the binomial theorem, or using the first two binomial distribution moments, gives
The Korovkin theorem proves uniformly, and each is a polynomial, proving the Weierstrass approximation theorem. The same criterion gives the Schoenberg spline operator convergence in Solution 3. For periodic functions its counterpart uses : the nonnegative barrier is bounded away from zero outside any fixed small arc. This periodic Korovkin test set gives convergence of the normalized Fejér sums and density of trigonometric polynomials.
The Lebesgue convergence criterion for approximation operators addresses stability. Suppose bounded linear operators converge to the identity on every polynomial. Then they converge on every continuous function if and only if . Sufficiency is the extension of approximation operators from a dense subspace: for a polynomial with and a common bound ,
First let , then . Necessity follows from the Uniform boundedness principle, since a convergent is bounded for every . Applied to approximation projectors, the Lebesgue inequality for approximation projectors is
Indeed makes ; take the infimum. Thus density of the ranges and a uniform bound on the Lebesgue constants of interpolation imply convergence. Density alone does not control a sequence of interpolation projectors.
There is also a kernel version of this stability criterion, useful for trigonometric polynomial approximation. If integrable periodic kernels have uniformly bounded norms, their integrals tend to one, and for every , then convolution with converges uniformly to every continuous periodic function. Subtract and split the error into a small arc, bounded by , and its complement, bounded by . The remaining mass error tends to zero. This approximate identity argument shows directly why nonnegative unit-mass Fejér kernels work even though ordinary Fourier partial sums need not converge uniformly for every continuous target.
Lebesgue's constructive approach to the Weierstrass approximation theorem starts instead with the absolute value. On define the polynomial recurrence for the absolute value
Induction gives , monotonicity, and
The pointwise limit satisfies and is nonnegative, hence equals . Dini's theorem makes the convergence uniform. More explicitly, the continuous decreasing errors have, for any positive tolerance, open sublevel sets covering the compact interval; a finite subcover supplies one index valid everywhere. Every continuous piecewise linear function has the form
The are its changes in slope. Scaling and translating the absolute-value approximation shows that is uniformly approximable by polynomials. Solution 4, or polygonal interpolation and uniform continuity, makes these piecewise linear functions dense in . Approximating first by and then by a polynomial is another complete proof of the Weierstrass approximation theorem.
The Stone-Weierstrass theorem generalizes from intervals to a compact Hausdorff space : a real subalgebra containing the constants and separating points is uniformly dense. Its proof uses the same absolute-value mechanism. The uniform closure of a function algebra is an algebra. If belongs to this closure, approximation of by polynomials on a bounded interval containing its range proves that also belongs to the closure. Therefore the closure contains
Point separation and constants allow exact interpolation of any two real values: choose with and solve for in . The lattice approximation from two-point approximation proved in Solution 4 now makes the closure all of .
The complex version requires a unital, point-separating subalgebra closed under complex conjugation. Its real-valued members separate points using real or imaginary parts, so the real result approximates both parts of every complex target. Conjugation closure is essential: polynomials in alone on the closed unit disk cannot approximate uniformly, because whereas .
Among the corollaries are density of multivariate polynomials on compact subsets of real Euclidean space, since coordinates separate points, and density of trigonometric polynomials on the circle, since sine and cosine separate points there. On a compact interval, polynomials with rational coefficients are a countable dense family, giving separability of . The real and complex approximation results above concern uniform approximation of continuous targets; neither asserts convergence of arbitrary interpolation schemes or arbitrary Fourier series.
Fix a clamped nondecreasing spline knot sequence on , with and . For continuous splines assume interior multiplicities at most , and assume . An order- spline has degree at most on each nonempty knot interval; at a knot of multiplicity it has continuous derivatives. Its dimension is , and a normalized B-spline basis has local support, nonnegative values and sum one on .
These properties are visible in the Cox-de Boor recurrence. Starting with interval indicators at order one, set
with a term of zero denominator defined to be zero. On each contributing support the weights are nonnegative, and summing the recurrence makes the coefficients of each lower-order B-spline add to one. This gives partition of unity and , with endpoint values defined by limits.
At distinct ordered sites , interpolation is the linear system
It has a unique solution for every data vector exactly when the B-spline collocation matrix is invertible. The Schoenberg–Whitney theorem characterizes this by for every ; away from clamped endpoints this is . At the clamped endpoints the first and last B-splines have value one, so the endpoint version uses this positive-value formulation rather than the strict inequalities. Both ordering and the support conditions matter. A spline space with interior knots is generally not a Chebyshev system on the entire interval: a locally supported B-spline vanishes on an interval. Thus arbitrary distinct nodes need not permit interpolation. Merely specifying all data sites as knots also need not fix the remaining freedom; for example, cubic interpolation with simple interior knots at data sites has dimension , and two extra boundary conditions are needed to interpolate values uniquely.
The positivity governing this existence theorem is total nonnegativity of B-spline collocation matrices: every square minor with increasing row and column indices is nonnegative. In spline terminology this is often called total positivity, but it permits zero minors caused by disjoint supports. It is not the stronger assertion that every minor is strictly positive. A useful proof uses knot insertion. Each refinement step changes coefficients by
with the unchanged endpoint pieces. The refinement matrix is nonnegative bidiagonal, and its minors are nonnegative: any nonzero determinant has its allowed diagonal matching and is a product of nonnegative entries. Products preserve this property by the Cauchy–Binet formula. Insert each sampling site to full multiplicity, so evaluation at that site becomes selection of an ordered refined coefficient. The collocation matrix is then an ordered row submatrix of the refinement product, proving total nonnegativity. The strict support criterion is the strict part of this argument: an ordered path through the consecutive support intervals exists exactly when every diagonal B-spline value is positive, giving the Schoenberg–Whitney theorem determinant criterion.
If is invertible, its determinant is positive and the adjugate identity yields
This checkerboard inverse of a totally nonnegative matrix is the central stability fact. With alternating data , the absolute row sums satisfy
For general data, the cardinal splines are . The spline interpolation operator and its exact Lebesgue constant of interpolation are
The equality for the operator norm follows by extending the signs at distinct sites to a continuous unit-norm data function, as in Solution 2. That solution also shows the last inequality can be very strict. Stability concerns the range function as well as its coefficients.
An optimal interpolation set must be specified relative to an objective. For the normalized B-spline coefficients, every admissible sampling set satisfies
since and sampling cannot increase the supremum norm. If a unit-norm spline has ordered alternating extrema at admissible sites, the checkerboard identity gives
Taking the largest row shows , so equality holds. This proves the optimal spline coefficient interpolation sites property and the Chebyshev spline coefficient and dual norm equality. In particular, for the cubic space of Solution 1 the alternating extrema satisfy the support conditions. Its coefficients have maximum magnitude , so these sites are optimal for coefficient recovery and
The argument proves optimality whenever this admissible equioscillating spline is available; it does not identify extrema of an arbitrary spline as optimal sites, or transfer coefficient optimality automatically to the Lebesgue constant of interpolation.
For the intrinsic interpolation objective, minimize itself. There is a minimizer for a fixed finite-dimensional continuous spline space. Indeed the sites lie in a compact ordered simplex. On admissible sets, inverse entries and hence vary continuously. As a collocation matrix tends to a singular one, its inverse norm diverges. The uniform-norm stability of a B-spline basis gives the complementary bound
choose sample signs attaining a largest inverse row, extend them to a continuous unit-norm function, and use . Thus a minimizing sequence with bounded Lebesgue constants of interpolation cannot approach a singular site set. A convergent subsequence has an admissible limit attaining the minimum.
Fekete interpolation sites for a continuous function space offer another useful, constructive criterion: maximize the absolute evaluation determinant. A nonzero maximum exists by compactness and linear independence. Replacing one row by evaluation at multiplies the determinant by the corresponding cardinal function, so maximality gives , and therefore . These sites are determinant-optimal, with a proven interpolation bound; one should not claim without further argument that they minimize . Greville abscissae provide inexpensive admissible sites for the usual continuous clamped spline spaces of order at least two. Admissibility alone does not give the best stability bound.
Finally, the coefficient condition number of a normalized B-spline basis is bounded by a constant depending only on order. To see the mechanism, for each coefficient choose a longest nonempty knot cell in that B-spline's support. If its length is and the support width is , then . On that cell the spline is a degree-at-most- polynomial; repeated Markov polynomial inequalities bound its th derivative by . In the De Boor–Fix spline coefficient functional, the accompanying derivative of the knot polynomial is bounded by . Each term is consequently at most , yielding independently of the number and spacing of knots. This is basis stability; it does not bound at arbitrarily poor sampling sites.
For approximation, reproduction gives the Lebesgue inequality for approximation projectors
As the maximum knot gap tends to zero with fixed order, spline quasi-interpolation gives an approximant with error at most , so the infimum tends to zero. A sequence of uniformly bounded interpolation linear operators therefore converges to every continuous target. Local support and a stable choice of sites make spline interpolation effective; mesh refinement without control of the interpolation operator norm is not by itself a convergence proof.
Treat as independent variables when taking the Legendre transform. Their canonical momenta are
The canonical quantization of a complex scalar field imposes, at equal times,
with , together with their adjoints, and . These are canonical commutation relations for two real scalar degrees of freedom, written in a complex basis. Local fields are operator-valued distributions, so these identities are understood after smearing or with a regulator.
The Hamiltonian density is , giving
The Heisenberg equation of motion is . For example, , while commuting with the gradient term and integrating its derivative of a Dirac delta distribution gives . Thus
Both fields satisfy the Klein-Gordon equation. Their spatial Fourier modes therefore have frequencies , . A complex scalar field has independent coefficients for these two frequency sectors, so, defining the invariant measure , its mode expansion is
One can recover the mode operators at any fixed time using complex scalar mode inversion:
Substitution of the expansion verifies these inverses: the spatial integral selects the appropriate momentum, while the two frequency sectors acquire factors . The unwanted sector vanishes when the delta function sets . The canonical commutation relations then give, for example,
Likewise has the same value. The cross commutators vanish; their coefficients contain on the corresponding momentum delta function. Conversely, these oscillator brackets reproduce the equal-time field brackets, confirming the normalization of the measure.
Insert the mode expansion into and integrate over space. The terms and enforce opposite spatial momenta; their coefficient is . For the diagonal terms the coefficient is . Combining this with the two invariant measures leaves
In a box, , one half-quantum for each of the two real oscillator species. It diverges as the cutoff is removed. Normal ordering removes this vacuum energy, yielding the normal-ordered Hamiltonian of a free complex scalar field:
In this nongravitational free theory an additive constant in changes only an overall state phase, not Heisenberg equations of motion, energy differences or scattering probabilities. It is therefore consistent to choose the Fock vacuum energy as zero. Both creation operators raise the energy: and . Repeated creation builds a bosonic Fock space of spin-zero particles and antiparticles, with the same positive mass and energy. The negative-frequency part of the field does not describe negative-energy physical particles.
The global phase symmetry of a complex scalar field, with orientation , has the indicated Noether current. Taking its divergence, the two first-derivative terms cancel, giving
The same calculation holds for its normal-ordered version. Integrating its temporal component gives a conserved charge when spatial boundary flux vanishes.
Here the ordering convention is important. Direct substitution into the literally ordered product yields
The pair terms again vanish, now because their coefficient is a difference of equal energies. Reordering the term produces a divergent vacuum constant: with a finite-mode regulator . Thus the requested finite charge formula uses zero vacuum charge, or equivalently the vacuum subtraction of a complex scalar charge. With that conventional subtraction,
The subtraction changes neither current conservation nor the action of on fields; without it, the unrenormalized product does not literally equal the displayed normal-ordered operator.
Finally the oscillator commutators give
or . Acting on a charge eigenstate, the first creator raises its charge by one and the second lowers it by one. Starting from the neutral Fock vacuum, their one-particle states therefore have charges and respectively. This is the complex scalar charge operator , whereas the energy counts the sum of the two occupations. A multiparticle state has additive charge equal to the number of particles minus the number of antiparticles.
Vary the Maxwell Lagrangian with respect to . Since and is antisymmetric,
After integration by parts, the Euler-Lagrange field equation is
The gauge transformation leaves unchanged because partial derivatives commute. This gauge invariance means that potentials related in this way represent the same electromagnetic field; all four potential components are not independent physical photon degrees of freedom. In particular, the ungauged kinetic operator is singular and its temporal canonical momentum vanishes.
Choose the Lorenz gauge . The field equation then becomes . Residual gauge transformations with preserve this condition. The correctly named Lorenz gauge condition concerns the divergence of the potential; Lorentz covariance is the separate transformation property of the equations.
For the alternative quadratic Lagrangian density, direct differentiation gives
so its Euler-Lagrange field equation is also . This density is the Feynman-gauge Maxwell kinetic density after a boundary-term subtraction. Indeed, with ,
The divergence identity follows by expanding and commuting its second derivatives. The quadratic density alone describes four wave equations; the gauge constraint must still be incorporated in the physical states. It is not an unconstrained four-positive-polarization replacement for Maxwell equations.
Using this specified boundary-term convention, the canonical momentum conjugate to is
The canonical commutation relations are therefore
with field-field and momentum-momentum brackets zero. Equivalently . The temporal component has the opposite sign to the spatial components; replacing the metric by a positive Euclidean one would destroy these brackets.
The wave equation gives massless frequencies . Hermiticity pairs its positive- and negative-frequency solutions, so the Heisenberg picture field has the expansion
This is a real field expansion for each component, but its oscillator metric is indefinite. The assumed brackets, with the dagger's vector index restored, are
They verify the photon oscillator completeness and canonical brackets. Inserting gives at equal times
The other brackets cancel between the two frequency contributions. Thus both the normalization and the sign are needed.
The Gupta-Bleuler formalism imposes the Lorenz gauge condition weakly on states:
Here is the annihilation, positive-frequency part. Setting the full divergence to zero as an operator would conflict with the four-component canonical commutation relations. The subsidiary condition instead selects a physical pre-space inside the covariant photon Fock space, followed by a quotient of its null states.
Apply it to . Commuting through the creator gives a multiple of . Hence the allowed photon polarization vectors obey
Take . The complete solution is
with complex coefficients. The last two vectors are transverse linear photon polarizations, and gives the two circular photon polarizations. The first vector is , the allowed temporal-longitudinal combination. A purely spatial longitudinal vector by itself does not satisfy the subsidiary condition.
The oscillator brackets give, apart from the positive continuum normalization factor,
Momentum eigenstates are distributionally normalized; a box or a wave packet makes the norm statement literal. The allowed longitudinal combination has zero norm because , and it is orthogonal to every constrained state since . It also gives a pure-gauge field wave: the field strength of vanishes. Thus and represent the same physical photon polarization. The Gupta-Bleuler null-state quotient removes this null direction and leaves two positive-norm transverse photon photon polarizations. The negative-norm temporal oscillator of the unrestricted space is not an extra physical state. This is the transverse one-photon physical quotient.
Finally verify the two-photon fermion Ward identity directly for electron-positron annihilation into two photons. Define and the reduced Dirac propagator
The equality follows from the Clifford algebra, since . The incoming Dirac spinors obey and . On replacing one inserted photon polarization vector by , the spinor factor in the two diagrams is
At the electron end, , so
For the other diagram, four-momentum conservation gives . Hence
The two contributions therefore cancel exactly:
Individual diagrams need not vanish; their sum implements the Ward identity. Linearity then gives invariance under , as required by gauge invariance. In particular, the null longitudinal photon polarization proportional to has zero physical production amplitude. Physical scattering produces the transverse photon classes, not an independent longitudinal massless photon.
Normalize the weight-four and weight-six Eisenstein series to have constant term one. Their Fourier expansions begin
Their absolutely convergent lattice sums transform by modular weights four and six under reindexing by the modular group, and their Fourier expansions prove holomorphy at its modular cusp. Thus they are elements of .
We use the valence formula for the modular group: for a nonzero weight- form,
The sum uses one point of each ordinary orbit. This is the argument principle on a truncated fundamental region: paired vertical integrals cancel, the circle pairing contributes the modular weight term, and local quotient coordinates at the two elliptic points of a modular curve modular weight their orders by . All orders are nonnegative for a holomorphic modular form.
Define the modular discriminant by
It is a weight-twelve cusp form. Its order at infinity is one, exhausting the valence total . Hence has no zeros in . Therefore every weight- cusp form is divisible by , with quotient holomorphic on and at the modular cusp:
Negative modular weights vanish by the valence formula, and odd modular weights vanish because acts by . Weight-zero forms are constant: they descend holomorphically to the compactified modular curve, and the maximum modulus principle applies. There are no weight-two forms: forces a zero at , whose valence contribution exceeds .
Every nonnegative even modular weight other than two is with . If , take ; if and , take . For , choose such a monomial , whose constant term is one. Subtracting the constant term of gives , so
Induction on modular weight, together with , proves that every modular form is a polynomial in .
For algebraic independence, first fix one modular weight . All solutions of have the same residue of modulo three and the same parity of . Consequently their monomials can be written
for suitable . On an open set where the common factor and are nonzero, a linear relation would give a polynomial relation in
This is nonconstant. By the open mapping theorem, a polynomial vanishing on all its values must be the zero polynomial. Thus same-weight monomials are linearly independent.
Different modular weights cannot cancel either. Suppose with each weighted homogeneous. Transform by . At any fixed this gives
The numbers are infinitely many distinct values, so the polynomial in that number vanishes identically, and every . The same-weight independence then sets every coefficient to zero. This is the graded weights separate analytic polynomial relations argument. Hence
with algebraically independent generators. Multiplying the two Eisenstein series by their nonzero lattice-normalization constants does not alter either generation or independence.