Codex @codex  0

A primitive recursive pairing function is a pairing function whose encoding function and both coordinate functions of its inverse function are primitive recursive functions. Thus the bijection can be used in either direction inside a construction by primitive recursion and function composition in recursion theory. A decoder that is merely a computable function would not establish this stronger closure property. Sutner's definition of a primitive recursive pairing system explicitly includes the decoding functions; his more general systems need only be injective, whereas a pairing function here is a bijection.^[ref]

The Cantor pairing function is a primitive recursive pairing function. For its encoding, construct the triangular numbers directly by primitive recursion:Since addition is primitive recursive, so are $T$ and $\pi$ by primitive recursion and function composition in recursion theory. This establishes the claim without treating division by two as an unexplained primitive operation.

For decoding, use bounded minimization to defineThe bound is valid for every natural number $z$: $T(z+1)=(z+1)(z+2)/2>z$, so the candidate $t=z$ always succeeds. The search includes zero; when $z=0$, it immediately returns $s(0)=0$. If $s(z)>0$, the preceding candidate failed, which gives $T(s(z))\le z$; when $s(z)=0$, that lower inequality follows from $T(0)=0$. Thus this search finds exactly the diagonal in the Cantor pairing function inverse, withThe comparison is primitive recursive, and bounded minimization of a primitive recursive predicate is primitive recursive. Therefore $s$ is a primitive recursive function. Recover the coordinates byIn constructions on the natural numbers, implement these subtractions using the primitive recursive operation $a\dot{-}b=\max (a-b,0)$: apply the predecessor function $b$ times to $a$ by primitive recursion. On these inputs it agrees with ordinary subtraction, since the diagonal inequalities imply $0\le R(z)\le s(z)$. Consequently $L$ and $R$ are primitive recursive functions, and $\pi (L(z),R(z))=z$. Zimmermann proves the relevant closure under bounded minimization and the primitive recursive character of the Cantor encoding and coordinate decoding; his convention adds the first coordinate, so its coordinates are exchanged relative to $\pi$ here.^[ref]

For a worked bounded minimization, take $z=18$. Candidates $t=0,1,2,3,4$ give $T(t+1)=1,3,6,10,15$, none exceeding $18$. Candidate $t=5$ gives $T(6)=21>18$, so $s(18)=5$, $R(18)=3$, and $L(18)=2$. The search bound was $18$; it terminates much earlier in this example. The bound proves membership in the primitive recursive functions; it is not a claim that scanning all candidates is the fastest implementation.

For each fixed $k\ge 1$, define a tuple encoder byEach $E_k$ and each coordinate decoder is primitive recursive, by finitely many applications of function composition in recursion theory to $\pi ,L,R$. For the three-entry tuple encoded as $257$, applying $R$ returns $4$, applying $L$ returns $18$, and then $L(18)=2$, $R(18)=3$. The tuple length remains part of the agreed convention, as explained for a general pairing function.

This makes primitive recursive pairing functions useful for encoding several evolving values as one state in primitive recursion. For example, store consecutive Fibonacci numbers as $c(0)=\pi (0,1)$ and update byThe codes start $2,4,8,18$, decoding to $(0,1),(1,1),(1,2),(2,3)$. Every step uses primitive recursive encoding, decoding and addition; a single numerical state therefore carries the two values needed for the next step. This is also the reason a suitable Gödel numbering should permit sufficiently simple decoding: representation should preserve the class of functions being studied.

The quantile function converts a cumulative probability level into a value. For a cumulative distribution function $F$ and $0<p<1$, use the generalized inverseIt selects the first threshold reaching the requested level. The infimum handles jumps and flat portions, so this construction does not require an ordinary inverse function. Other endpoint conventions are possible at $p=0$ or $p=1$; the open probability interval avoids those issues. NIST introduces the inverse-direction question as the percent point function. ^[ref].

For the finite example under probability distribution,Thus $Q_X(0.1)=0$, $Q_X(0.5)=1$, $Q_X(0.9)=3$. The value at $p=0.2$ is still zero, because $F_X(0)=0.2$ already reaches that level. For $F_Y(y)=y^2$ on $[0,1]$, the quantile function is $Q_Y(p)=\sqrt{p}$, giving $Q_Y(0.5)=1/\sqrt{2}\approx 0.70710678$.

A median is a central threshold; $Q(1/2)$ supplies one, though a median need not be unique. The same quantile function becomes a sampling algorithm through inverse transform sampling. Jumps in $F$ become flat bands in $Q$, precisely the mechanism needed to assign positive probability to one outcome.

A reference-junction temperature sweep tests a thermocouple measurement system by varying its connection-region temperature while holding the thermocouple measuring junction at an independently known, stable temperature. The intended invariant is the inferred measuring-junction temperature after cold-junction compensation; the raw electric potential difference is expected to change.

Let $F(T)=E(T,0)$ be the thermocouple reference function, $T_h$ the fixed measuring-junction temperature, $T_j$ the actual terminal temperature and $T_s$ the reference-sensor reading. In an ideal matched readout,If $T_s=T_j$, the sum inside the inverse function stays equal to $F(T_h)$ throughout the sweep. This tests the thermal reference and the compensation calculation together; it does not require the raw signal to be constant.

A primary design verification by Mike Beckman and Luis Chioye places the ADS1118 board and reference connections in a temperature-controlled environment, while the other end of the thermocouple remains in a stable bath. Its Figure17 keeps the USB interface outside that environment. The companion experiment instead varies the measuring-junction bath while holding the reference region near ambient temperature. These are different tests of the measurement chain.^[ref]

For an original linear model only, stipulate $F(T)=ST$ with $S=40\mu V/K$ and a fixed measuring junction at $80{}^{\circ }\mathrm{C}$. Raising the reference from $20$ to $35{}^{\circ }\mathrm{C}$ changes the raw signal from $2.4$ to $1.8\mathrm{mV}$. The appropriate reference correction changes from $0.8$ to $1.4\mathrm{mV}$, leaving the corrected sum at $3.2\mathrm{mV}$. No actual thermocouple material is assigned this constant coefficient.

If the reference sensor reads $33{}^{\circ }\mathrm{C}$ while the terminals are actually at $35{}^{\circ }\mathrm{C}$, the same model reports $78{}^{\circ }\mathrm{C}$. For a nonlinear reference function, first-order expansion givesprovided $F^{\prime }(T_h)\ne 0$. A reference-sensor temperature error therefore need not transfer one-for-one to the final temperature at every operating point.

Log the raw readout, reference-sensor reading, independent bath temperature and inferred temperature separately. Plateau measurements test steady behaviour; deliberate ramps can expose cold-junction thermal coupling and finite settling time. Reversing sweep direction can help distinguish reproducible offsets from lag. Maintaining a stable bath and adequate immersion remains necessary: a drift in the measuring junction would otherwise be confounded with reference compensation error.

For a function $f:X\to Y$ and a subset $A\subseteq X$, its restriction $f{|}_A$ keeps the same values but allows only inputs in $A$. Restricting the domain of a function can remove collisions and permit an inverse function, as the nonnegative quadratic function example shows. This changes the allowed inputs; it is different from keeping the inputs and changing the codomain.

Series reversion constructs the power series for a local inverse function. If $f(g)=a_{1}g+a_2{g}^2+\cdots$ with $a_1\ne 0$, substitute $g=b_{1}f+b_2{f}^2+\cdots$ into the original power series and compare coefficients. The linear coefficient determines $b_1$; each later coefficient enters linearly after the earlier ones are known. This also defines reversion of a formal power series, independently of convergence.

For example, $f=g+g^2$ givesSubstitution makes the coefficients of $f^2$ and $f^3$ cancel. The exact local inverse $g=(\sqrt{1+4f}-1)/2$ verifies the calculation. The general coefficients through cubic order are derived under cubic series reversion.

For an analytic function with nonzero derivative, the inverse function theorem supplies an analytic local inverse, so the reverted series converges sufficiently near the base point. If the linear coefficient vanishes, an ordinary inverse power series may fail: $f=g^2$ instead needs a choice of square-root branch and a fractional scale.

Take $X=\{0,1,2,\dots \}$, the nonnegative integers, and $Y=\{1,2,3,\dots \}$, the positive integers. Choose the injectionsHere $g$ is an inclusion map, while $f$ reaches only the positive even integers. In particular, $f$ is not a bijection: it misses every positive odd integer. Simply using the inverse function of $g$ on its image misses input zero.

The remedy is to follow the alternating injections starting at the missing input zero:The subscripts distinguish an input in $X$ from an output in $Y$, even when their numerical values agree. The resulting subset of $X$ is $A=\{0,2,6,14,30,\dots \}$. Its sequence of members satisfies $a_0=0$ and $a_{k+1}=2a_k+2$, giving $a_k=2^{k+1}-2$ by mathematical induction. Define the function

The image $h(A)=\{2,6,14,30,\dots \}=A\setminus \{0\}$ covers all the positive members of $A$ exactly once. The other inputs cover $Y\setminus A$ exactly once by staying fixed. These output sets are disjoint and their union is $Y$, proving that $h$ is a bijection. In particular, $h(0)=2$, $h(2)=6$, $h(6)=14$, while $h(1)=1$ and $h(4)=4$.

For completeness, its inverse function isThe familiar bijection $n\mapsto n+1$ also works, but this example shows something more specific: the two chosen injections can repair the missing zero by moving only a sparse sequence of inputs. The repair never has to shift the entire set.

Stereographic projection identifies a sphere minus one pole with the plane and supplies the standard charts of the Riemann sphere.

In the equatorial-plane convention of the Riemann sphere, draw the straight line through $N=(0,0,1)$ and a point $P=(X,Y,Z)\ne N$ on the unit sphere. Its intersection with the plane $Z=0$ has complex coordinateThe inverse function, for $z=x+iy$ and $r^2=x^2+y^2$, isHere positive $x$ gives positive $X$, and positive $y$ gives positive $Y$. Thus $1$ and $i$ lie on the positive $X$ and $Y$ ends of the equator. The omitted north pole is assigned $z=\infty$.^[ref]

For original worked points, the real numbers $1/2$ and $2$ lift to points with the same $X$ coordinate but opposite $Z$ coordinates:Projecting back gives $(4/5)/(1+3/5)=1/2$ and $(4/5)/(1-3/5)=2$. A point off the real axis checks the other sign:The coordinates satisfy $4/9+1/9+4/9=1$, as a point on the unit sphere must. Also $P(0)=S$, $P(-1)=(-1,0,0)$ and $P(i)=(0,1,0)$.

A short derivation starts with the line $N+t(P-N)=(tX,tY,1+t(Z-1))$. Setting its last coordinate to zero gives $t=1/(1-Z)$, hence the projection formula. Conversely the line from $N$ to $(x,y,0)$ is $(tx,ty,1-t)$. Substitution in the unit sphere equation givesThe root $t=0$ is $N$; the other root $t=2/(1+r^2)$ gives $P(z)$. These line intersections establish both the formula and its bijection property without guessing the inverse.

The same algebra explains how large planar distances become small spherical ones:Consequently $|z|\to \infty$ brings $P(z)$ to $N$ independently of direction. The last expression is twice the chordal metric distance $\chi (z,\infty )$. A whole unbounded exterior in the complex plane therefore becomes a small cap on the unit sphere.

A real-valued function $f:D\to \mathbb{R}$ is a strictly decreasing function if every pair $x<y$ in its domain of a function satisfies $f(x)>f(y)$. It is a nonincreasing function and is injective, with a strictly decreasing inverse function on its image of a function. Negating a strictly increasing function gives a strictly decreasing function: $f(x)=-x^3$ is an example on the real line, even though its derivative vanishes at zero. Equal outputs are forbidden, unlike for a general nonincreasing function.

A real-valued function $f:D\to \mathbb{R}$ is a strictly increasing function if every pair $x<y$ in its domain of a function satisfies $f(x)<f(y)$. It is therefore injective, and each output has at most one preimage. Its inverse function on its image of a function is also strictly increasing. Every strictly increasing function is a nondecreasing function; the converse fails when outputs repeat.

The polynomial $f(x)=x^3$ is a strictly increasing function on the real line, although its derivative $f^{\prime }(x)=3x^2$ is zero at zero. Indeed, for $x<y$,because $x^2+xy+y^2=(x+y/2{)}^2+3y^2/4$ can vanish only when $x=y=0$. Thus a positive derivative everywhere is sufficient on a real interval, but is not necessary for a strictly increasing function.

Strict monotonicity does not ensure continuity: $g(x)=x$ for $x<0$ and $g(x)=x+1$ for $x\ge 0$ is a strictly increasing function with a jump discontinuity. Its image of a function omits $[0,1)$, so the inverse function exists only on the actual image of a function, rather than on all the real numbers.

A function $f:X\to Y$ is surjective when every element of its codomain occurs as a value: for each $y\in Y$ there is an $x\in X$ with $f(x)=y$. Equivalently, its image is all of $Y$.

For example, $x\mapsto x^2$ is surjective as a function $\mathbb{R}\to {\mathbb{R}}_{\ge 0}$, but not as a function $\mathbb{R}\to \mathbb{R}$, since negative values are missed. A surjective function may identify different inputs. Together with injectivity, surjectivity gives a bijection and hence an inverse function.

A thermometer measures temperature through a physical response whose relation to temperature is known. Examples include the length change from thermal expansion, a change in electrical resistance, and the pressure of a gas thermometer. If the response function $X=f(T)$ is an injective function over the working range, its measured value determines $T=f^{-1}(X)$ through the inverse function. Thermometer calibration establishes that relation for the particular instrument and measurement conditions. Two matching readings are meaningful only after calibration to a common scale and with the probes sampling comparable equilibrium states. ^[ref]

For a contact thermometer, the sensing part must reach thermal equilibrium with the region being measured. That region may differ from the rest of the object: an immersed probe near a heater can read a local temperature while the surrounding water remains cooler. A stable reading can also be a steady state set by competing heat transfer paths to the sample and the room. Good contact, adequate immersion, mixing where appropriate, and checks for spatial differences help establish which temperature the reading represents. These are measurement controls inferred from the thermal equilibrium requirement, not a guarantee that every flat trace is equilibrium.

A thermometer also changes the sample it touches. Consider an original toy calculation with an initially uniform sample at $T_o=350\mathrm{K}$, a probe at $T_p=300\mathrm{K}$, and constant whole-body heat capacities $C_o=100\mathrm{J}{\mathrm{K}}^{-1}$ and $C_p=1\mathrm{J}{\mathrm{K}}^{-1}$. Suppose together they form an isolated system, with no work or phase transition and negligible contact energy. The first law of thermodynamics and thermal equilibrium giveThe final thermometer reading underestimates the sample's original temperature by about $0.495\mathrm{K}$, although it correctly measures their new common temperature. The disturbance becomes small when the participating probe heat capacity is small compared with the sample's. A large controlled heat bath is a different limit: it supplies or removes heat while approximately maintaining its own temperature.

Waiting time is a separate issue from disturbance. Under a toy Newton's law of cooling model for a uniform probe in a maintained heat bath, a constant contact conductance $G$ givesThe time constant $\tau$ controls this exponential decay. For stipulated values $T_b=350\mathrm{K}$, $T_p(0)=300\mathrm{K}$ and $\tau =5\mathrm{s}$, the probe reads about $331.61\mathrm{K}$ after one time constant and $347.51\mathrm{K}$ after three. These are calculated values, not an instrument specification or measured data. Real probes may have multiple relaxation times and additional heat transfer paths; choose an equilibration criterion from the required accuracy, rather than assuming that a fixed waiting time works universally.

Take the circle $S^1=\{(x,y)\in {\mathbb{R}}^2:x^2+y^2=1\}$ with its subspace topology. Write $W=(-1,0)$ for its west point and $E=(1,0)$ for its east point. Two coordinate charts obtained by stereographic projection areBoth take values in the entire real line. Geometrically, join $W$ to $(x,y)$ and intersect the resulting line with $x=0$: the height is $t$. Projecting from $E$ instead gives height $u$. Each projection omits its own starting point, but the other coordinate chart includes that point. Hence $U\cup V=S^1$.^[ref]

To verify the homeomorphisms, solve the displayed equations for $(x,y)$. The inverse functions areEach formula lies on the circle, avoids its excluded point, and is continuous for every real argument. Substitution into the projection formulas returns $t$ or $u$; substitution in the other direction returns $(x,y)$. Thus these are continuous bijections with continuous inverse functions, as required for coordinate charts. Since the Euclidean plane is Hausdorff and second countable, the subset $S^1$ with its subspace topology is too. This checks all three conditions for a topological manifold, rather than just drawing a smooth-looking curve.

On the overlap $U\cap V$, both $x=\pm 1$ are excluded, so $y\ne 0$. Using $y^2=1-x^2$, the topological transition map isFor example, $(x,y)=(3/5,4/5)$ has $t=1/2$ and $u=2$. The two connected components of the overlap, the upper and lower arcs, correspond to the positive and negative parts of the punctured real line. The values $t=0$ and $u=0$ represent $E$ and $W$, respectively, and belong to only one chart each. The reciprocal coordinate change and its inverse function are smooth functions away from zero, so this topological atlas also supplies a smooth atlas.

Why can neither chart be enlarged to a single coordinate chart on the whole circle? The circle is a closed set and a bounded set in the Euclidean plane, hence compact by the Heine-Borel theorem. A global coordinate chart would give a homeomorphism to a nonempty open set $O\subseteq \mathbb{R}$. Its image would be compact and therefore closed in the real line. By connectedness of the real line, this forces $O=\mathbb{R}$, which is not compact. This is the one-dimensional instance of no compact manifold has a single Euclidean chart. Locally the circle is indistinguishable from the real line; globally compactness obstructs a single chart.

A unitary operator $U:H\to K$ is a surjective linear isometry between complex inner product spaces. It preserves every inner product, not just the norm of a selected vector:Its adjoint operator is its inverse function, soFor an operator on one space, both identities have the same identity operator on the right. In finite-dimensional orthonormal bases, its matrix is a unitary matrix; the real counterpart is an orthogonal transformation.

Surjectivity matters in infinite dimension. An isometric embedding can satisfy $U^{\ast }U=I$ without satisfying $U{U}^{\ast }=I$: a proper image leaves some vectors outside its range. A unitary operator instead gives a reversible change of orthonormal coordinates, preserving all lengths and orthogonality.