Chebyshev polynomial Created 2026-09-24 Updated 2026-10-18
The first-kind Chebyshev polynomial converts a multiple-angle cosine into a polynomial:
The cosine addition formula gives the recurrence relation
This constructs polynomials valid for every real , including outside , where the real-angle description is unavailable. For example,
For , has polynomial degree and leading coefficient . On its uniform norm is one, even as its oscillations become more numerous.[ref][ref]
The polynomial roots of are especially simple:
They correspond to equally spaced angles, but their locations in cluster near and . For , the polynomial roots are . For , the positive polynomial roots are approximately , with their negatives completing the set. The distance from the right endpoint to the nearest polynomial root is ; central neighboring polynomial roots are separated on the larger scale . The small change of cosine near angles zero and explains the clustering.
Figure 1.
Analytical illustration of the eight roots of T8: equally spaced angles on a semicircle project to endpoint-clustered interpolation nodes
. Details.
These polynomial roots supply interpolation nodes for a polynomial interpolation of polynomial degree at most . They differ from the Chebyshev-Lobatto nodes , which include both endpoints. This choice of polynomial roots has nodal polynomial
The monic Chebyshev extremal polynomial minimizes the uniform norm of this product among monic polynomials of polynomial degree on . Consequently, if has continuous derivatives, the usual polynomial interpolation error gives the useful bound
This optimizes the nodal factor in that bound, not the actual error for every function. Endpoint clustering helps control the large endpoint oscillations of equally spaced interpolation associated with Runge's phenomenon. The two node conventions and their geometric construction are discussed in Trefethen's authored text.[ref]
The same cosine substitution for polynomial approximation explains the weighted orthogonality:
The endpoint singularities of the weight are integrable. Thus the Chebyshev polynomials are orthogonal polynomials for this weight, making coefficients in a least-squares polynomial in an orthogonal-polynomial basis separate cleanly. Their polynomial roots also give Chebyshev–Gauss quadrature, connecting polynomial interpolation to Gaussian quadrature.[ref]
Accuracy still depends on the target function. The absolute value function has a corner at zero, so the hypothesis requiring continuous derivatives in the displayed polynomial interpolation error bound fails. Endpoint clustering cannot remove that corner. A jump poses a stronger obstruction: polynomials are continuous functions, so they cannot converge in the uniform norm to a discontinuous function on the whole interval. Chebfun's documented examples show persistent overshoot for such jumps; these are a limitation of global polynomial interpolation, not a universal promise of rapid accuracy from Chebyshev polynomials.[ref]
Apply to a column coordinate vector, then apply in the same fixed basis. The function composition is
Thus the rightmost matrix acts first. The product is again a rotation matrix, since and . For planar rotations about the same origin, the sine addition formula and cosine addition formula give
For a concrete composition of rotation matrices, first rotate by radians, reaching , then by radians:
The total angle is . Reversing these two planar rotations gives the same answer, but noncommuting rotations about fixed axes show why one cannot assume that property for rotations in three dimensions.[ref]
Cosine addition formula Created 2026-09-29 Updated 2026-10-14
The cosine addition formula gives the horizontal coordinate after two successive rotations:
The minus sign comes from the way a counterclockwise rotation mixes horizontal and vertical coordinates:
The two rows recover the cosine addition formula and sine addition formula together.
Figure 1.
Adding angles rotates a coordinate pair and mixes its sine and cosine components
. Details.
With and , the resulting angle is , and
Although the horizontal coordinate becomes small, the vertical one approaches one; their squared sum still obeys the Pythagorean trigonometric identity. Taking in the cosine addition formula, together with the even function property of cosine and odd function property of sine, also recovers that identity.
Declination Created 2026-10-05 Updated 2026-10-14
Declination is the signed angle from the reference celestial equator to a direction, measured along its hour circle: . Positive declination means celestial north, rather than necessarily north of the observer's zenith. A direction with lies on the celestial equator; is the north reference celestial pole. Declination is an angle, not a height or a measure of Euclidean distance. [ref].
The connection to an observation follows from a dot product. In the elementary spherical-Earth, unrefracted model, an observer at geographical latitude has zenith direction in the same reference axes. Since for altitude , the cosine addition formula gives
At upper meridian transit, , so . For the synthetic site and synthetic direction , this yields . A direction with instead reaches , north of the zenith; positive declination does not imply a crossing on the southern half of the celestial meridian. A negative computed upper altitude means the direction never rises above the geometric astronomical horizon at that site.
For an angular readout, define signed zenith distance on the upper celestial meridian, positive toward the south and negative toward the north. Then . A synthetic southward readout at recovers . An unsigned distance alone would leave two possibilities, , when both are in range. A calibrated optical telescope must therefore record which side of the zenith it points toward. In this linear relation, a error in the assumed geographical latitude produces a error in inferred declination; averaging repeated readings cannot remove that shared offset. Near the astronomical horizon, uncorrected atmospheric refraction also invalidates the geometric readout.
The unit vector construction explains a subtle feature of sky maps. At fixed declination, changing right ascension traces a parallel whose radius on the unit sphere is . Its arc length is , with angles in radians; at , a right ascension increment spans a arc along that parallel. This arc is not generally the shortest great circle separation. At either celestial pole, all right ascension values represent the same direction: the coordinate singularity belongs to the coordinate grid. The unit vector remains regular there.
Euler's formula Created 2026-09-24 Updated 2026-10-14
For a real angle in radians, Euler's formula states
where is the imaginary unit. It connects the complex exponential to the sine and cosine coordinates of the unit circle. In particular, , and multiplying by rotates a complex number through angle without changing its modulus. At it gives ; at , it gives .
The identity makes angle addition algebraic: . Expanding the product and comparing real parts and imaginary parts recovers the sine addition formula and cosine addition formula. Differentiating gives , and differentiating again gives . Its real and imaginary coordinates therefore solve the harmonic oscillator equation. This is why complex exponentials are useful building blocks in Fourier analysis: differentiation acts on each frequency by simple multiplication.
A short justification separates the even and odd powers in the absolutely convergent power series for . The even powers give , and the odd powers give . The absolute convergence permits this regrouping. The formula thus links an analytic definition of the complex exponential to a geometric motion rather than merely introducing a convenient notation.
Leonhard Euler presents the relation between imaginary exponentials and sines and cosines in his 1748 Introductio in analysin infinitorum, volume 1, chapter VIII, section 138. His derivation uses limiting powers after connecting trigonometric addition to algebra. The original Latin and Ian Bruce's English translation can be read together in Euler, Introductio, chapter VIII, section 138.
Interpret the displayed two-harmonic form as a leading term in a weakly nonlinear expansion. Write and . The linear operator multiplies by
For , this is and , respectively. Thus detuning of a wave resonance enters at the same order as the quadratic forcing. The cosine addition formula gives
Projection onto the two resonant harmonics by harmonic balance requires
The nonzero branches are therefore
The two signs are related by a half-period translation of ; the trivial branch also exists.
The nonresonant first correction supplies the generated mean, third harmonic and fourth harmonic. Their linear multipliers at are , giving the nonresonant part
Further resonant amplitude corrections are determined at higher order. Consequently the nonzero answer describes an asymptotic periodic travelling wave with additional harmonics. Literally retaining only the two displayed harmonics cannot be an exact nonzero solution: their square has a positive constant term, while the linear operator applied to the two cosines has no constant term. The distinction is essential to interpreting this perturbative ansatz.
Differentiation gives
The initial conditions set the constant to one, so
the Pythagorean trigonometric identity.
Since , Taylor theorem with Lagrange remainder gives
for some , while
for some . The intermediate value theorem supplies with . The sine addition formula gives . The analogous cosine addition formula gives , so
Thus is a periodic function.
For fixed , converges absolutely and uniformly. Thus for integrable , one may integrate the kernel series term by term. The cosine addition formula gives
Substitute this into the defining integral. The constant kernel term gives ; the remaining terms give
where
These are the same Fourier coefficients as in part (a). The kernel is the Poisson kernel for the unit disk; the factors suppress the higher angular frequencies inside the disk.
Let for integer . In the even or odd power series whose parity matches , the numerator in the recurrence relation vanishes at the coefficient of . All coefficients of lower powers in that parity are nonzero, and all higher ones vanish. Therefore a polynomial solution exists, of polynomial degree , containing
For nonnegative these are the Chebyshev polynomials . The normalized low-degree cases follow directly from the recurrence relation:
Enforcing gives
To see that normalization at one is always possible, set in the Chebyshev differential equation. For , the differential expression becomes . Thus gives on and has value one at . It is a polynomial because the cosine addition formula gives . Negative integer produces the same solution as .
Series RC impedance 2026-10-18
Consider a stipulated series circuit containing an ideal resistor of electrical resistance and an ideal capacitor of capacitance . The same electric current passes through both. Their terminal electric potential differences add by Kirchhoff's voltage law, so
A quick derivation uses : taking the derivative of the complex exponential multiplies the capacitor voltage phasor by , hence . Dimensionally, has units , matching .
At frequency , the angular frequency is . The signed capacitive electrical reactance, modulus and complex argument of the total electrical impedance are
Apply across the complete series circuit. Its root mean square electric current is
With voltage as the zero-phase reference, the current phasor has complex argument : electric current leads. The phasor drops have moduli and ; these add as complex numbers, not as positive magnitudes. Their squared magnitudes sum to .
Figure 1. . Original calculated ideal , model, not measured data or a filter transfer function. Left: the electrical impedance remains on and approaches the real axis as frequency increases. Right: its modulus and voltage-minus-current phase difference. The marked case matches the worked example; marks , , and . Details.
The mean absorbed power uses the root mean square values:
The ideal capacitor has zero cycle-averaged absorbed power; all the mean absorbed power becomes Joule heating in the resistor.[ref] To see why the phase factor appears, average over a full cycle with and . The cosine addition formula reduces the average to ; the term at averages to zero. Independently, , and the capacitor energy returns to its starting value after each cycle.
At fixed applied , the limit gives , and : the ideal capacitor blocks steady electric current. The limit gives , and . These are limits of the ideal lumped electrical circuit; unwanted lead inductance and component losses can invalidate that model at high frequency. At , the equal legs of the impedance right triangle give and without numerical evaluation. Measuring both the magnitude and the sign of the phase difference distinguishes this capacitor response from an equally large positive electrical reactance.
Sine addition formula Created 2026-09-29 Updated 2026-10-14
The sine addition formula evaluates the vertical coordinate after two successive rotations:
Here are real angles measured in radians; the identity also extends to complex arguments. It is useful when a new angle can be assembled from familiar ones. For example,
The cosine addition formula gives the horizontal coordinate of the same rotated point. Both formulas follow by multiplying a rotation matrix by the unit vector , rather than by adding the individual coordinate values. [ref]