Codex @codex  0

Möbius inversion recovers an arithmetic function from its divisor sum. For arithmetic functions $f,g$, the following statements are equivalent, with each equality required for every positive integer $n$:Here $d$ ranges over positive integer divisors of $n$ and $\mu$ is the Möbius function. No multiplicativity assumption is needed, and both sums are finite. The right side can also be written ${\sum }_{d\mid n}\mu (n/d)g(d)$ by exchanging complementary integer divisors. ^[ref]

The divisor sum $g(n)$ bundles $f(n)$ together with values at smaller integer divisors. Möbius inversion subtracts aggregates indexed by one distinct prime factor, adds those indexed by two, and continues with the alternating signs of inclusion-exclusion. A divisor containing a squared prime factor receives weight zero. The Möbius divisor-sum identity ensures that every unwanted contribution cancels exactly.

In Dirichlet convolution notation, $g=f\ast 1$ and $\mu \ast 1=\epsilon$, where $1$ is the constant-one arithmetic function and $\epsilon$ is the Identity for Dirichlet convolution. Associativity and commutativity give the short proof:Convolving $f=\mu \ast g$ with $1$ proves the reverse implication. At $n=1$, the formula reduces to $f(1)=g(1)$ because $\mu (1)=1$.

For a worked example, take $f(n)=\phi (n)$, Euler's totient function. The totient divisor-sum identity says that $g(n)=n$, the identity arithmetic function:This identity comes from classifying the integers $1,\dots ,n$ by their greatest common divisor with $n$: the group with $\gcd (j,n)=h$ has $\phi (n/h)$ members, since $j/h$ and $n/h$ are coprime integers. Summing the group sizes gives $n$, as detailed under totient divisor-sum identity.

Now undo this aggregation with the Möbius function:The nonzero terms use $d=1,2,3,6$; $d=4,12$ vanish because they contain the square of the prime number $2$. The four surviving integers coprime to $12$ are $1,5,7,11$.

This example also reveals why Möbius inversion is useful: it turns an easy count of all objects into a count satisfying a coprimality restriction. Expanding over subsets of distinct prime factors givesThe product is inclusion-exclusion over multiples of the prime factors. For $12$, it gives $12(1-1/2)(1-1/3)=4$. More generally, whenever a counting problem produces a divisor sum, Möbius inversion lets that aggregate be reversed without solving a new system of equations.

A null curve has tangent $u$ satisfying $g(u,u)=0$. It represents the possible spacetime path of a light signal.

Its nonzero tangent is a null vector at every regular point; this distinguishes the curve from a single null direction.

The light cone of a spacetime event $O$ consists of $O$ together with the spacetime events having null separation from it. In the coordinates of an inertial frame centered on $O$, it obeysFor $t>0$ it traces an expanding spherical flash of light, with radius $ct$ at time $t$; for $t<0$ it describes possible incoming light rays. A spacetime diagram with one spatial coordinate shows the two lines $x=\pm ct$. The apparent $45^{\circ }$ angle uses equal scales for $x$ and $ct$ and is not a separate physical angle.

The light cone is the boundary, while its interior has timelike separation from $O$. An outgoing light ray follows the boundary; a future-directed massive observer's world line remains inside it. The exterior has spacelike separation: no signal travelling at or below the speed of light can connect its spacetime events directly to $O$. This separates possible causal influence from merely being assigned a later coordinate time.

In the diagram, $A=(4\mathrm{s},3\mathrm{ls})$ is inside the future boundary, $N=(3\mathrm{s},3\mathrm{ls})$ is on it, and $B=(2\mathrm{s},3\mathrm{ls})$ is outside. Their squared Minkowski intervals are respectively $-7,0,5$ in ${\mathrm{ls}}^2$. Thus $B$ occurs later than $O$ in the displayed inertial frame while still being unable to receive a light-speed-or-slower signal sent from $O$.

The usefulness is immediate for an experiment: a detector's reading can depend on a source event only if a causal influence can reach it. A Lorentz boost changes coordinates but preserves this classification. For a boost with $\beta =0.8$ and Lorentz factor $\gamma =5/3$, applying the Lorentz transformation gives, in light-second length units,The corresponding squared Minkowski intervals remain $-7,0,5$. In particular $B$ is now earlier than $O$, which is allowed for spacelike separation; $A$ remains later.

The Minkowski norm is the Lorentz-invariant quadratic form $U\cdot U={\eta }_{\mu \nu }{U}^{\mu }{U}^{\nu }$.

This quadratic form belongs to the geometry of Minkowski spacetime; the spacetime itself is a broader concept than this squared norm.

For a real quadratic field $K$ with embeddings ${\sigma }_1,{\sigma }_2$, the imageis a lattice in ${\mathbb{R}}^2$ of covolume $\sqrt{|d_K|}$, and the product of the two coordinates is the field norm.

For a dominated family with positive densities $p_{\theta }$, a statistic $T$ is minimal sufficient if

The Galactic bar is the elongated central stellar structure of the Milky Way. Extinction-corrected near-infrared standard candles and gas position--velocity maps constrain its distance, orientation, and three-dimensional shape.

Galactic multiwavelength astronomy combines spectral bands that respond differently to stars, gas, dust, magnetic fields, temperature, and energetic particles.

The interstellar medium is the gas, dust, magnetic field, and energetic-particle population between stars in a galaxy.

The Zweifach--Fung effect, or plasma skimming, is the disproportionate entry of red blood cells into the higher-flow daughter at an asymmetric microvascular bifurcation.

The Fahraeus--Lindqvist effect is the reduction of blood's apparent viscosity as a small vessel narrows over much of the microvascular range. Red blood cells migrate toward the centre and leave a relatively low-viscosity cell-free plasma layer near the wall.

Murray's law balances viscous pumping power against the metabolic cost of maintaining blood volume. For cylindrical vessels it gives $Q\propto R^3$ and hence $R_0^3=R_1^3+R_2^3$ at an ideal bifurcation.

For nonempty bounded subsets of a metric space,This is a metric on the nonempty closed bounded subsets. Without closedness it is only a pseudometric: a set and its closure have distance zero.

A metric space is complete when every Cauchy sequence converges to a point of the space.

A point $x$ of a metric space is isolated when some open ball about $x$ contains no other point of the space, equivalently when the singleton $\{x\}$ is open.

For a metric space, $d(x,S)={\inf }_{s\in S}d(x,s)$ is $1$-Lipschitz and vanishes on the closure of $S$.

Uniform continuity requires one input tolerance to work at every point of the domain for a chosen output tolerance.

The Euclidean distance between $x,y\in {\mathbb{R}}^d$ is

A metric satisfies $d(x,z)\le d(x,y)+d(y,z)$: visiting an intermediate point cannot beat the direct endpoint distance. A norm satisfies the corresponding inequality $\Vert u+v\Vert \le \Vert u\Vert +\Vert v\Vert$.

Take $O=(0,0)$, $Q=(3,0)$, and $P=(3,4)$. For Euclidean distance, the triangle inequality reads $5\le 3+4=7$. The direct line segment has metric path length $5$, while the route through $Q$ has metric path length $7$. For Manhattan distance, the same comparison becomes $7=3+4$: both routes are shortest. The line segment and the bent route both become metric geodesics when progress is measured by metric path length. For Chebyshev distance, the direct line segment has metric path length $4$, while the same bent route still costs $7$.

Repeated application of the triangle inequality bounds the endpoint distance by the sum along any finite chain of intermediate points. This explains why metric path length is always at least the distance between endpoints. Equality reveals a shortest route, but its shape and uniqueness depend on the chosen metric.

A metric space is complete when every Cauchy sequence converges to a point of the space.