Spectrum of a bounded operator Created 2026-09-28 Updated 2026-10-14
Let be a Banach space over the complex numbers, and let be a bounded linear operator defined on all of . Its spectrum consists of those for which has no everywhere-defined bounded inverse. Its complement is the resolvent set of an operator . By the bounded inverse theorem, a bijective automatically has a bounded inverse. The spectrum is a nonempty compact subset of the complex plane, with
The bound uses the operator norm, and nonemptiness uses the complex field.[ref] For a real linear operator, complex spectral values are understood by extending it to a complex vector space; restricting to the real field can give an empty set.
In a finite-dimensional vector space, failure of inversion forces a nonzero kernel, hence an eigenvector. An infinite-dimensional vector space allows an injective shifted linear operator that cannot solve every equation . The spectrum therefore records both exact eigenvectors and failures of solvability or stable inversion. Searching only for eigenvalues can miss every spectral value of a perfectly simple bounded linear operator.
Consider the multiplication operator on the complex L2 space , with Lebesgue measure:
Its operator norm is one. The inequality gives the upper bound; unit vectors concentrated near approach it. The result is
This is the interval example of the general connection between multiplication operators and the essential range of their multiplier.[ref] Indeed, an eigenfunction would satisfy almost everywhere. It vanishes except possibly on the singleton , a null set; such a function is the zero vector in L2 space. Concentrating at one point cannot produce a nonzero L2 function.
For , the inverse is completely explicit:
The distance to a set is positive, so the inverse multiplier is bounded. Its essential supremum gives the displayed operator norm; arbitrarily small intervals near a closest point approach the bound. Our resolvent of an operator uses , the negative of this inverse, with the same operator norm. For , , and , the inverse norms are respectively , , and . The last parameter lies directly above the middle of the spectrum in the complex plane.
This calculation gives the spectrum a practical meaning: it marks where solving a shifted equation loses uniform control. At , the largest amplification of an input error is . Changing from to increases that factor from ten to one hundred. The equation remains uniquely solvable for each nonzero , but its sensitivity grows as the parameter approaches the spectrum.
Figure 1.
An interval without eigenvectors and a diagonal spectrum accumulating at zero
. Details.
To see directly why every belongs to the spectrum, choose and define a clipped interval and a normalized indicator function:
Its L2 norm is exactly one, including at both endpoints. On its support, , giving
Thus any choice produces approximate eigenvectors. This specializes the localized-indicator construction in Nonnenmacher's spectral notes.[ref] A hypothetical bounded inverse would imply , impossible for arbitrarily small .
For an interior point with , and the residual is exactly . At or , and the same residual formula holds, but the amplitude is rather than . At , taking gives amplitudes approximately and residuals . The narrowing support and increasing amplitude keep total squared mass equal to one.
For every , the continuous spectrum description is also concrete. Any L2 function can be approximated in L2 norm by its truncations to . Each truncation lies in the range of , since division there is bounded. The range is therefore dense. However, the constant function has no L2 function preimage: is not square-integrable, including at the endpoints.
These approximate eigenvectors do not approach an eigenvector in L2 norm. Any possible limit would have L2 norm one and satisfy by continuity, contradicting the empty point spectrum. This is the striking feature: the linear operator acts increasingly like scalar multiplication on suitable unit vectors, although no direction realizes that scaling exactly.
Figure 2.
Unit L2 vectors concentrate while their spectral residual tends to zero
. Details.
A complementary example is the diagonal operator on sequence space on complex l2 sequence space, with . The coordinate unit vectors satisfy , so
Zero is not an eigenvalue, since forces every coordinate to vanish. Nevertheless : these are approximate eigenvectors at zero. More concretely, belongs to l2 sequence space, but would require for all , which does not. Outside the displayed closed set, division by is uniformly bounded, proving that no further spectral values occur. Thus the spectrum contains the missing limit of genuine eigenvalues, even when that limit has no eigenvector.
Specular reflection 2026-10-13
At a smooth mirror with unit normal vector , an incoming unit direction has outgoing direction . Thus the incident and reflected rays make equal angles with the normal.
More precisely, specular reflection redirects each incident light ray into the direction prescribed by the law of reflection, rather than spreading it over many outgoing directions. The incident light ray, reflected light ray, and local normal vector lie in one plane. The surface must be sufficiently smooth on the scale of the wavelength for this model to describe its reflected beam; a visibly flat surface can still scatter light if its microscopic roughness is appreciable. [ref].
The displayed formula uses unit vectors and the dot product. It preserves the component parallel to the mirror and reverses the normal component. For a mirror along , take and . Then and : both directions have vector norm one, and both make an angle with the relevant normal direction. Replacing by leaves the result unchanged.
This same local rule explains a flat mirror's virtual image. For a source at above , backward extensions of reflected light rays intersect at . The light remains above the mirror; its apparent origin lies below it. A curved mirror changes its normal vector from point to point and can instead make reflected light rays converge. The geometry of image formation therefore starts with one simple direction rule. [ref].
// Target: optics.bigb
Sphere center from three tetrahedron face distances Created 2026-10-07 Updated 2026-10-14
For a positively oriented basis , put . The center of an interior sphere at distance from each of the three tetrahedron face planes through the origin has the displayed expression. The three inward unit vectors are the normalized cross products , , . Taking inner products with these vectors solves three independent signed-distance equations. Reversing some signs instead produces centers on exterior sides. Existence of a sphere contained in the full tetrahedron also requires clearance from the fourth face.
Spherical geometry 2026-10-13
Spherical geometry studies lengths and angles measured along the surface of a sphere, rather than through its interior. It is a useful model whenever travel is constrained to a round surface. Its straightest paths are great circle arcs: they are geodesics, even though they appear curved in the surrounding Euclidean space. Two distinct great circles meet at an antipodal pair, so the parallel-line picture of Euclidean geometry does not apply.
For a sphere of radius , write two positions as , with unit vectors. Their shorter surface route has great-circle distance
where the dot product gives the central angle in radians. The straight chord through the surrounding Euclidean space instead has length . For a quarter-circle separation these are and : specifying which distance we mean has a measurable effect. On the unit sphere, and great-circle distance equals the central angle.
Consider the spherical triangle with vertices , and , joined by the shorter great circle arcs. Each side has length . At each vertex the two outgoing tangent vectors point along the other coordinate axes and are orthogonal, so all three interior angles are . This is the positive coordinate octant of the sphere, not a flat triangle drawn inside it.
For a convex minor spherical triangle with interior angles in radians, the spherical excess formula states
Our octant therefore has area . Independently, eight congruent octants partition the sphere, giving again. Thus angles alone determine area when is fixed, unlike Euclidean geometry, where similar triangles can have arbitrarily different areas. The Gauss-Bonnet theorem explains the connection: the sphere's constant Gaussian curvature times the area equals this excess. For spherical triangles whose area is small compared with , the excess is small, recovering the familiar flat picture.
Figure 1.
Three quarter-great-circle sides enclose a spherical octant with three right angles and area
. Details.
Spherical law of cosines 2026-10-14
For a nondegenerate convex minor spherical triangle, the spherical law of cosines relates two angular sides , their included interior angle , and the opposite angular side :
Relabelling the vertices gives the corresponding formulas for and . As with the spherical law of sines, physical side lengths must first be divided by the sphere's radius. The spherical law of cosines determines uniquely from when the data describe such a spherical triangle. It also recovers each interior angle from three sides, for example
Using the cosine and the range selects a unique angle, avoiding the supplementary-angle ambiguity of an inverse sine calculation.
To derive the spherical law of cosines, let be the vertex unit vectors at , so , and . The outgoing unit tangent vectors at are and . Their dot product is both and , proving the identity. This gives a geometric explanation: spherical trigonometry compares angles in the tangent plane using vectors in the surrounding Euclidean space.
For a worked example on the unit sphere, take the vertices
At , the outgoing unit tangent vectors are and , so the interior angle is a right angle. The vertex dot products give . The spherical law of cosines then reduces to the right-angle identity , giving
To find , use the relabelled spherical law of cosines:
The physical side lengths on a sphere of radius are and . For example, on a toy sphere with metres they are approximately , and metres; the interior angles stay the same. Applying the planar Pythagorean theorem directly to the angular sides would instead give . That flat right triangle calculation does not give the great-circle distance between and .
Figure 1.
A non-octant spherical triangle with a right angle at , angular sides and , and interior angles
. Details.
The familiar law of cosines reappears as a local approximation. With all small in radians, substitute the small-angle approximations and into the spherical law of cosines and keep terms through second order:
Multiplication by gives the planar law of cosines for the physical side lengths. For a fixed small surface triangle on a progressively larger sphere, the angular sides shrink and this approximation improves. Thus the curved and flat formulas fit together: the Pythagorean theorem is recovered locally when is a right angle.
Spherical law of sines 2026-10-14
For a nondegenerate convex minor spherical triangle, with angular sides opposite interior angles , the spherical law of sines states
The sines of sides refer to central angles, so a physical side length on a sphere of radius must enter as . All six angles lie in , and the denominators are positive. The reciprocal form, , is equivalent. This is Tatum's sine formula, equation 3.5.1, in Celestial Mechanics, section 3.5: spherical sine and cosine formulas.
A short proof explains the symmetry of the spherical law of sines. Let be the vertex unit vectors at . At , the outgoing unit tangent vectors towards are and . Their angle is , so the magnitude of their cross product is . Since both tangent vectors are orthogonal to , the scalar triple product obeys
Dividing by proves the spherical law of sines. Its beauty is that the same three-dimensional scalar triple product can be calculated at any vertex, producing all three ratios at once.
For the spherical triangle worked out under the spherical law of cosines, , and . Hence , and the spherical law of sines gives
The inverse sine gives , but the supplementary angle has the same sine. The spherical law of sines alone therefore leaves two candidates for this angle. The spherical law of cosines, using the known three sides, gives and selects ; likewise . When only two sides and an opposite angle are given, two distinct valid spherical triangles can remain. A cosine relation resolves an inverse sine branch only when enough additional data are known; it does not make every ambiguous data set unique.
Spherical trigonometry 2026-10-14
Spherical trigonometry calculates the sides and interior angles of spherical triangles using trigonometric functions. Its sides must be shorter great circle arcs, which are geodesics on a round sphere. A curve at constant nonzero latitude does not qualify. The spherical law of sines and spherical law of cosines play the roles of the familiar flat-triangle rules, but account for the sphere's curvature.
Use uppercase both for the vertices and for their interior angles, and lowercase for the opposite angular sides. For example, is the central angle subtended by the arc from to . On a sphere of radius , its physical arc length is when is in radians; similarly and . Only on the unit sphere do the angular and physical side lengths have the same numerical values. See J. B. Tatum, Celestial Mechanics, chapter 3, section 3.5: great-circle sides and angular units.
One useful application of spherical trigonometry is finding great-circle distance from spherical coordinates. Write a unit vector as , where is latitude and is the equatorial azimuth, or longitude, measured from a chosen reference direction. The dot product of two such unit vectors gives
Here is the central angle and is the great-circle distance. The same identity follows from the spherical law of cosines by adding the north pole as the third vertex, with angular sides and . This connects spherical geometry to position calculations in astronomy and to navigation on a spherical model of Earth. Choosing the surface model matters: Paula Neeley and Anthony Narkawicz, Map Projection Induced Variations in Locations of Polygon Geofence Edges, NASA/TM-2017-219675 (2017), sections 2-3 distinguishes spherical and ellipsoidal geodesics and gives this coordinate identity.
For a toy example, put two points at latitude , with equatorial azimuths and . The great-circle distance and the arc length along constant latitude are
The great circle takes a shorter route by bending towards the pole in these spherical coordinates. To locate its highest latitude, the endpoint unit vectors are and . Their great circle lies in the plane through the origin with . On its shorter arc, the maximum latitude occurs at and is . Thus a geodesic can change latitude substantially even when its endpoints have equal latitude. These are lengths on an ideal sphere; the example illustrates the geometry rather than specifying an actual flight route.
Figure 1.
On an ideal sphere, two points at latitude and longitudes are joined by a shorter great-circle arc reaching latitude
. Details.
Historically, spherical trigonometry was prominent in teaching as well as in astronomy. John Conway and Alex Ryba note its presence in early twentieth-century school textbooks in Remembering spherical trigonometry, The Mathematical Gazette 100(547), March 2016, pages 1-8, DOI 10.1017/mag.2016.3. Their introductory observation documents that teaching history; it does not identify a single inventor of the spherical law of sines or spherical law of cosines.
In Minkowski spacetime with metric signature , write two nonzero future-pointing null vectors as and , where and are unit vectors. Their Lorentzian inner product gives
Thus their sum is a future-pointing causal vector. It is a null vector exactly when the spatial directions coincide, and a timelike vector otherwise. The positivity of the time components is essential: adding past- and future-pointing null vectors can instead produce a spacelike vector.
A path along a circle can have variable areal velocity. As an illustrative controlled trajectory, keep a point mass on a circle of radius with angle
Its acceleration in polar coordinates and the required net force are
where and are the radial and transverse unit vectors. A circular guide can supply the radial force, while a tangential drive supplies . Hence
For in illustrative units, the three equal time intervals , and sweep areas , and . Their difference comes from the transverse force's positive torque, even though the radius and path shape stay fixed. The area under each areal velocity graph segment equals the corresponding swept area.
Figure 1.
A transverse force gives increasing areal velocity and unequal swept areas in equal times
. Details.
Unit-direction kinetic-energy identity Created 2026-10-06 Updated 2026-10-07
For a twice differentiable position away from the origin, write with radial unit vector . Its unit-length constraint gives and , separating radial and directional contributions to speed and kinetic energy. The identity is kinematic and does not require a particular force law.
Unit tangent vector Created 2026-09-24 Updated 2026-10-14
For a regular curve with nonzero velocity vector, its unit tangent vector is
The Euclidean norm in the denominator removes the traversal speed, leaving a unit vector that records direction. A positive change of traversal speed leaves this direction unchanged; reversing the direction of travel reverses . In arc length coordinates, .
For the parabola , the velocity vector is and the speed is . At , . The tangent vector and the unit tangent vector point in the same direction, but only the latter has Euclidean norm one. The principal normal vector is a further choice based on how this direction changes, where the curvature is nonzero. [ref]
Unit vector Created 2026-09-24 Updated 2026-10-14
A unit vector is a vector of norm one in a normed vector space. For a nonzero vector , vector normalization produces one by dividing by . In a real Euclidean space, this keeps the direction and removes the magnitude. The zero vector cannot be normalized because its norm is zero.
For with Euclidean norm , the corresponding unit vector is
The Euclidean vector can therefore be reconstructed as : size and direction are distinct pieces of information. The standard basis vectors are familiar unit vectors, but a unit vector need not point along a coordinate axis.
Figure 1.
Normalization keeps direction and places the endpoint on the unit circle
. The original Euclidean vector has magnitude . Its vector normalization lies on the unit circle. The enlarged right panel also shows its negative, which has the same Euclidean norm and the opposite direction. Details.
Valence shell electron pair repulsion theory Created 2026-10-14 Updated 2026-10-14
The VSEPR model predicts approximate molecular geometry by arranging the electron domains around a central chemical atom to reduce their mutual repulsion. Start with a Lewis structure, count the domains, and then distinguish the resulting electron pair geometry from the positions of the chemical atoms themselves. A lone pair counts as a domain even though it is not another chemical atom.[ref]
Three worked counts have the same total of eight valence electrons. In methane, carbon's four plus the contributions of four hydrogen chemical atoms give : four bond pairs, no lone pairs, and tetrahedral molecular geometry. In ammonia, nitrogen's five plus three from hydrogen give : three bond pairs and one lone pair, producing trigonal pyramidal molecular geometry. In water, oxygen's six plus two from hydrogen give : two bond pairs and two lone pairs, producing bent molecular geometry. All three have four electron domains; their molecular geometries differ.
Figure 1.
Four electron domains give three molecular shapes as lone pairs replace bonded neighbours
. Details.
The regular tetrahedral directions can be represented by the unit vectors
Each pair has dot product , so the ideal bond angle is . This is a geometric calculation, rather than a prediction that every four-domain molecule has that exact bond angle. Lone pairs and different kinds of chemical bonds distort the ideal arrangement; water's H–O–H angle is about .[ref]
The model is attractive because small-number bookkeeping produces a spatial prediction without first solving for every molecular orbital. Shape then helps explain chemical polarity and which hydrogen bond donor or hydrogen bond acceptor sites are accessible. It is a qualitative model, not a full calculation of the electronic energy or a universal solution for every chemical compound. Gillespie and Nyholm's 1957 review [ref] is a historical anchor for its development.
Vector coloring Created 2026-10-05 Updated 2026-10-14
A vector -coloring, for , assigns a unit vector to each vertex of a graph, such that on every edge. A graph colouring with colors gives a vector -coloring by placing the colors at the vertices of a regular simplex. The Gram matrix of these vectors allows semidefinite programming to search for such a representation.