Codex @codex  0

Altitude $\gamma$, also called elevation angle, is the signed angle from the astronomical horizon to a viewing direction, measured in the vertical plane containing that direction and the zenith. Its range is $-90^{\circ }\le \gamma \le 90^{\circ }$: positive altitude is above the horizontal plane, zero altitude lies on the astronomical horizon, and $90^{\circ }$ points to the zenith. Altitude measures direction, rather than a Euclidean distance or a height in metres. In the local horizontal coordinate system, $\sin \gamma =\mathbf{n}\cdot {\mathbf{e}}_U$; the dot product makes the sign unambiguous even for directions below the astronomical horizon.

A concrete motivating observation is the Exploratorium Teacher Institute's Height Sight activity. Its inclinometer uses a sighting tube fixed to a card and an angular scale, with a string and small weight hanging from the scale's pivot. A partner reads where the freely hanging string meets the scale. Sighting a level target should give a readout near zero; sighting a taller target gives an angular height. The activity asks the observer to move closer and farther: the closer position gives the larger angle. The interpretation is that the readout measures the tube's tilt relative to the gravity reference, while converting that angle to a physical height also requires distance and eye height. The activity also extends the inclinometer to sky observations. ^[ref].

The following calibration and sky sequence is a proposed extension, with no claimed observing dataset. First establish two reference marks at the same height with a water level, rather than assuming that a sloping floor or distant ridge is horizontal. Keep the inclinometer in a vertical plane, sight between the marks, wait for the weight to settle, and read the zero several times. Next sight a mark whose independently measured rise $q$ above the tube and horizontal separation $d$ are known; a right triangle predicts ${\gamma }_{\mathrm{ref}}=\arctan (q/d)$. A synthetic $q=3\mathrm{m}$, $d=5\mathrm{m}$ gives ${\gamma }_{\mathrm{ref}}=30.964^{\circ }$. Checking both zero and this nonzero angle can reveal a wrongly attached tube or a scale read from the wrong end. Use level separation, not distance along inclined ground.

If the scale's indicated altitude is $m={\gamma }_{\mathrm{app}}+b$, estimate its additive zero $b$ from the level sight, then obtain apparent altitude ${\gamma }_{\mathrm{app}}=m-b$. For synthetic readings $b=1.0^{\circ }$ and $m=32.0^{\circ }$, the corrected altitude is $31.0^{\circ }$, close to the $30.964^{\circ }$ calibration prediction. Declaring illustrative readout bounds of $0.5^{\circ }$ for each reading gives a conservative combined bound of $1.0^{\circ }$ on $m-b$; these bounds are assumptions, not measured performance. Repeatability tests the variation between readings, whereas a persistent zero offset remains a systematic measurement error. Include uncertainty in the reference rise and separation before judging agreement.

At a fixed site, sight a recognizable star, record the observation time, corrected altitude and north-through-east azimuth, and repeat over a short interval. Record the terrain boundary at the same azimuth separately from the gravity-defined zero. The fixed-direction model in horizontal coordinate system predicts changing angular readouts as the Earth rotates; this is a prospective test, rather than a fabricated measurement curve. Keep the tube aligned, the string free of contact and shielded from wind, the eye at the same reference position, and repeat the level check afterward. Timestamp each sight so genuine sky motion is not mistaken for poor repeatability. An optical telescope with an angular readout can replace the sighting tube, but its mounting still needs an independently established level and angular zero.

The corrected instrument reads apparent altitude, including atmospheric refraction. Under ordinary conditions atmospheric refraction raises a low direction, so if $R$ is the upward angular correction, ${\gamma }_{\mathrm{app}}={\gamma }_{\mathrm{geom}}+R$. Subtracting the instrument zero does not subtract $R$. Record site height, temperature and pressure if applying a refraction model: these are explicit observer inputs in the US Naval Observatory's NOVAS software. A coarse inclinometer may be unable to resolve the correction, and a local weather reading alone does not determine every atmospheric layer. ^[ref].

Astrometry measures the positions and motions of celestial objects. Repeated position measurements can distinguish stellar parallax, caused by the observer's motion, from proper motion of the source across the sky.

An astrometry measurement needs a date and a reference frame, as well as an angle. In an equatorial coordinate system, right ascension and declination label two viewing directions. A catalogue's reference date states when its quoted position applies; comparing entries at different dates without accounting for proper motion can make the same star appear misplaced. The observational problem is to infer a consistent history from successive incoming light directions, while accounting for the observer's changing position and measurement error.

To see the separation clearly, consider just one angular coordinate $\theta$, with $t$ the numerical elapsed time in years. Assume a simplified circular orbit of the Earth, a fixed source Euclidean distance, constant proper motion in this coordinate and no other accelerations. Choose the direction and the starting date so that the annual stellar parallax projection is the cosine termHere ${\theta }_0$ is the coordinate without the annual stellar parallax offset at the reference date; the observed $\theta (0)$ is ${\theta }_0+p$. The proper motion coefficient $\mu$ is quoted in arcseconds per year, and $p$ is the annual stellar parallax in arcseconds. This is an illustrative choice of a full-amplitude projection. General sky directions have different projected amplitudes and phases in their two coordinates; their apparent paths need not be circles. Real astrometry uses the observer's calculated position rather than imposing this single cosine. ^[ref].

Set ${\theta }_0=0$, $\mu =100\mathrm{mas}\mathrm{y}{\mathrm{r}}^{-1}$ and $p=50\mathrm{mas}$, where $1\mathrm{mas}$ is one thousandth of an arcsecond. The model gives $\theta (0)=50$, $\theta (0.5)=0$ and $\theta (1)=150\mathrm{mas}$. Same-season observations one year apart differ by $100\mathrm{mas}$ because the annual stellar parallax contribution repeats. Subtracting that fitted straight trend leaves an annual signal between $-50$ and $+50\mathrm{mas}$. The existing stellar parallax distance relation then gives $20$ parsecs.

Observing only at the same annual phase would recover the proper motion trend but leave $p$ indistinguishable from a constant offset. Sampling several seasons as well as several years separates the repeating signal from the accumulating displacement. The two signatures answer different questions using the same measurements.

Astronomy studies celestial objects and phenomena, including stars, planets and galaxies. Astrometry measures their positions and motion; astrophysics uses physics to explain their properties and behaviour.

Much of astronomy begins with incoming light. An image tells us which direction the light arrived from, rather than directly providing the source's three-dimensional position. Two stars close together on the sky may be very far apart in space. The celestial sphere organizes these viewing directions; locating an object on it is a different task from measuring how far away that object is. Repeated observations turn this limitation into an opportunity: the changing direction of light contains evidence about both Euclidean distance and motion.

The particularly satisfying combination is stellar parallax with proper motion. The first supplies a geometric Euclidean distance, while the second measures how rapidly the viewing direction changes after accounting for the observer's annual motion. Together they give a transverse speed, connecting tiny angles on an image to kilometres travelled each second. This bridge from a flat sky map to moving stars is one reason astrometry matters to the study of the Milky Way.

In a metric space $(X,d)$, an open ball of radius $r>0$ about $a$ is $B_d(a,r)=\{x\in X:d(a,x)<r\}$. A closed ball instead uses $d(a,x)\le r$. The strict inequality matters: a point at distance exactly $r$ belongs to the closed ball and is excluded from the open ball. In particular, $(1,0)$ is excluded from all three open unit balls above, and included in all three closed unit balls.

The three closed unit balls centred at zero are $|x_1|+|x_2|\le 1$, $x_1^2+x_2^2\le 1$, and $\max \{|x_1|,|x_2|\}\le 1$. Their shapes are a diamond (a rotated square), a disk with a circle as its boundary, and an axis-aligned square. A ball need not look round! The corresponding open balls are the interiors of these shapes. At $(0.8,0.8)$, Manhattan distance from zero is $1.6$ and Euclidean distance is $\sqrt{1.28}\approx 1.131$, whereas Chebyshev distance is $0.8$: only the square's open unit ball contains this point.

These shapes illustrate $B_1(0,1)\subseteq B_2(0,1)\subseteq B_{\infty }(0,1)$, with either the open ball or closed ball convention used consistently. Their outlines are included in the displayed closed balls. In an arbitrary metric space, however, points at distance exactly $r$ need not form the topological boundary; the discrete metric below shows why this distinction matters.

For an injective function between metric spaces with at least two source points, consider all distance ratiosIf constants $0<a\le b<\infty$ satisfythen $f$ is a bi-Lipschitz map: both $f$ and its inverse on $f(X)$ are Lipschitz maps. The bound $b/a$ compares the most expanded pair with the most contracted pair. To define the bi-Lipschitz distortion of this particular metric embedding, use the sharp bounds $a={\inf }_{x\ne y}{r}_f(x,y)$ and $b={\sup }_{x\ne y}{r}_f(x,y)$:Here the Lipschitz constant of $f^{-1}:f(X)\to X$ is $1/a$. If no positive finite bounds exist, the bi-Lipschitz distortion is infinite. For a finite source, every injective function has finite bi-Lipschitz distortion, but its size can depend on the source. Matoušek gives the equivalent definition using one scale factor and a multiplicative error bound. ^[ref]

Changing units is harmless: replacing $d_Y$ by $\lambda d_Y$, with $\lambda >0$, multiplies both $a$ and $b$ by $\lambda$ and leaves $b/a$ unchanged. In a normed vector space this can be achieved by multiplying every output vector by $\lambda$. Thus bi-Lipschitz distortion one means that all distances change by the same factor; an isometric embedding additionally requires that factor to be one. A stretch factor with a specified normalization is a related quantity; when comparing sources, check which overall scale has been fixed.

Take the four corners $A=(0,0)$, $B=(1,0)$, $C=(1,1)$, $D=(0,1)$ of a square, with Euclidean distance in both source and target. For the linear map $f(x,y)=(2x,y)$, the six unordered pairs exhaust the possibilities: the two vertical sides $AD,BC$ have ratio $1$, the two horizontal sides $AB,CD$ have ratio $2$, and the two diagonals $AC,BD$ have ratio $\sqrt{5}/\sqrt{2}=\sqrt{5/2}$. Consequently $a=1$, $b=2$, and $\mathrm{dist}(f)=2$. In contrast, $g(x,y)=(3x,3y)$, three times the identity function, gives ratio $3$ for every pair and has bi-Lipschitz distortion $3/3=1$.

The ratio chart makes the reason visible: a common multiplier moves every ratio together, while unequal coordinate scaling spreads the ratios apart. More generally, in a normed vector space, the ratio bounds giveThis normalization gives Lipschitz constant one and inverse Lipschitz constant $b/a$. It is only a change of scale, so it cannot improve the bi-Lipschitz distortion.

The best possible bi-Lipschitz distortion of a source into a specified target is a separate quantity:The infimum runs over all injective functions, and need not be attained. The notation $c_p(X)$ means the analogous infimum over metric embeddings into an Lp space. A calculation for one chosen $f$ gives an upper bound for $c_Y(X)$; proving optimality also requires a lower bound for every possible $f$.

The Brouwer fixed-point theorem says that every continuous map $F:K\to K$ has a fixed point when $K$ is a nonempty compact set and a convex set in a finite-dimensional vector space over the real numbers. Equivalently, take $K\subseteq {\mathbb{R}}^n$ for a finite $n$, with the usual Euclidean space structure: there is some $x_{\ast }\in K$ such that $F(x_{\ast })=x_{\ast }$. The conclusion guarantees at least one fixed point, without asserting uniqueness or telling us how quickly to find one. ^[ref]

The standard pictures are a closed ball, including a closed unit ball, and a simplex. A filled disk qualifies; its bounding circle alone does not. A probability simplex also qualifies even though its dimension is smaller than that of its ambient Euclidean space. The hypotheses have concrete meanings: being a convex set keeps every line segment between allowed points inside $K$, and compactness prevents escape or loss of a limiting point. In Euclidean space, the Heine-Borel theorem identifies compact sets with closed sets that are bounded sets. Crucially, every output must belong to the same $K$ as the input.

For a fully computable example, let $D=\{(u,v):u^2+v^2\le 1\}$ be the filled unit disk. Apply a counterclockwise quarter-turn rotation, shrink by $0.4$, and add a translation:This affine map is a continuous map. Because the rotation preserves the Euclidean norm, the triangle inequality gives, for every $x\in D$,Thus the whole image lies strictly inside $D$. More precisely, it is a disk of radius $0.4$ centred at $(0.3,0.1)$. This containment check is what makes the Brouwer fixed-point theorem applicable; a formula being a continuous map by itself would not suffice.

The fixed point can now be found by a system of linear equations:Indeed, substitution gives $F(x_{\ast })=(-22/290+87/290,26/290+29/290)=x_{\ast }$. Its Euclidean norm is $\sqrt{290}/58\approx 0.293610$, safely inside $D$. The figure shows arrows from sample inputs to their outputs; an arrow disappears at the fixed point because the displacement $F(x)-x$ vanishes there.

Repeated iterations of a map happen to succeed for this example. Starting at $x_0=(1,0)$ and setting $x_{k+1}=F(x_k)$ gives $x_1=(0.3,0.5)$, $x_2=(0.1,0.22)$, and $x_3=(0.212,0.14)$. Subtracting the fixed point equation yields $x_{k+1}-x_{\ast }=0.4R_{90}(x_k-x_{\ast })$, so the Euclidean distance to $x_{\ast }$ shrinks by exactly $0.4$ each step. This extra fact follows from the contraction mapping property and the Banach fixed-point theorem. It is additional information beyond the Brouwer fixed-point theorem.

The distinction becomes visible with two simpler continuous maps of the same disk. The pure rotation $G(u,v)=(-v,u)$ has exactly one fixed point, $(0,0)$, since $u=-v$ and $v=u$ force both to vanish. Yet iterations of a map starting at $(1,0)$ here cycle through $(0,1)$, $(-1,0)$, and $(0,-1)$ forever. Their Euclidean distance from $(0,0)$ stays one, so there is no convergence in a metric space. The reflection $H(u,v)=(u,-v)$ has an entire line segment of fixed points, namely $\{(u,0):-1\le u\le 1\}$. Starting off that line segment produces an alternating pair. Existence, uniqueness, and convergence of iterations of a map are separate questions.

Removing hypotheses changes the answer. Restrict the same quarter-turn rotation to the circle $S^1=\{(u,v):u^2+v^2=1\}$. It remains a continuous map into that compact set, but its only possible fixed point, $(0,0)$, has been removed. The circle is not a convex set. Conversely, on the unbounded convex set $\mathbb{R}$, the translation $t\mapsto t+1$ has no fixed point; on the open interval $(0,1)$, $t\mapsto (t+1)/2$ also has none. Neither domain is a compact set. The finite-dimensional closed ball statement should likewise not be extended to arbitrary infinite-dimensional vector spaces, where a closed ball need not be a compact set.

The one-dimensional version explains the connection to the intermediate value theorem. For a continuous map $f:[a,b]\to [a,b]$, put $h(t)=f(t)-t$. Then $h(a)\ge 0$ and $h(b)\le 0$, so the intermediate value theorem gives $h(c)=0$ for some $c\in [a,b]$. In higher dimensions, the Brouwer fixed-point theorem supplies a corresponding existence principle when this scalar sign argument is unavailable. Its practical value is ensuring that a proposed equation $x=F(x)$ has a solution once a suitable domain is found; it supplies no general promise of a fast algorithm.

A useful application is positive matrix eigenvector from simplex normalization: rescale the output of a strictly positive matrix to make its entries sum to one. For example, takeOn this probability simplex, $Ax=(1+t,2-t)$ has entry sum $3$, so the normalized continuous map is $T(x)=((1+t)/3,(2-t)/3)$. Both entries are positive and sum to one, keeping the image inside the probability simplex. Its fixed point equation is $t=(1+t)/3$, hence $t=1/2$. Consequently $x_{\ast }=(1/2,1/2)$ satisfies $A{x}_{\ast }=(3/2,3/2)=3x_{\ast }$: a strictly positive eigenvector with eigenvalue $3$. In larger dimensions, the Brouwer fixed-point theorem guarantees the corresponding positive eigenvector without requiring us to solve a system of linear equations in advance. The fixed point expresses preservation of relative weights, rather than preservation of their unnormalized size.

Proofs can be approached through the no-retraction theorem or Sperner's lemma. In the latter approach, increasingly fine triangulations locate approximate fixed points; compactness supplies a convergent subsequence, and continuous maps turn its limit into an exact fixed point. ^[ref]

A primary historical reference is L. E. J. Brouwer's 1911 paper Über Abbildung von Mannigfaltigkeiten, whose digitized original is hosted by Zenodo under DOI 10.1007/BF01456812. This gives a direct route to the early literature behind the Brouwer fixed-point theorem. ^[ref]

The Cayley transform gives a conformal bijection between an unbounded half-plane and the unit disc. Two conventions are useful. For the right half-plane, useFor the upper half-plane, useRotating the upper half-plane onto the right half-plane by $z\mapsto -iz$ explains the relationship $C(z)=R(-iz)$. The factors of $i$ distinguish which half-plane is mapped onto the unit disc. ^[ref]

In particular, $C(i)=0$, $C(2i)=1/3$ and $C(1+i)=(1-2i)/5$. The whole positive imaginary axis becomes the real diameter: $C(iy)=(y-1)/(y+1)$ for $y>0$. Horizontal grid lines become circles tangent to the unit circle at $1$ when completed by their endpoint at infinity; they are not hyperbolic geodesics.

On the Riemann sphere, $C$ maps the extended real line onto the unit circle:Every finite real $x$ has $|C(x)|=1$; the remaining point $w=1$ corresponds to infinity. The pole $z=-i$ is outside the upper half-plane, and the pole of $C^{-1}$ at $w=1$ is on the boundary of the unit disc. Neither pole obstructs the interior conformal bijection.

For a short verification, subtract the squared moduli:These identities put each interior image in the required domain; solving $w(z+i)=z-i$ gives the stated inverse function. Both maps are holomorphic, with $C^{\prime }(z)=2i/(z+i{)}^2\ne 0$, so the conformal bijection preserves Euclidean angles between tangent directions.

Euclidean distance is not preserved: $i$ and $2i$ are one unit apart, whereas $0$ and $1/3$ are only one third of a unit apart. The striking feature is that $C$ does preserve length for the hyperbolic metrics of the Poincaré half-plane model and Poincaré disk model:Consequently it is an isometry for these hyperbolic metrics, including their induced hyperbolic distances. For the same example, the corresponding hyperbolic geodesic segments have equal length:Thus the Cayley transform lets us choose the most convenient picture: a straight boundary for calculations, or a bounded unit disc for visualization. It also transports automorphisms of the unit disk into upper half-plane automorphisms by function composition $C^{-1}\circ g\circ C$.

For a nonempty finite collection of Euclidean vectors, its sample mean $\bar{x}=n^{-1}{\sum }_i{x}_i$ uniquely minimizes the sum of squared Euclidean distances to a proposed centroid $z$. Expand each squared Euclidean norm around $\bar{x}$ and use ${\sum }_i(x_i-\bar{x})=0$ to cancel the cross term. The displayed identity leaves a nonnegative term $n\Vert z-\bar{x}{\Vert }^2$, equal to zero exactly at $z=\bar{x}$.

This is the least number of colors needed to color all points of Euclidean space so that points at Euclidean distance one receive different colors. Any finite unit-distance graph embedded in the space gives a lower bound. If $p$ is prime, the characteristic vectors of all $(2p-1)$-subsets of $[4p-1]$, divided by $\sqrt{2p}$, give such a graph: its edges are exactly pairs intersecting in $p-1$ points. The prime-power modular intersection bound bounds an independent set by $\left(\genfrac{}{}{0ex}{}{4p-1}{p-1}\right)$, and hence gives $\chi ({\mathbb{R}}^{4p-1})\ge \left(\genfrac{}{}{0ex}{}{4p-1}{2p-1}\right)/\left(\genfrac{}{}{0ex}{}{4p-1}{p-1}\right)$.

For a symmetric zero-diagonal dissimilarity matrix $D$, square each entry to obtain $D^{(2)}$ and put $H=I-11^T/n$. Take the eigenvectors of $G=-H{D}^{(2)}H/2$ corresponding to its largest positive eigenvalues. Multiplying them by square roots of these eigenvalues gives coordinates. If $D$ contains Euclidean distances, $G$ is a centered Gram matrix, so retaining all positive eigenvalues reconstructs those distances exactly. Retaining fewer approximates the Gram matrix, not generally the sum of squared errors in raw distances. Negative eigenvalues signal failure of an exact Euclidean representation. Coordinates are unchanged in meaning by orthogonal transformations.

A closed walk is a walk with equal endpoint vertices, $v_m=v_0$. Under our convention this includes the zero-length walk $(v)$; returning after traversing at least one edge requires $m>0$. Closure imposes no other restriction on repeated vertices or edges. In a directed graph, a closed directed walk must also follow every directed edge in its permitted direction.^[ref]

In the shared simple graph, $A,F,A$ is a length-two closed walk that immediately backtracks along $AF$. It is not a trail, since $AF$ is used twice, and it is not a graph cycle. The length-six closed walk $A,B,C,A,D,E,A$ is a trail, since its six edges are distinct, but is not a graph cycle: it returns to $A$ midway through the journey. The length-three closed walk $A,B,C,A$ is a graph cycle, with all vertices distinct apart from the required endpoint repetition. In a simple graph that is an undirected graph, a graph cycle has length at least three; the two-step backtrack is excluded.^[ref]

A positive-length closed walk therefore need not reveal a graph cycle: even a tree permits an out-and-back journey on an edge. A positive-length closed trail in a simple graph does contain a graph cycle. For a proof outline, choose a shortest positive-length consecutive portion of the trail whose endpoint vertices coincide. It cannot repeat an internal vertex, since that would give a shorter such portion; it cannot have length one or two because self-loops and repeated edges are excluded. It is consequently a graph cycle. Cutting it out leaves another closed trail, possibly of length zero, so repetition partitions the original edges into graph cycles. In our six-step example these are the two triangles in a graph. A closed trail using every edge would be an Euler circuit; here $AF$ is omitted.

Counting return journeys makes closed walks useful even when they repeat edges. For a finite simple graph with adjacency matrix $M$, the walk count from powers of an adjacency matrix gives $(M^k{)}_{uv}$ length-$k$ walks from $u$ to $v$, for every nonnegative integer $k$. A proof outline is that matrix multiplication appends one allowed step, summing over the previous endpoint; $M^0$ is the identity matrix, recording the unique zero-length walk at each vertex. ConsequentlyThe trace counts closed walks with a specified starting vertex and traversal order, not distinct graph cycles. These formulas use adjacency entries, not arbitrary travel costs in a weighted graph.^[ref]

In our example, $(M^2{)}_{AA}=5$: the five length-two closed walks are $A,B,A$, $A,C,A$, $A,D,A$, $A,E,A$, and $A,F,A$. Also $(M^3{)}_{AA}=4$, going round either triangle in a graph in either direction, and $\mathrm{tr}(M^3)=12$: each of the two triangles in a graph supplies three choices of starting vertex and two directions. These exact counts for the constructed graph illustrate why return counts and graph cycle counts differ.

A closed walk naturally models a delivery or inspection journey that returns to its depot. Repeated vertices let it combine several excursions; repeated edges let it serve a dead end and return. For an Euclidean travelling salesman tour, one can first construct a closed walk visiting all locations and then use the triangle inequality to shortcut repeated visits without increasing total length. That argument assumes direct travel between the retained locations is permitted, as in a complete graph weighted by Euclidean distance; an arbitrary road network need not contain those shortcut edges.

For line segments $P+sd$ and $Q+te$, $0\le s,t\le 1$, the squared Euclidean distance is a convex quadratic function on a square. Its minimum is either an admissible stationary point or a minimum on one of the four edges. Each edge minimum is a point-to-segment orthogonal projection, restricted to the interval. Testing these five candidates gives a complete algorithm; when the directions are parallel, the edge candidates suffice. Independently restricting both coordinates of the unconstrained stationary point is generally incorrect because the variables are coupled by $d\cdot e$.

The complex plane identifies the complex number $x+iy$ with the point $(x,y)$ in Cartesian coordinates. The horizontal coordinate is its real part, the vertical coordinate its imaginary part. Arrows from zero identify the same points with vectors. Adding $1+i$ moves $3+4i$ to $4+5i$: every point undergoes the same translation.

Multiplication has a richer geometry. Multiplying by the imaginary unit sends $x+iy$ to $-y+ix$, a counterclockwise quarter-turn rotation. In particular $i(3+4i)=-4+3i$. Multiplying by $1+i$ rotates through $\pi /4$ and scales every Euclidean distance by $\sqrt{2}$. More generally, multiplication by $a+ib$ acts through the real matrixFor $a+ib\ne 0$, this preserves oriented angles between nonzero displacement vectors: every direction turns equally. Its determinant is $a^2+b^2>0$, while its common scale is $\sqrt{a^2+b^2}$. This is the elementary geometric reason complex numbers are so useful for conformal maps.

The name Argand plane recalls Jean-Robert Argand's geometric interpretation. In his 1813 article he explicitly reports publishing his Essai in 1806; the original article is available in Argand, Annales de mathématiques, volume 4, page 133. A ^[ref] preserves the essay and its geometric drawings. Reading these alongside a modern complex plane reveals how directions and lengths give arithmetic a visible meaning.

Figures are congruent when a rigid motion maps one onto the other, preserving all Euclidean distances.

A contracting Euclidean similarity multiplies every Euclidean distance by a constant $c<1$; equivalently it has the form $cRx+b$ for an orthogonal matrix $R$ and translation vector $b$. Finite families of such maps generate compact sets with self-similarity.

Convex optimization is a minimization problem with a convex function as its objective function and a convex set of feasible points. For a finite-valued $f:C\to \mathbb{R}$, the problem is to find $z_{\ast }\in C$ with $f(z_{\ast })\le f(z)$ for every $z\in C$. The displayed infimum describes its value even when no minimizing point exists. The two convexity requirements concern different objects: the allowed decisions and the scores assigned to them.

A convex set contains the whole line segment between any two of its points:A convex function lies below the interpolation of its endpoint values:Thus mixing two allowed decisions preserves feasibility, and the mixed score is no worse than the same mixture of endpoint scores. The objective function may have flat regions or corners. For a strictly convex function, the second inequality is strict when $u\ne v$ and $0<t<1$.

A useful constraint representation iswhere $f,g_i$ are convex functions on a common convex set $D$, and the equalities are affine functions. Each inequality defines a convex sublevel set; their intersection with $D$ and the equality set is a convex set. An equality involving a general convex function need not preserve this geometry: $x^2=1$ allows $-1$ and $1$ but excludes their midpoint $0$. See Boyd and Vandenberghe, Convex Optimization (2004), §4.2.1 for the standard problem form.

Why local information can certify a global answer. Every local minimum of a convex optimization problem is a global minimum, including minima on the boundary. If a feasible point $v$ had $f(v)<f(u)$, points $u+t(v-u)$ would remain feasible and have value strictly below $f(u)$ for every $0<t<1$. Taking $t$ arbitrarily small contradicts a local minimum at $u$. This argument explains the special power of convexity: a better distant decision would reveal an improving direction immediately nearby.

If a minimizer exists and the objective function is strictly convex on $C$, it is unique. Two distinct minimizers of value $p_{\ast }$ would have a feasible midpoint with value strictly below $p_{\ast }$. Existence is a separate question: the exponential function $e^x$ is strictly convex on $\mathbb{R}$, but its infimum $0$ is approached only as $x\to -\infty$. Even a bounded convex set need not suffice: $x^2$ on $0<x<1$ also has unattained infimum $0$. A continuous function on a nonempty compact set attains its minimum by the extreme value theorem.

Nor does strict convexity imply differentiability. For $f(x)=x^2+|x|$, the squared term gives the strict inequality while the triangle inequality gives the weak inequality for the absolute value. At zero the left and right derivatives are $-1$ and $1$, so no derivative exists there, although zero is the unique minimizer. Such objectives require subgradients or proximal operators rather than an ordinary gradient at every point.

For a differentiable convex function on an open convex set containing $C$, the constrained first-order condition isIndeed, the subgradient inequality $f(z)\ge f(z_{\ast })+\nabla f(z_{\ast }{)}^T(z-z_{\ast })$ makes this sufficient; taking the one-sided derivative along feasible line segments makes it necessary. At an interior minimizer, both directions are feasible and the gradient must vanish. At a boundary minimizer it can be nonzero: it only needs to make every feasible direction nondecreasing. See Boyd and Vandenberghe, §§3.1.3 and 4.2.3.

A fully computed nearest-point problem. Project $a=(2,1)$ onto the half-space $C=\{(x,y):x+y\le 1\}$ by minimizing half the squared Euclidean distance:The Hessian matrix is the identity matrix, so the objective function is strictly convex. The unconstrained minimizer $(2,1)$ violates the inequality. With the convention $g\le 0$, the optimization Lagrangian is $L=f+\lambda g$, where the Lagrange multiplier satisfies $\lambda \ge 0$. Its Karush-Kuhn-Tucker conditions areThe last two equations give $x=2-\lambda$, $y=1-\lambda$. The choice $\lambda =0$ is infeasible, so complementary slackness forces $x+y=1$. Consequently $3-2\lambda =1$, giving $\lambda =1$, $(x_{\ast },y_{\ast })=(1,0)$ and $f(x_{\ast },y_{\ast })=1$. The Euclidean distance is $\sqrt{2}$, rather than the objective function value $1$. The gradient $(-1,-1)$ at the answer balances $\lambda \nabla g=(1,1)$; the displacement from $(1,0)$ to $(2,1)$ is a normal vector to the boundary.

There is an exact certificate independent of numerical search. Completing squares givesFor every feasible point, $g\le 0$ implies $L(x,y,1)\le f(x,y)$. Thus every feasible objective is at least $1$, and $(1,0)$ attains this bound. More generally the Lagrangian dual problem has objective $q(\lambda )={\inf }_{x,y}L(x,y,\lambda )=2\lambda -{\lambda }^2=1-(\lambda -1{)}^2$ for $\lambda \ge 0$. Its maximum is also $1$, illustrating strong duality through matching computed bounds. This makes the example a model for Euclidean projection onto a convex set and the projection step in projected gradient descent.

What the multiplier conditions require. For differentiable convex functions $f,g_i$ on an open convex set $D$ and equalities $Az=b$ defined by affine functions, the KKT conditions combine feasibility, ${\lambda }_i\ge 0$, complementary slackness ${\lambda }_i{g}_i(z_{\ast })=0$, and stationaritywith unrestricted equality Lagrange multipliers $\nu$. They suffice to certify a global minimum without an additional regularity assumption: the optimization Lagrangian is convex, stationarity minimizes it, and feasibility with complementary slackness gives the same certificate as above. To guarantee their necessity at an attained finite optimum, a regularity hypothesis suffices: Slater's condition requires some $\bar{z}\in D$ with $g_i(\bar{z})<0$ and $A\bar{z}=b$. The projection example has the strictly feasible point $(0,0)$. See Boyd and Vandenberghe, §§5.2.3 and 5.5.3. This hypothesis guarantees suitable multipliers, not existence of a primal minimizer.

Without regularity, necessity can fail even for convex functions: minimize $f(x)=x$ subject to $g(x)=x^2\le 0$. The sole feasible point $x=0$ is optimal, but stationarity would require $1+\lambda \cdot 0=0$. No Lagrange multiplier works. There is no strictly feasible point, and the gradient of the constraint vanishes at the answer.

The nonconvex contrast. The polynomial $h(x)=(x^2-1{)}^2+0.2x$ has derivative $h^{\prime }(x)=4x^3-4x+0.2$ and second derivative $h^{\prime \prime }(x)=12x^2-4$. Numerically solving the cubic gives stationary points $-1.024120300$, $0.050125947$, and $0.973994353$. Their objective values are respectively $-0.202440434$, $1.005006281$, and $0.197434153$, with second derivatives $8.585869$, $-3.969849$, and $7.383980$. Hence both outer points are local minima, and the middle point is a local maximum. Since $h(x)\to +\infty$ at both ends, its global minimum exists and must be one of the stationary minima: it is the left one. A method stopping at the right local minimum misses a better value by approximately $0.399874587$.

The practical appeal of convex optimization is the ability to check an answer globally using geometry and matching Lagrangian duality bounds. The projection certificate certifies every feasible alternative at once; the tilted quartic shows why a zero gradient alone cannot do that for general nonlinear optimization.

Historically, an early landmark is Kuhn and Tucker's ^[ref]. Its §3 explicitly states a regularity hypothesis for inequality-constrained Lagrange multipliers; its discussion of saddle points explains how concave functions support global conclusions for maximization. This documents an early formulation of the multiplier approach; it does not establish sole discovery of today's KKT conditions or of convex optimization as a whole.

Declination $\delta$ is the signed angle from the reference celestial equator to a direction, measured along its hour circle: $-90^{\circ }\le \delta \le +90^{\circ }$. Positive declination means celestial north, rather than necessarily north of the observer's zenith. A direction with $\delta =0$ lies on the celestial equator; $\delta =+90^{\circ }$ 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 $\varphi$ has zenith direction $\mathbf{z}=(\cos \varphi \cos \Theta ,\cos \varphi \sin \Theta ,\sin \varphi )$ in the same reference axes. Since $\mathbf{n}\cdot \mathbf{z}=\sin a$ for altitude $a$, the cosine addition formula givesAt upper meridian transit, $H=0$, so $a_{\mathrm{upper}}=90^{\circ }-|\varphi -\delta |$. For the synthetic site $\varphi =52^{\circ }$ and synthetic direction $\delta =20^{\circ }$, this yields $a_{\mathrm{upper}}=58^{\circ }$. A direction with $\delta =70^{\circ }$ instead reaches $72^{\circ }$, 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 $z_s$ on the upper celestial meridian, positive toward the south and negative toward the north. Then $\delta =\varphi -z_s$. A synthetic southward readout $z_s=32^{\circ }$ at $\varphi =52^{\circ }$ recovers $\delta =20^{\circ }$. An unsigned distance $|z_s|$ alone would leave two possibilities, $\varphi \pm |z_s|$, 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 $1^{\prime }$ error in the assumed geographical latitude produces a $1^{\prime }$ 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 $\cos \delta$. Its arc length is $\cos \delta |d\alpha |$, with angles in radians; at $\delta =60^{\circ }$, a $15^{\circ }$ right ascension increment spans a $7.5^{\circ }$ 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.

A measure of separation between locations or objects. In a metric space, distance is specified by a metric satisfying positivity, symmetry and the triangle inequality. The familiar straight-line separation in Euclidean space is Euclidean distance; other metrics can assign different distances to the same pair of points.

For a line $Ax+By+C=0$ with $A^2+B^2>0$, its unit normal is $(A,B)/\sqrt{A^2+B^2}$. Choose any point on the line and project the displacement to $(x_0,y_0)$ onto this normal. The absolute value of that projection gives the title formula. This is the shortest Euclidean distance, because any displacement to a different point on the line has the same normal component and an additional orthogonal tangential component.

For distinct points ${\mathbf{r}}_1,{\mathbf{r}}_2$, the cross product in the numerator has magnitude twice the area of the triangle with third vertex ${\mathbf{r}}_0$. The same double area is the base length $|{\mathbf{r}}_2-{\mathbf{r}}_1|$ times the perpendicular height from ${\mathbf{r}}_0$, proving the displayed Euclidean distance. Equivalently, let $\mathbf{u}={\mathbf{r}}_2-{\mathbf{r}}_1$ and project ${\mathbf{r}}_0-{\mathbf{r}}_1$ onto the line direction. The squared distance is $|{\mathbf{r}}_0-{\mathbf{r}}_1{|}^2-[\mathbf{u}\cdot ({\mathbf{r}}_0-{\mathbf{r}}_1){]}^2/|\mathbf{u}{|}^2$; Lagrange's identity gives the same cross-product formula.