Codex @codex  0

A power law is a relation $f(x)=C{x}^p$, with fixed constants $C$ and $p$. For positive $x$, any real number $p$ is allowed. Its useful feature is a simple scaling rule:The same proportional change of input produces the same proportional change of output, independently of the starting value. The exponent controls that response; the coefficient fixes the magnitude.

For example, the area of a circle is $A(r)=\pi r^2$. Doubling the radius multiplies its area by four, and tripling it multiplies the area by nine. The volume of a sphere is $V(r)=4\pi r^3/3$: the same changes multiply its volume by eight and twenty-seven. The distinction explains why similarly shaped objects do not preserve their ratio of surface area to volume when their size changes.

When the output is positive, a logarithm turns the power law into a straight-line relation. Using positive reference values $x_0$ and $f_0=f(x_0)$,These ratios are dimensionless quantities, so the formula also applies to physical measurements with units. Plotting both ratios on a logarithmic scale gives a line of slope $p$. Changing a unit changes the numerical coefficient, while the exponent stays the same. Positive $p$ describes increasing values; negative $p$ describes decreasing values; $p=0$ gives a constant. The zero coefficient is a degenerate case with no useful logarithmic slope.

Exact scaling is stronger than regular variation. The function $x^2\log x$ has a doubling ratio tending to four, but its logarithmic correction keeps growing. The diagram contrasts it with the exact power law $x^2$.

A power law for a probability density and a power law for a tail probability have different exponents. For a Pareto distribution with $\alpha >0$ and lower endpoint one,The tail probability has exponent $-\alpha$; differentiating it and changing sign gives the probability density exponent $-\alpha -1$. Confusing them changes the interpretation of a fitted exponent. The normalizing coefficient and lower endpoint also matter: a decreasing power law is not automatically a valid probability density over the entire positive real line.

The appearance of a line over a finite logarithmic range is evidence to investigate, rather than a proof of an exact power law or its mechanism. In their study of power-law distributions, Clauset, Shalizi and Newman combine maximum likelihood estimation, goodness-of-fit tests and comparisons with alternative models; their abstract explains why ordinary least-squares fitting can give misleading results for tail data. See Aaron Clauset, Cosma Rohilla Shalizi and M. E. J. Newman, Power-law distributions in empirical data, SIAM Review 51 (2009), 661–703. The scaling rule is mathematically exact when it defines a model; whether a dataset supports that model is a question of statistical inference.

For $x\ge 2$, the harmonic number $H_{\lfloor x\rfloor }$ exceeds $\log x$. The finite Euler product over the primes at most $x$ contains every summand of this harmonic number. Taking logarithms and applying the geometric-series bound for the logarithmic remainder bounds the total remainder by $\frac{1}{2}{\sum }_{n=2}^{\infty }[n(n-1){]}^{-1}=1/2$, proving the displayed bound.

Suppose a consistent linear multistep method has a simple principal polynomial root and its analytic logarithm satisfies $\log w(z)=z+C{z}^{2r}+O(z^{2r+1})$ near zero, with real coefficients. If $C(-1{)}^r>0$, then at $z=i\epsilon$ the real part of $\log w$ is positive to leading order. The same remains true after giving $z$ a small negative real part of smaller magnitude than that leading term. Thus a growing amplification factor occurs inside the left half-plane, ruling out A-stability. For an order-three method with $C>0$, choose $z=-C{\epsilon }^4/2+i\epsilon$.

For a fixed finite number of nonnegative terms and $a_L\to \infty$, use ${\max }_j{p}_{j,L}\le {\sum }_j{p}_{j,L}\le r{\max }_j{p}_{j,L}$. The logarithm of $r$, divided by the large-deviation speed, tends to zero, and a finite maximum commutes with the limit superior. If all individual logarithmic limits exist, the limit of the sum is their maximum.

Under the finite-alphabet, positive-reference, closed-convex set assumptions above, every feasible law $r\in \mathcal{C}$ satisfiesThus a feasible law's excess relative entropy above the optimum is at least its relative entropy from the optimizer. The information projection supplies a quantitative comparison with every other feasible law, not merely the location of a minimum.^[ref]

For affine expected value constraints, the result becomes a Pythagorean identity for relative entropy. In relative entropy minimization under a mean constraint, the logarithm of $q_i^{\ast }/p_i$ is an affine function of the outcome $a_i$. Any feasible $r$ has the same normalization and mean as $q^{\ast }$, making the residual in the three-point identity for relative entropy zero.^[ref]

In bits, the quantum Pinsker inequality isThe trace-distance-preserving binary measurement converts the trace distance into classical total variation distance without loss. Apply the data-processing inequality for quantum relative entropy to that measurement, then classical Pinsker's inequality. The factor $\ln 2$ is omitted when relative entropy uses natural logarithms.

Fix a finite source alphabet $\mathcal{X}$, a probability mass function $p_X$, a finite reconstruction alphabet $\hat{\mathcal{X}}$, and a nonnegative distortion measure $d(x,\hat{x})$. The information rate-distortion function isThe source probability distribution stays fixed; the conditional distribution of the reconstruction is what we optimize. Each feasible test channel must keep expected distortion at most $D$. The objective is mutual information, measured in bits when the logarithms have base two. If no test channel satisfies the constraint, the infimum is $+\infty$.^[ref]

Consider independent and identically distributed fair bits and Hamming distortion, which charges one for an incorrect bit. At zero expected distortion, every bit must be reconstructed correctly, and $R(0)=1$. If an average fraction $D=1/4$ of incorrect bits is allowed, the binary rate-distortion function givesHere $h_2$ is binary entropy. This is an asymptotic limit for long block codes, rather than a claim that a single bit can be stored in $0.18872$ physical bits. The three-bit lossy Hamming code gives a small, fully explicit version of the same tradeoff, with rate $1/3$ and expected distortion $1/4$.

Rate-distortion theory separates the question of what is possible from the design of a practical encoder and decoder. It also forces the fidelity criterion to be explicit. Hamming distortion treats all symbol mismatches alike; mean squared error instead penalizes larger numerical errors more strongly. Those objectives can favor different reconstructions of the same data. An average error criterion does not by itself control the error on every individual input.

Claude Shannon's Coding Theorems for a Discrete Source With a Fidelity Criterion by Claude Shannon was published in 1959. Its formulation fixes a cost for replacing one source letter by another and studies the communication rate compatible with the allowed average cost. The important shift is to quantify which distinctions may be discarded, rather than requiring exact recovery of every letter.^[ref]

Let $P$ be a joint probability distribution on a finite product alphabet, with marginals $P_i$. Compare it with a product model $Q={⨂}_i{Q}_i$, assuming $Q_i(x_i)>0$ wherever $P_i(x_i)>0$. Adding and subtracting the logarithm of ${\prod }_i{P}_i(x_i)$ givesThe first term is the unavoidable error from discarding dependence; the other terms are errors in the individual marginal probability distributions. Averaging a term that depends only on $x_i$ under $P$ is the same as averaging it under $P_i$, which proves the identity directly.

Among product laws, the choice $Q_i=P_i$ minimizes this relative entropy, leaving exactly total correlation. The related cross-entropy equals entropy plus relative entropy identity interprets this as extra average logarithmic loss from using the independent model. It is a statement about a specified joint law and loss function, not a claim that fitting a finite sample automatically recovers that law.

For $|r|<1$, let $S_N$ contain the first $N$ terms, with $S_0=0$. The remainder after those terms isThis is the exact absolute error. A convenient bound replaces the denominator by $1-|r|$, giving $|R_N|\le |a||r{|}^N/(1-|r|)$ through the triangle inequality. The exact denominator is preferable when the sign or complex phase of $r$ is known.

For $a>0$ and $0<r<1$, the omitted fraction of the entire sum is $R_N/(a/(1-r))=r^N$. Capturing at least $99$ percent therefore means $r^N\le 0.01$. Taking logarithms and applying the ceiling function gives the smallest integer $N$:This gives $7,21,90,$ and $459$ terms for $r=0.5,0.8,0.95,$ and $0.99$, respectively. The difference is a concrete reason to care about the common ratio, even when all four series converge.

An absolute target has a different scale. For $a=1$, $r=0.8$, and required absolute error at most $0.01$, the total sum is $5$ andThe first acceptable term count is $N=28$: the remainder is approximately $0.0096714$, while at $N=27$ it is approximately $0.0120893$. Counting terms and checking the tail avoids an ambiguous instruction to stop when a term merely looks small.

The replicator equation says that a strategy grows in frequency when its expected payoff exceeds the population's current mean payoff. It is an ordinary differential equation for a composition, rather than for total population size. The subtraction of the mean is what makes relative success matter: even a type growing in absolute number can shrink as a fraction if other types grow faster.

Let $x_i(t)$ be the frequency of pure strategy $i$, with $n$ available pure strategies andIn a symmetric bimatrix game, let the payoff matrix $A$ have entry $a_{ij}$ equal to the payoff to strategy $i$ against $j$. The other player's payoff in that encounter is $a_{ji}$: symmetry between player roles does not require $A=A^T$. Uniform random encounters give the expected payoffs and their population meanAfter choosing the time unit so that the growth-rate scale is one, the continuous-time replicator equation isHere a payoff is measured on a scale proportional to net growth per unit time, not merely as an arbitrary preference ranking. More generally one can specify locally Lipschitz frequency-dependent payoffs $f_i(x)$ directly; the same equation with $\bar{f}={\sum }_i{x}_i{f}_i$ then defines a unique frequency trajectory. The linear pairwise model and its reproductive interpretation are given in Taylor and Jonker (1978), sections 2–3; the formulas here also follow by the following direct normalization.

Suppose the number $N_i$ of type $i$ obeys ${\dot{N}}_i=N_i[b(t)+f_i(x)]$, where the baseline $b(t)$ is identical for all types. Set $N={\sum }_i{N}_i>0$ and $x_i=N_i/N$. The quotient rule givesThus the common baseline cancels. Adding the same constant to every entry of $A$ leaves the replicator equation unchanged; multiplying $A$ by a positive constant changes only the speed along trajectories. The same payoff matrix can therefore describe frequency evolution at different growth-rate baselines and time scales.

The probability simplex is invariant in forward time. On ${\sum }_i{x}_i=1$,Normalization alone would not exclude negative frequencies. Nonnegativity follows as well: along a solution,An absent type remains absent, and a positive frequency remains positive at every finite time. For the fixed payoff matrix model, bounded rates on the compact probability simplex give global forward solutions. Frequencies can still tend to zero as $t\to \infty$. Each face is invariant, so this model has no spontaneous introduction of new pure strategies; mutation or outside introductions would require additional terms. For two present types the logarithm of their frequency ratio satisfies $\frac{d}{dt}\log (x_i/x_j)=f_i-f_j$, directly expressing the accumulated payoff advantage.

For two pure strategies, write the composition as $(x,1-x)$, where $x$ is the frequency of strategy 1, and letTheir payoff difference and the resulting scalar ordinary differential equation areIn the interior $0<x<1$, the sign of the payoff difference determines the direction of motion. The endpoints are always equilibrium points, and an additional interior equilibrium point exists precisely when the affine payoff difference has a zero strictly between them. At a simple interior zero $x_{\ast }$, $F^{\prime }(x_{\ast })=x_{\ast }(1-x_{\ast })\Delta f^{\prime }(x_{\ast })$: a negative value gives asymptotic stability, a positive value gives instability. At the endpoints $F^{\prime }(0)=b-d$ and $F^{\prime }(1)=c-a$, with stability understood relative to $[0,1]$. A zero derivative requires examining the actual flow rather than this strict sign test.

For an original coordination game, imagine two conventions that reward matching, with convention 1 giving the larger matching reward. ChooseThe crossing is $x_{\ast }=2/5$. Below it, convention 1 loses frequency; above it, convention 1 gains frequency. The endpoint equilibrium points $0$ and $1$ have one-sided asymptotic stability, while $2/5$ is unstable: the corresponding derivatives are $-2,-3$ and $6/5$, respectively. Every initial $0<x(0)<2/5$ tends to $0$, every initial $2/5<x(0)<1$ tends to $1$, and exactly $x(0)=2/5$ stays there. Even the convention with the larger matching reward can disappear if it starts below the threshold. This is bistability, not selection of a universally best convention.

The compositions giving a symmetric Nash equilibrium in this coordination game are the two pure conventions and the mixed composition $(2/5,3/5)$. Both pure conventions are evolutionarily stable strategies because a mutant convention has strictly lower payoff against the pure resident. The mixed symmetric Nash equilibrium is not an evolutionarily stable strategy: against that resident both conventions tie, but after a pure convention-1 mutant is introduced its payoff advantage is $5(x-2/5)>0$. Equal payoffs at a symmetric Nash equilibrium need not provide resistance to invasion or asymptotic stability.

For an original coexistence model, choose payoffs making each convention advantageous when sufficiently rare:Here $x_{\ast }=3/4$ attracts every initial composition with both types present: $\dot{x}>0$ below it and $\dot{x}<0$ above it. The interior derivative is $F^{\prime }(3/4)=-3/4$, while $F^{\prime }(0)=3$ and $F^{\prime }(1)=1$ make both endpoints unstable to introduction of the other type. The endpoints nevertheless remain stationary if the other type is exactly absent; the attraction statement excludes those boundary initial states.

The sole symmetric Nash equilibrium in this coexistence model is $p=(3/4,1/4)$. It is also an evolutionarily stable strategy. For any different mixed strategy $q=(y,1-y)$, the first comparison in the two-condition criterion for evolutionary stability ties because $Ap=(3/2,3/2)$. Its second comparison is strictly positive:Thus restoring frequency feedback can protect a mixture even though all present types earn equal payoffs at the mixture. Coexistence here means different individuals using different pure strategies; it does not require every individual to randomize with a mixed strategy.

Frequency evolution need not increase the mean payoff. In the coexistence example $\bar{f}=5x-4x^2$, whose maximum occurs at $x=5/8$, whereas the attracting composition is $3/4$. For $5/8<x<3/4$, the frequency $x$ increases while $\frac{d}{dt}\bar{f}=(5-8x)\dot{x}<0$. Individual payoff advantages drive the equation; maximizing collective mean payoff is a different optimization problem.

More generally, a rest point only equalizes payoffs among present types: $x_i>0$ implies $(Ax{)}_i=x^{T}Ax$. A symmetric Nash equilibrium additionally requires $(Ax{)}_i\le x^{T}Ax$ for every absent type. All vertices are rest points even when an absent type could invade. For finite symmetric bimatrix games, a rest point with Lyapunov stability on the full probability simplex is a symmetric Nash equilibrium; an interior trajectory that converges has a symmetric Nash equilibrium as its limit. These are conditional results, not a convergence theorem for every trajectory. See Cressman and Tao (2014), Theorem 1.

The rock paper scissors payoff matrix gives an explicit obstruction to universal convergence:Since $A^T=-A$, $x^{T}Ax=0$, and in the interior $\frac{d}{dt}\log (x_1{x}_2{x}_3)={\sum }_i(Ax{)}_i=0$. Thus $x_1{x}_2{x}_3$ is conserved. Its maximum on the probability simplex occurs only at $(1/3,1/3,1/3)$, the unique symmetric Nash equilibrium, so an interior trajectory starting elsewhere cannot converge to that composition. Every other interior product level is a closed curve without a rest point, giving a periodic orbit. The existence of these cycles is also discussed in Cressman and Tao (2014), Example 1. The useful lesson is to inspect the specified payoff feedback and dynamical system, rather than infer convergence from the existence of an evolutionarily stable strategy or a Nash equilibrium.

Relative to the specified solid, $Q_{\mathrm{sp}}<K_{\mathrm{sp}}$ favors dissolution if that solid is available; $Q_{\mathrm{sp}}>K_{\mathrm{sp}}$ favors precipitation; equality marks saturation. These comparisons identify a driving direction favored by thermodynamics, not a reaction rate.^[ref]

A proof outline comes from the reaction Gibbs free energy for dissolution:Here $R$ is the molar gas constant and $T>0$ the absolute temperature. If $Q_{\mathrm{sp}}>K_{\mathrm{sp}}$, the logarithm is positive, making the reverse transfer into solid favorable. At equality the bulk driving difference vanishes. Equality can also occur at the boundary where the last solid disappears, but it is not a universal constraint on every solid-free chemical solution.

At an unramified irregular singular point with distinct leading eigenvalues, a sectorial fundamental solution is a fundamental matrix whose entries are holomorphic functions asymptotic to a prescribed formal matrix on a sector of the logarithm cover. For competing cubic exponentials, the usual construction uses six overlapping sectors with basic angle $\pi /3$. A formal power series need not converge, and two sectorial realizations may differ by exponentially small terms across a sector boundary.

A first-order ordinary differential equation is separable if its explicit form factors as $y^{\prime }=a(t)b(y)$. On an interval where $b(y)\ne 0$, write $dy/b(y)=a(t)dt$ and take antiderivatives to obtain an implicit solution:An initial condition determines $C$ and selects a branch and domain. The useful simplification is that the two integrals each involve only one variable, even when the original equation is nonlinear.

For Newton's law of cooling, division by $y-T_a$ gives $dy/(y-T_a)=-kdt$. To keep the logarithm dimensionless, integrate relative to the initial excess temperature:When $y_0\ne T_a$, continuity preserves the sign of the excess temperature until any potential zero, giving $y-T_a=(y_0-T_a)e^{-k(t-t_0)}$. This formula never reaches zero at finite time. Taking its derivative verifies the ordinary differential equation, and substitution at $t_0$ verifies the initial condition.

Always check what division removed. Each zero $b(y_{\ast })=0$ gives a constant solution of a differential equation $y=y_{\ast }$. Cooling therefore also has the equilibrium point $y=T_a$, omitted by division but included in the final explicit formula. For the nonunique initial value problem $y^{\prime }=\sqrt{|y|}$, division by $\sqrt{|y|}$ only describes the moving pieces: a valid solution may remain zero for an arbitrary time before joining one. Separation is a method for finding solutions, not a uniqueness theorem.

A steady state does not by itself give every fluctuating observable an entropy production symmetry. If the dimensionless total entropy production ${\Sigma }_t$ has the same-law finite relation and a large deviation principle with rate function $I$ for ${\Sigma }_t/t$, then, on its common domain,The first expression denotes leading exponential scaling; the second follows by taking the scaled logarithm of the probability ratio. A finite-state, autonomous Markov process with time-even states, positive bidirectional rates and a positive stationary distribution supplies a standard setting for a finite total-entropy production relation. The stochastic system entropy is then bounded, so its endpoint contribution does not change the long-time rate function of bath entropy production. ^[ref]

Unbounded state spaces can have endpoint fluctuations on the scale relevant to a large deviation principle. Dropping system entropy, changing the measured observable to heat, or changing the reverse preparation therefore requires a fresh argument. The exact finite integral fluctuation theorem, a same-law finite relation, and an asymptotic rate function symmetry are distinct claims.

Consider an unnamed model substance with molar latent heat $L_m=40.0\mathrm{kJ}\mathrm{mo}{\mathrm{l}}^{-1}$ and saturation pressure $p_1=10.0\mathrm{kPa}$ at $T_1=300\mathrm{K}$. Stipulate the Ideal-vapor Clausius-Clapeyron approximation throughout $280\le T\le 340\mathrm{K}$, constant $L_m$, and $R=8.314\mathrm{J}\mathrm{mo}{\mathrm{l}}^{-1}{\mathrm{K}}^{-1}$. These parameters define an illustrative model, not a measured dataset or a fit to water. At $T_2=330\mathrm{K}$,At the reference state the gas molar volume is $R{T}_1/p_1=0.24942{\mathrm{m}}^3\mathrm{mo}{\mathrm{l}}^{-1}$, and the local slope is $dp/dT\simeq 0.5346\mathrm{kPa}{\mathrm{K}}^{-1}$. The tangent estimate $p_2\approx 10.0+30(0.5346)=26.04\mathrm{kPa}$ is much lower than the integrated result: a local derivative should not be extrapolated over this whole interval. By contrast, over a small temperature increment, the fractional sensitivity is $d\ln (p/p_1)/dT=L_m/(R{T}_1^2)\simeq 0.05346{\mathrm{K}}^{-1}$.

Stirling's formula turns the long product defining a factorial into a short expression. For positive integers $n$, putThen $n!\sim S_n$ as $n\to \infty$. This is asymptotic equivalence: $S_n/n!\to 1$, so the relative error tends to zero. It does not say that the absolute error tends to zero, and the formula is not an equality for finite $n$. The Gamma function extends this approximation beyond integer inputs. ^[ref]

For $n=10$,The leading estimate is about $0.830\%$ low. Multiplying by the first correction factor giveswhich is about $0.003176\%$ low. The Stirling correction by Gaussian moments explains why this factor is $1+1/(12n)$ rather than an arbitrary numerical adjustment.

The usefulness is in ratios as well as in enormous numbers. Applying Stirling's formula to the three factorials in a central binomial coefficient givesThis counts the ways to choose exactly half of $2n$ objects. Equivalently, for $2n$ independent fair coin tosses, the binomial distribution assigns probability $\left(\genfrac{}{}{0ex}{}{2n}{n}\right)/4^n\sim 1/\sqrt{\pi n}$ to exactly $n$ heads. An exponentially large count becomes a simple probability scale after cancellation.

For numerical calculations, taking the natural logarithm yieldswhere $r_n\to 0$. Computing a logarithm of a large factorial avoids representing the factorial itself. The Robbins bounds for Stirling's formula give a finite-$n$ interval for this logarithmic remainder, rather than only a limiting statement.

The factor $\sqrt{2\pi n}$ is beautiful because a Gaussian integral lies behind a discrete product. The Gaussian peak behind Stirling's formula displays this connection through the Gamma integral and Laplace's method. A rigorous proof must also control the tails of the integral; the local expansion explains the geometry but is not by itself a complete proof.

James Stirling published Methodus differentialis in 1730, a treatise on summation and interpolation of infinite series. This setting connects the formula with a practical calculation problem: taking logarithms turns a long product into a sum, whose growth can be approximated. ^[ref]

A quantum vortex becomes energetically favourable in a rotating reference frame when $\Delta E-\Omega \Delta L_z<0$. For a singly quantized vortex in a long radially Thomas–Fermi condensate, the cutoff-shell estimate isIntegrating the trapped number density against $u_{\theta }^2$ produces the logarithm and constant; integrating it against angular momentum per particle gives $\Delta L_z\simeq \pi H{n}_0\hslash R_r^2/2$. Resolved-core corrections can alter the nonlogarithmic constant. This criterion compares equilibrium rotating-frame energies and does not remove a dynamical vortex-entry barrier.

The time complexity of an algorithm bounds its number of computation steps as a function of its input length.

Specify both the size parameter and the operations counted. For binary search, take $n$ to be the number of array entries and count a three-way comparison of the target with one entry as one operation. Code using separate equality and less-than tests may perform two primitive tests per inspected entry; this changes a constant factor. The input size in bits is a different parameter when entries have variable-length representations.

Worst-case time complexity maximizes the count over permitted inputs of size $n$. An absent target forces $n$ comparisons in linear search. For binary search, the worst-case count is $\lfloor {\log }_{2}n\rfloor +1$ for $n\ge 1$, attained by a target larger than every entry. Both have a best case of one comparison when the first inspected entry matches.

In Big O notation, the worst-case bounds are $O(n)$ and $O(\log n)$ respectively. Here $T(n)=O(g(n))$ means that fixed constants $C,n_0$ exist with $T(n)\le Cg(n)$ for all $n\ge n_0$. It is an upper bound, so a logarithmic count is also $O(n)$; the sharper bound communicates its scaling better. The base of the logarithm changes only a constant factor.

For $n=1,000,000$, linear search can require $1,000,000$ comparisons, whereas binary search needs at most $20$, since $2^{19}\le n<2^{20}$. Doubling $n$ adds just one to the worst-case binary search count. These are operation counts, not measured machine runtimes. Translating them into logarithmic execution time assumes constant-cost indexed access, comparison and index arithmetic. Long entries can make comparison expensive; a linked list does not provide constant-cost access to an arbitrary middle index. Building or sorting the array is additional work: merge sort can provide order for many subsequent searches, but its cost belongs in the analysis too.

A torsion balance measures a weak torque by suspending a body from a thin fiber and reading its twist angle. The fiber supports the body's gravitational weight while permitting rotation about the suspension axis. In the range of linear elasticity, a twist $\theta$ in radians, measured from the untwisted reference orientation, produces a restoring torqueThe torsion constant $\kappa$ sets the sensitivity. At static equilibrium with an applied torque ${\tau }_{\mathrm{ext}}$ and no other axial torque, ${\tau }_{\mathrm{ext}}=\kappa \theta$. A perpendicular force $F$ at lever arm $a$ therefore gives $\theta =aF/\kappa$. The torsion balance measures a turning effect: a force whose line of action passes through the suspension axis gives no axial torque. The Cavendish torsion balance is the gravitational application; Coulomb's law supplies an electrical one. ^[ref]

The original schematic separates two ways of reading the same torque. In deflection operation the top attachment stays fixed and the body rotates. In null operation the experimenter rotates the top attachment by $\alpha$ while returning the body's laboratory angle $\beta$ to its original value. If the initially untwisted configuration has $\alpha =\beta =0$, the fiber twist is $\theta =\beta -\alpha$, not $\beta$ alone. ThusFor a positive applied torque, holding $\beta =0$ requires $\alpha =-{\tau }_{\mathrm{ext}}/\kappa$. Keeping the body at the same angle keeps the lever arm and source geometry fixed, making comparison of different applied forces easier. Either readout still requires a calibrated torsion constant and a stable reference orientation.

An illustrative calculation shows the amplification: with $a=0.050\mathrm{m}$, $F=2.0\times 10^{-9}\mathrm{N}$, and $\kappa =1.0\times 10^{-8}\mathrm{N}m/rad$, the applied torque is $1.0\times 10^{-10}\mathrm{N}\mathrm{m}$ and the equilibrium twist is $0.010\mathrm{rad}\simeq 0.573^{\circ }$. These are stipulated values, not measured data. Reducing the torsion constant tenfold increases this twist tenfold, provided the fiber remains in its calibrated linear elasticity range. The cost is a slower response, explained by the oscillation period in torsion constant.

A concrete laboratory experiment is PASCO's Coulomb balance: level its counterbalanced rod, discharge both conducting spheres, and set the unloaded zero. Charge the spheres at maximum separation; switch off the charging supply. Move the second sphere to a known center separation $R$, then turn the suspension dial until the rod returns to its index mark. Record the dial change and $R$, recharge, and repeat at several separations. The manual recommends a draft-free room, clean insulating supports, and recharging before each reading: leakage, especially in humid conditions, otherwise changes the electric charges during the sequence. At close separations the conducting spheres redistribute charge, so the point charge approximation needs correction. ^[ref]

For constant electric charges and a fixed perpendicular lever arm, the Coulomb's law prediction is $|\theta |\propto R^{-2}$. Plotting the logarithm of twist magnitude against the logarithm of separation gives $\log |\theta |=\text{constant}-2\log R$, so the predicted slope is $-2$. Absolute force measurement additionally needs the torsion constant; comparing ratios can eliminate it if it remains stable. Repeating a reference separation between other settings distinguishes a separation effect from a changing signal. A declining reading at the reference separation would invalidate the assumption of unchanged electric charges, even if a distance plot looks smooth.

The historical electrical example is Coulomb's first memoir of 1785. His apparatus enclosed a suspended needle with a small ball and a second ball; an adjustable head twisted the suspension. After charging the balls by contact, he reported angular separations $36^{\circ }$, $18^{\circ }$, and $8.5^{\circ }$ with head settings $0^{\circ }$, $126^{\circ }$, and $567^{\circ }$. The total twists were approximately $36^{\circ }$, $144^{\circ }$, and $576^{\circ }$: fourfold restoring torque accompanied approximately halved separation. These are his reported observations, not data from our diagrams. ^[ref] A precise reconstruction must use center distances and the changing lever arm, rather than identify angular separation exactly with distance; Alberto A. Martínez's replication explicitly analyzes that geometry. ^[ref]

Sensitivity also exposes changes of the apparatus itself. Fleischer and colleagues' cryogenic torsion balance used a temperature-controlled enclosure to reduce vacuum-vessel top-plate temperature fluctuations to approximately $\pm 0.01\mathrm{K}$, limiting changes in suspension geometry from thermal expansion. They used a mild bake-out near $40^{\circ }\mathrm{C}$ to speed initial fiber relaxation and reduce slow zero motion. Their optical readout compared the pendulum mirror with an internal reference mirror to reject shared optical motion. Room-temperature thermal radiation entering through the optical opening heated the pendulum; a cold filter reduced that load. The authors could not directly measure the pendulum's temperature without disturbing it, and explicitly distinguished the cold shield's temperature from the body's. Cooling therefore requires checking the actual noise and thermal environment, rather than assuming that the fiber and body share the shield's temperature. ^[ref]

A useful control strategy is to record unloaded readings and temperature before and after each signal sequence, recalibrate the torsion constant under the same conditions, and compare forward and reverse settings. The algebra of torsion balance zero drift shows precisely which offsets such comparisons can cancel. A fine angular scale alone does not establish a small measurement error.