The word "projection" does not mean ordinary perpendicular projection in the plotted Euclidean space. For the same reference and mean constraint, minimizing the squared Euclidean distance in the three probability coordinates instead givesThus the Euclidean minimizer is , whereas the information projection has . The squared Euclidean objective at its own minimum is ; its relative entropy is approximately nats, larger than the optimum nats. Both distributions satisfy the same constraint.
The reference and objective encode what "least change" means. Relative entropy is asymmetric and is not a metric; its minimization answers a different question from linear least squares. The useful geometric analogy comes from a Pythagorean inequality for information projection, rather than from an assertion that the colored contours are circles.
Johnson–Lindenstrauss lemma Created 2026-09-28 Updated 2026-10-14
For and any points in a Hilbert space, there is a linear map into Euclidean dimension that multiplies every pairwise distance by a factor between and .
The striking feature is that the target dimension depends on the number of points and the allowed error, independently of the ambient dimension. Fix a finite set , with , and . An equivalent sufficient statement uses squared Euclidean distances: a linear map exists, with , such thatThe finite-set theorem cited here supplies an explicit sufficient target dimension for this squared-distance formulation. [ref]
An elementary proof of a theorem of Johnson and Lindenstrauss by Sanjoy Dasgupta and Anupam Gupta. An elementary proof of a theorem of Johnson and Lindenstrauss, Theorem 2.1, p. 61: bounds for squared distances
Taking square roots gives distance factors and , which lie inside . Conversely, bounds on distances only give squared-distance bounds ; the same numerical tolerance should not be silently used for both. Under the squared-distance bounds, the bi-Lipschitz distortion is at most .
The Johnson–Lindenstrauss lemma preserves this fixed finite set, rather than every vector in the ambient Euclidean space. A linear map with has a nonzero kernel by the rank-nullity theorem, so some nonzero vectors collapse completely. For finitely many points in a real Hilbert space, apply the finite-dimensional argument on their linear span and extend by orthogonal projection onto that linear span. If the sufficient target dimension exceeds the ambient dimension, the identity map already preserves every Euclidean distance exactly, with zero padding if a larger target is requested.
Life glider 2026-10-13
The Life glider is a five-cell pattern that recreates its shape after four generations, shifted one cell along each coordinate. Use increasing rightward and increasing downward, as in the figure, and start from the live setEvery cell outside starts dead. Applying the Conway's Game of Life rule, rather than moving the drawing by hand, gives:
For an exact check of every frame, the intermediate live sets areHere means add to each ordered pair in . In the first step, the live cells and have respectively one and one live neighbors, so die; the other three have respectively three, three and two and survive. Exactly and are born, with three live neighbors each. This derives and explains how motion can occur while individual cells merely switch states.
Because the rule uses the same relative neighbors at every position, applying the global update function and applying a translation commute. Thus for every generation ; the four-step calculation establishes continued motion on the infinite board. The average displacement is cells per generation, or Euclidean distance per generation. The live-cell count happens to stay five in these frames, but the rule does not conserve live-cell count in general: a single isolated live cell dies immediately. The Life glider persists indefinitely in an otherwise empty infinite board; encounters with other patterns or a finite implementation's edge can change that conclusion.
// Destination: computer-science.bigb
Locus (mathematics) 2026-10-18
Mahalanobis distance 2026-10-14
For a positive-definite covariance matrix, this is Euclidean distance after whitening. It accounts for both scales and correlations and is invariant under consistent nonsingular linear changes of coordinates. Estimating the covariance can be unstable with small samples, and a singular covariance requires restricting to a nonsingular subspace rather than claiming an ordinary metric on the full space.
Maximum separation of two circles 2026-10-14
For two nonempty planar circles with centers and radii , the greatest Euclidean distance between their points is the displayed expression. The triangle inequality gives the upper bound. When the centers differ, choose the two boundary points outward along the line of centers to attain it; when they coincide, choose opposite radial directions. For any third nonempty circle and a point on it, proves . This is not a metric, since for a positive-radius circle.
Metric space Created 2026-09-24 Updated 2026-10-14
A metric space is a set together with a metric measuring how far apart its elements are. The elements can be positions, functions, or other objects: what matters is that the metric obeys the same basic rules. This lets one discuss convergence in a metric space, continuous maps, and Cauchy sequences without first assigning Cartesian coordinates. The useful abstraction is that many arguments require only comparisons of distances, rather than the particular objects being compared.
Even the same set can support several informative metrics. On the plane with Cartesian coordinates, write and . Three standard choices are Manhattan distance, Euclidean distance, and Chebyshev distance:They come from the L1 norm, Euclidean norm, and maximum norm, respectively, through . For and , Manhattan distance is , Euclidean distance is , and Chebyshev distance is . All three answers are correct for their respective metrics.
The choice encodes the question being asked. Manhattan distance models travel along a rectangular street grid. Euclidean distance measures unrestricted travel along a line segment. Chebyshev distance measures the time needed when two Cartesian coordinates can change simultaneously, each at speed at most one. Thus choosing a metric is part of modelling, rather than a consequence of knowing the endpoints. These examples have the same metric topology, but different metric path lengths and different collections of metric geodesics.
A historical reference for the general study of metric spaces is Maurice Fréchet's 1906 paper Sur quelques points du calcul fonctionnel, published in volume 22 of the Rendiconti del Circolo Matematico di Palermo. [ref]
https://link.springer.com/article/10.1007/BF03018603. Fréchet, Sur quelques points du calcul fonctionnel, 1906
Minkowski metric Created 2026-09-24 Updated 2026-10-14
With the mostly-plus metric signature and coordinates , the Minkowski metric is the nondegenerate bilinear formIt is a symmetric bilinear form, but not a positive-definite bilinear form. For example, is nonzero yet , making it a null vector. This does not make the Minkowski metric degenerate: some other vectors have nonzero pairing with .
Applied to infinitesimal displacements, the Minkowski metric givesFor a timelike curve, a clock records . For a null curve, . For spacelike separation, the positive Minkowski interval measures a different kind of separation. A Lorentz transformation preserves this form, expressed in matrix notation by , although it need not preserve ordinary Euclidean distance in the four-component coordinate list.
Minkowski spacetime Created 2026-09-24 Updated 2026-10-13
Minkowski spacetime is the flat four-dimensional spacetime of special relativity: one time coordinate and three spatial coordinates, equipped with a Minkowski metric. More precisely, it is an affine space, so no spacetime event is a preferred origin; differences between spacetime events are four-vectors. Inertial frames give different coordinates to the same spacetime events, but agree on their Minkowski interval.
This geometry answers two different measurement questions with one structure. Which spacetime events can be connected by a light signal or a massive observer? The light cone classifies them. How much time does a moving clock record? Its world line and the Minkowski metric determine its proper time. The minus sign in the Minkowski metric is what allows these answers to differ from ordinary Euclidean distance.
For a concrete one-space-dimensional slice, start at the origin and measure in seconds and in light-seconds. The spacetime event at can be reached by an observer moving at , whereas would require to be reached directly from . The Minkowski interval distinguishes them even though both are three light-seconds away in that inertial frame.
Hermann Minkowski presented this geometric viewpoint in his Cologne lecture of 21 September 1908. His account treats particle histories as world lines, changes of inertial frame as choices of time axis, and clock readings as proper time. These are connected geometric ideas, rather than separate corrections to ordinary mechanics.[ref]
https://www.gutenberg.org/files/66944/old/66944-h/66944-h.htm. Minkowski, Space and Time, §§I–III; Saha's translation in the 1920 collection
Modulus Created 2026-09-24 Updated 2026-10-14
The modulus of a complex number isIt extends absolute value to the complex plane: the modulus is the Euclidean distance from to zero, or the Euclidean norm of its coordinate vector. The Pythagorean theorem gives , even though its two coordinates have sizes and . The modulus is always nonnegative, and is zero exactly at zero.
Two essential rules areThe second is the triangle inequality. For and , the product has modulus , while the sum has modulus . The strict inequality records that the two displacement vectors point in different directions.
The Euclidean distance between two complex numbers is . Consequently expresses geometric closeness without treating the two coordinates separately. This makes the modulus a natural measure of error in complex analysis; the triangle inequality bounds accumulated error, while the product rule tracks how multiplication changes its size. Equal moduli do not imply equal complex numbers: , , and all lie on the same circle around zero. The modulus records size and deliberately forgets direction; the argument supplies the missing information.
Nearest-centroid decision hyperplane Created 2026-10-20 Updated 2026-10-25
For two distinct centroids in a Euclidean space, equal squared Euclidean distances expand to the displayed affine hyperplane. It is their perpendicular bisector; each closed half-space consists of points at least as close to the centroid on that side. This proves weak linear separability after a two-centroid nearest-assignment step, allowing ties on the boundary. Coincident centroids are an essential exception: every point ties and the distance comparison supplies no nonzero normal vector.
Observed flux of an unresolved spherical emitter Created 2026-10-06 Updated 2026-10-14
For a uniformly emitting spherical body of radius at Euclidean distance , integration of its specific intensity over the apparent solid angle gives . For a blackbody, and the bolometric result is . A grey emissivity factor multiplies this expression; isothermality alone does not imply blackbody emission.
Observed radiative flux Created 2026-10-14 Updated 2026-10-18
For a steady point-like astronomical source with isotropy of emission, in transparent space with negligible relativistic or cosmological effects, conservation of energy spreads its luminosity over a sphere of surface area . Its bolometric observed radiative flux isThis inverse-square law reflects geometric dilution: the same emitted power crosses increasingly large spheres. It does not require light to lose energy on the journey. For a fixed luminosity, doubling Euclidean distance quarters the observed radiative flux. [ref].
With and parsecs, the result is . At parsecs, the same source gives . An ideal collecting area of at parsecs intercepts approximately , before detector losses.
Fixed luminosity gives inverse-square dimming; different luminosities can give equal observed flux; configuration diagram schematic, not to scale
. Details. Orthogonal change of coordinates 2026-10-18
An orthogonal change of coordinates relates two orthonormal bases of a real inner product space. With the new basis vectors as columns of an orthogonal matrix , old and new coordinate columns obey . Then , so Euclidean norm, Euclidean distance and angles are preserved. A quadratic form becomes . For a symmetric matrix, orthogonal diagonalization chooses so that the transformed quadratic form is a sum of eigenvalues times squared coordinates. This explains the principal-axis descriptions of a quadric surface.
Orthonormal coordinates 2026-10-25
Coordinates relative to an origin and an orthonormal basis preserve Euclidean distances: if , then . This matters when finding the eccentricity of a conic section in an oblique plane: arbitrary projected coordinates need not preserve the ratio of its semi-major axis to its semi-minor axis.
Parabola Created 2026-10-05 Updated 2026-10-18
A parabola is a plane curve whose points are equally distant from a focus and a directrix. In suitable coordinates it has equation , with . Its quadratic geometry can also describe a contour deformation through a saddle point.
For example, take a focus of a conic at and a directrix of a conic . Equality of squared Euclidean distances gives , hence . The point has distance to both the focus and the directrix. Its eccentricity of a conic is one. Unlike an ellipse, a parabola is unbounded and has only one matched focus-directrix description.
Past exam of the classical mechanics course of the University of Oxford 2023 1 a Solution 2026-10-25
Each simple pendulum moves in the vertical plane containing the pivots. Ignoring contact between the ideal rods and point masses, each rod can turn through a full circle. Thus the configuration space is the torusChoose generalized coordinates , measured from the downward vertical, positive towards the right and understood modulo . These angles are local coordinates on the torus, rather than a single globally one-to-one real coordinate chart. With upward Cartesian coordinate , the bob positions areTheir velocities satisfy , so kinetic energy from Cartesian position vectors givesThe spring length is the Euclidean distanceTaking gravitational potential energy zero at pivot height gives . The spring potential energy is , since is its natural length. Consequently the Lagrangian isIn the paper's notation ; this function is distinct from the time variable. This is the exact Lagrangian of two spring-coupled pendulums.
One alternative Lagrangian isIt corresponds to setting gravitational potential energy zero at the downward position. The constant disappears from every Euler-Lagrange equation. More generally, total-time-derivative invariance of a Lagrangian allows for any smooth .
Past exam of the materials science course of the University of Cambridge 2017 Paper 1 1 b Solution 2026-10-20
Each calcium cation has eight fluoride neighbours at the vertices of a cube: cubic coordination. Each fluoride anion has four calcium neighbours in tetrahedral coordination. Both unlike-neighbour Euclidean distances are , with the conventional cubic lattice parameter.
Apply the Goldschmidt packing principle at its limiting eight-coordinate geometry: the eight surrounding anions just touch one another and also touch the central cation. The anions form a cube of edge , so and . Eliminating givesEquivalently, . This is a limiting radius ratio rule, rather than a measured ionic-radius ratio. It does not assume that the calcium sublattice consists of mutually touching spheres: the calcium positions have face-centred cubic symmetry, but that symmetry alone does not specify which ions touch. A different construction with touching calcium spheres and fluoride just filling their tetrahedral interstitial sites would instead give ; that is the opposite contact limit, not the eight-coordinate anion-contact ideal used here.
Past exam of the materials science course of the University of Cambridge 2017 Paper 1 7 c Solution 2026-10-20
The nickel-rich matrix is a disordered substitutional solid solution on a face-centered cubic lattice. The ordered phase has the L12 structure, approximately : aluminium occupies cube corners and nickel occupies face centres. Its occupied-site geometry is often called ordered FCC, but its chemically labelled Bravais lattice is primitive cubic, with a four-atom basis. A face-centre translation exchanges chemical sublattices and is not a symmetry of the ordered crystal.
Each Al atom has twelve nearest-neighbour Ni atoms at Euclidean distance . Each Ni atom has twelve nearest neighbours too, but these are four Al and eight Ni. The chemical distinction matters for slip. In disordered , the shortest perfect Burgers vector isFor the ordered primitive cubic translation lattice, the shortest order-preserving perfect vector isThis does not imply that slip must dominate. A vector must lie in a favourable glide plane and have an accessible core structure and activation stress. Matrix dislocations commonly glide on systems. A single passage through leaves an antiphase boundary; a second matching passage restores order, giving total vector . Such a superdislocation has a longer total vector than , yet its constituent dislocations can move on the favourable close-packed planes and interact with the matrix. Paired motion balances line and antiphase-boundary energies, so the shortest abstract lattice translation alone does not select the active slip system.[ref]
Nickel based superalloy: dislocation structure by H. K. D. H. Bhadeshia. explanation of matrix translations, ordered-phase antiphase boundaries and paired dislocations
For centred data, classical multidimensional scaling from Euclidean distances constructs the observation Gram matrixwhere . By part (i), its nonzero eigenvalues agree with those of , the matrix used for principal component analysis before dividing by a covariance normalization.
If is the unit observation-space eigenvector, the corresponding classical multidimensional scaling coordinate column isThat is exactly the column of principal component scores. Consequently classical multidimensional scaling of Euclidean pairwise distances recovers the same reduced coordinates as principal component analysis, up to signs and arbitrary orthogonal transformations within equal-eigenvalue subspaces. Distances alone cannot fix translation or orientation. The equivalence presumes centred data and Euclidean distances; general dissimilarities need not yield a positive semidefinite Gram matrix or a corresponding data covariance matrix.


