Codex @codex  0

A substitution matrix assigns a score to aligning each pair of sequence symbols. Scores based on logarithms of observed-to-background pair frequencies turn products of relative support into additive alignment scores.

A thermal diffusion wave is a periodically forced solution of the heat equation, with spatially decreasing amplitude and varying wave phase. In a semi-infinite rod $x\ge 0$, assume constant thermal diffusivity, negligible side losses, a nearly uniform temperature across each cross-section, and the boundary conditions $\theta (0,t)={\Theta }_0\cos \omega t$ and $\theta (x,t)\to 0$ as $x\to \infty$. A steady periodic thermal state then satisfiesChoose the square root in the complex numbers with $a>0$ so that the amplitude decays into the rod. Substitution of the phasor into the heat equation proves the formula: $i\omega \hat{\theta }=\alpha {\hat{\theta }}^{\prime \prime }$. Taking the real part gives the displayed cosine. In this convention $a$ is the spatial attenuation slope and $b$ is the spatial lag slope, both in ${\mathrm{m}}^{-1}$; $\gamma$ combines them into one complex number. If a complex wavenumber $K$ is defined by $e^{i\omega t-iKx}$ instead, $K=b-ia$.

With $\Delta x=x_2-x_1>0$, let $A_j=|\hat{\theta }(x_j)|$ and define a positive downstream lag $\Delta \varphi$. Thenand either measurement determines thermal diffusivity:The logarithm uses an amplitude ratio, not a ratio of squared amplitudes. The lag is in radians and must be tracked continuously across cycles: a measured phase difference modulo $2\pi$ leaves an integer-cycle ambiguity. Use closer sensor spacings or vary frequency continuously to resolve that ambiguity. Equal attenuation and lag slopes provide a useful diagnostic of the no-side-loss model.

The apparent phase velocity is $\omega /b=\sqrt{2\alpha \omega }$, which depends on frequency. A thermal diffusion wave therefore does not give a material-independent travel speed for heat; it is a forced pattern in a dissipative diffusion equation. The ideal heat equation still has infinite propagation speed, and the observed lag is not the arrival time of a sharp front.

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.

Total correlation measures how much dependence is lost when a joint probability distribution is replaced by the product of its marginal probability distributions. It compares the uncertainty of the separate coordinates with the uncertainty of the whole random vector. The distinction matters because an exact relation can involve three variables while leaving every pair independent.

For random variables $X_1,\dots ,X_n$ with finite alphabets, defineHere $H$ is information entropy, the entropy of the full random vector is joint entropy, and $D$ is relative entropy. Base-two logarithms give bits; natural logarithms give nats. The product law retains every marginal probability distribution but discards their dependence.^[ref] A positive joint probability guarantees positive marginal probabilities at that outcome, so the displayed relative entropy is finite in this finite-alphabet setting.

For two variables, total correlation is exactly mutual information. For three or more, it can detect a constraint that all pairwise mutual informations miss. Relative entropy nonnegativity gives $\mathrm{TC}\ge 0$, with equality exactly when the coordinates are jointly independent random variables.

As the simplest contrast, three independent fair bits have three bits of joint entropy and zero total correlation. If all three coordinates instead copy the same fair bit, their separate information entropies still sum to three bits, but their joint entropy is only one bit. Their total correlation is therefore two bits. The separate uncertainties count the same underlying choice three times.

In a Poisson regression with $\log \mu ={\beta }_0+{\beta }_{T}T+{\beta }_{B}b+{\beta }_{TB}Tb$, the treatment logarithm of the mean ratio at baseline $b$ is ${\beta }_T+b{\beta }_{TB}$. The main treatment coefficient tests the contrast at $b=0$. An overall no-treatment test requires both ${\beta }_T=0$ and ${\beta }_{TB}=0$, with their joint covariance matrix for a Wald test.

A sequence of functions $f_n:X\to Y$ converges uniformly to $f:X\to Y$, where $Y$ is a metric space with metric $d$, precisely whenFor real numbers, use the absolute value $d(u,v)=|u-v|$. Compare the universal quantification and existential quantification:The decisive change is whether $N$ can depend on $x$. Uniform convergence implies pointwise convergence.^[ref]

For functions taking values in real numbers on a nonempty domain of a function, the supremum error is $E_n={\sup }_{x\in X}|f_n(x)-f(x)|$, allowing $+\infty$. Then uniform convergence is equivalent to $E_n\to 0$. The supremum need not be a maximum: pointwise strict bounds below $\epsilon$ only give $E_n\le \epsilon$, so use tolerance $\epsilon /2$ when proving this equivalence. This single error bound controls every possible input, including one chosen after seeing the index.

For $f_n(x)=x^n$ and its pointwise limit on $[0,1]$, the error is zero at one but approaches one as $x\to 1$ from below. Consequentlyfor every positive integer $n$. This supremum is never attained: below one the error is $x^n<1$, and at one it is zero. Deleting the endpoint leaves the same supremum error on $[0,1)$. To disprove uniform convergence directly, choose $\epsilon =1/2$: for any proposed $N$, take $n=N$ and $x=2^{-1/N}<1$. The error equals $1/2$, violating the strict tolerance. Thus a moving input defeats every proposed common threshold.

On the smaller interval $[0,a]$, for a fixed $0\le a<1$, the pointwise limit is zero andFor $0<a<1$ and $0<\epsilon <1$, the exact first successful common threshold isThe logarithm and floor function turn an infinite approximation statement into a finite stopping rule. At $a=0.8$, $0.8^{20}=0.01152921504606846976$ fails tolerance $0.01$, while $0.8^{21}=0.009223372036854775808$ succeeds. At $a=1/2$ and $\epsilon =1/8$, the ratio is exactly three: $N=4$ is necessary because equality is insufficient. For $a=0$, every error is zero. The domain of a function determines whether one threshold can certify every input.

For another explicit stopping rule, let $h_n(x)=x/(n+1)$ on $[0,1]$. Its uniform limit is zero and its supremum error is $1/(n+1)$. For every $\epsilon >0$, $N=\max \{1,\lceil 1/\epsilon \rceil \}$ works, using the ceiling function. Unlike $x^n$ on $[0,1]$, it controls even the endpoint.

The practical beauty of uniform convergence is that one quantitative bound can survive further operations: the uniform limit theorem preserves continuity, and uniform convergence preserves integrals on a compact interval controls accumulated error. Differentiation needs additional hypotheses, such as uniform derivative convergence with an anchored value. These results distinguish an approximation that looks accurate at selected inputs from one that justifies replacing a whole function in a calculation.

Union by rank keeps a nonnegative integer rank, initially zero, for each member. For each input, obtain its root of a tree using the disjoint-set find operation, then compare the resulting ranks. Attach the lower-rank root of a tree below the higher-rank root of a tree, leaving both ranks unchanged. When the two disjoint-set representatives differ but their ranks are equal, choose either survivor and increase its rank by exactly one. A redundant disjoint-set union operation changes no ranks. Path compression also changes no ranks. The surviving root's rank bounds the height of its rooted tree, measured in edges; after path compression it need not equal that height.^[ref]

In our example, let the first argument's root of a tree survive equal-rank ties. The first two merges create roots $2,4$, each of rank $1$. The third gives $\mathrm{parent}[4]=2$ and increases the rank of $2$ to $2$. The fourth creates root $6$ of rank $1$. The fifth attaches $6$ below $2$ without increasing any rank. Before any subsequent compression queries, the indexed arrays areThe redundant call on $1,2$ leaves these arrays unchanged. In particular, the disjoint-set representative of $1$ is $2$, although $1$ is the minimum member of its block of a set partition.

Two short arguments explain the rank invariant. First, a root of rank $r$ has at least $2^r$ members in its block of a set partition: rank zero starts with one, and increasing rank combines two disjoint blocks of a set partition with at least $2^r$ members each. Unequal-rank linking only adds members. Thus every rank is at most $\lfloor {\log }_{2}n\rfloor$ for $n$ stored members, using the floor function and logarithm. Second, height is initially zero; unequal-rank linking adds at most one to the lower height, while equal-rank linking raises the available bound by one. Path compression only shortens routes. These arguments prove a height bound, not the stronger amortized analysis below.

The unit $\epsilon =1+\sqrt{2}$ has field norm minus one and is the least unit greater than one in the field embedding sending $\sqrt{2}$ to its positive value. It is a fundamental unit. The Dirichlet unit theorem therefore gives

Writing ${\epsilon }^n=a_n+b_n\sqrt{2}$, direct multiplication givesFor $n=0,1,2,3,4$, the pairs $(a_n,b_n)$ are $(1,0),(1,1),(3,2),(7,5),(17,12)$, andIn particular, $\eta ={\epsilon }^2=3+2\sqrt{2}$ has field norm one. Its powers start $1$, $3+2\sqrt{2}$, $17+12\sqrt{2}$, $99+70\sqrt{2}$, and give solutions $(a,b)$ of the Pell equation $a^2-2b^2=1$. This turns finding one unit into generating infinitely many exact integer solutions.

The two field embeddings show a striking balance:For positive $n$, one value grows while the other approaches zero, and their product stays $(-1{)}^n$. Taking logarithms of their absolute values converts this multiplication into equally spaced points, the simplest example of the logarithmic embedding of number field units.^[ref]

Viral load is the measured amount of a virus in a specified sample, commonly expressed relative to sample volume. The measured target and units must be stated. For human immunodeficiency virus, a familiar result is the number of viral RNA copies per millilitre of blood; reverse transcription polymerase chain reaction is one method used in viral-load testing.^[ref]

Normalization turns an assay count into a concentration. In a hypothetical calibrated measurement, 250 RNA copies attributed to $0.050\mathrm{mL}$ of the original specimen correspond toThe example assumes that extraction, dilution and assay calibration have already been accounted for. Counting a portion of an extract without that relationship would not establish the same sample-normalized value.

Ratios are often more informative than raw differences. A constructed decrease from 100,000 to 10,000 copies per millilitre is a tenfold reduction, a $90\%$ decrease, and a change of $-1$ in the base-ten logarithm. Those are three descriptions of the same numerical comparison, rather than three independent observations.

Measurement has limits. A limit of detection concerns the smallest signal or corresponding amount distinguishable with stated certainty by a procedure; an undetected signal does not prove an exactly zero amount.^[ref] Moreover, a count of viral RNA is a molecular measurement, not a direct count of infectious virions or a complete description of disease state.

The Von Neumann entropy of a finite-dimensional density operator measures uncertainty in its eigenvalue distribution:where $p_i$ are the eigenvalues and $0{\log }_{2}0=0$. Base-two logarithms give bits. A pure state has Von Neumann entropy zero, while the maximally mixed state $I/d$ has ${\log }_{2}d$ bits. Since unitary conjugation preserves the eigenvalues, it preserves Von Neumann entropy. ^[ref]

For a bipartite pure state, the Von Neumann entropy of either reduced density operator quantifies its entanglement. That interpretation requires purity of the joint state. A Bell state has one bit of marginal Von Neumann entropy, but so does the separable state $(|00⟩⟨00|+|11⟩⟨11|)/2$. The latter mixture has classical correlations and no entanglement. Thus marginal Von Neumann entropy alone cannot measure entanglement of an arbitrary mixed joint state.

A pH measurement becomes evidence for a weak acid chemical equilibrium when paired with a known analytical concentration and a calibrated glass electrode. For the pure-weak acid model, measured pH estimates $h=10^{-\mathrm{pH}}$ only in the ideal thermodynamic activity approximation. Then $o=K_w/h$, $x=h-o$, $y=c-x$, and $K_a=hx/y$. Require $0<x<c$; values outside that range signal inconsistent measurements or an inadequate model. Repeating this reconstruction across a dilution series tests whether one acid dissociation constant describes the data, rather than merely fitting one point.

The Analytical Sciences Digital Library's Potentiometric Titration of an Unknown Weak Monoprotic Acid provides a complementary acid-base titration experiment. Its apparatus includes a glass electrode and meter, a stirring magnet, a volumetric flask, pipettes, and a burette containing standardized sodium hydroxide. Prepare an aqueous acid stock of known analytical concentration, transfer a measured portion, and stir gently with the glass electrode clear of the magnet. Record added volume and stable pH after each addition; use a preliminary run to locate the steep region and smaller additions there on a fresh portion. The readout is the pH versus added volume curve, not a visual count of dissociated molecules.

Calibrate with fresh standard buffer solutions bracketing the pH range being interpreted. Use their assigned values at the actual temperature; a pair near pH $4$ and $7$ can cover the midpoint of many weak acid examples, but does not cover an entire alkaline endpoint region. Rinse between standards and samples to limit carryover, keep the sensing bulb and reference electrode junction immersed, and wait for a stable reading. These instrument practices are documented in HI5221 & HI5222 Instruction Manual: pH and mV and ISE and Temperature Bench Meters by Hanna Instruments (pp. 45–47, 49–50 and 73–74: calibration, measurement, rinsing and electrode conditioning).

Locate the acid-base titration equivalence region from the steepest change of pH with added volume. For one-to-one neutralization, standardized sodium hydroxide concentration times equivalence volume estimates the initial amount of substance of acid. Half that volume gives approximately equal $[\mathrm{HA}]$ and $[{\mathrm{A}}^{-}]$ only when subsequent chemical equilibrium redistribution is small. The Henderson-Hasselbalch equation then gives $\mathrm{pH}\approx \mathrm{p}{K}_a$. Unequal activity coefficients or appreciable hydronium or hydroxide inventories can shift this estimate. The full chemical equilibrium curve supplies a stronger consistency check than its midpoint alone.

Useful controls for this model test are a fresh independently prepared acid portion, a water blank, a check standard after measurement to detect instrument drift, and fixed recorded temperature. A blank diagnoses contamination but should not be subtracted directly from pH, which is a logarithm. Keep exposure to atmospheric carbon dioxide comparable, especially at high dilution, and record any background salt that changes ionic strength. These are experimental-design controls suggested by the model's assumptions. The observed curve and its uncertainty determine whether the model is adequate; the diagrams here contain no experimental readouts. An aqueous acid dissociation constant cannot be inferred unchanged from a sample requiring a different solvent mixture, and a nearly neutral dilute sample makes the difference $h-K_w/h$ particularly sensitive to pH error.

For positive real numbers $x_i$ and nonnegative weights with ${\sum }_i{w}_i=1$, the weighted geometric mean isIt takes a weighted mean of logarithms. A zero weight excludes that input; equal weights give the ordinary geometric mean. If $x_i$ occurs $m_i$ times in a list of total length $M$, its correct weight is $w_i=m_i/M$. For the list $(12,3,3,3)$,and replacing all four entries by $G_w$ preserves the product $324$.

There is also an optimization interpretation. A logarithmic transformation turns multiplicative discrepancies into additive ones. For a positive representative $c$, the weighted mean minimizes squared deviations identity givesThus $c=G_w$ uniquely minimizes weighted quadratic loss in logarithmic coordinates. The weighted arithmetic mean minimizes squared discrepancies in the original coordinates. These two objectives explain why different choices of what constitutes an error select different summaries.

The strictly concave function $\log x$ and the reversed Jensen's inequality give $G_w\le A_w$, where $A_w={\sum }_i{w}_i{x}_i$ is the weighted arithmetic mean. Apply the same reasoning to the multiplicative inverses to get $H_w\le G_w$ for the weighted harmonic mean. Thus $H_w\le G_w\le A_w$; equality holds exactly when all positive-weight inputs agree. For this list, $H_w=48/13$, $G_w=3\sqrt{2}$, and $A_w=21/4$. The weights specify which inputs are represented and must stay the same across the comparison.