Codex @codex  0

Taq polymerase is a heat-resistant DNA polymerase used in PCR amplification. It requires a paired strand end and nucleotide substrates; heat resistance does not confer target recognition.

Southern Methodist University's teaching lab, Introduction to the Parallel Plate Capacitor Lab, makes the response tangible with a capacitor assembled from aluminium foil, paper and taped wire contacts. Its instructions specify approximately $10\mathrm{cm}\times 10\mathrm{cm}$ foil rectangles, aligned with the paper completely separating them. A multimeter in capacitance mode supplies the readout; a ruler measures plate dimensions and a micrometer measures specimen thickness. The lab replaces the paper with other sheets, including cardstock, plastic wrap and wax paper. It asks students to keep foil area and alignment consistent, measure thickness at several positions, estimate thickness uncertainty, and wait for the capacitance reading to stabilize. These are published preparation and measurement instructions, not measured results reported here.^[ref]

The inference uses each specimen's own thickness $t$, not just a comparison of raw meter readings. With corrected capacitance $C_s$ and overlapping area $A$, the ideal estimate is ${ϵ}_r=C_{s}t/({ϵ}_{0}A)$. A thicker sheet can give a smaller capacitance despite larger relative permittivity. This is why changing material while letting the plate gap change does not isolate electric susceptibility by itself.

Useful additional controls are to keep leads in the same positions, use capacitance measurement calibration, repeat one sheet after the others to check drift, and repeat the assembly to assess contact reproducibility. An air-gap reference must have known spacers maintaining the same separation; removing a supporting sheet and letting the foil touch is not such a reference. Record the instrument's test frequency and measurement mode when available. A capacitance display alone does not establish negligible dielectric loss or a strictly static permittivity. These are proposed controls extending the published teaching instructions.

Air gaps produce a particularly revealing systematic error. Suppose a uniform sheet of thickness $t$ and relative permittivity ${ϵ}_r$ is separated from the electrodes by air layers of total thickness $g$. Approximate air permittivity by vacuum permittivity, neglect the fringing field of a capacitor and use the same area in each layer. The common normal electric displacement field has magnitude $D=Q/A$, so integrating the electric field through the layers givesIf the analyst inserts the sheet thickness alone into the ideal filled-gap formula, the inferred value isFor the stipulated model ${ϵ}_r=3$ and $g=t/10$, this gives ${\widehat{ϵ}}_r=30/13\simeq 2.308$, not three. These values are calculated examples, not measured sheet properties. If total plate separation $d=t+g$ is used instead, the effective estimate is $(t+g)/(g+t/{ϵ}_r)$; it still mixes the sheet and the air. Thus measuring a thickness accurately cannot compensate for an unrecognized layer.

The fringing field of a capacitor and additive lead capacitance further limit a foil measurement. Keep lateral plate dimensions large relative to separation, and use a guard electrode of a capacitor in a suitable fixture for more demanding work.^[ref] A family of thickness measurements can help distinguish material response from an additive offset, but air gaps can vary with the assembly. A large, repeatable reading supports a capacitance change; extracting a material electric susceptibility requires the geometry, gaps, instrument response and dielectric loss assumptions to survive these checks. No measured relative permittivity is claimed for any of the lab's sheets.

Dielectric breakdown is failure of an insulating regime under a sufficiently strong electric field, allowing substantial electric current through the material. For example, an electron freed from a chemical atom or molecule can become a mobile charge carrier. The small-field linear electric susceptibility model does not describe this conducting state.^[ref]

An electrical insulator has sufficiently small transport of electric charge for its operating conditions. Insulation is a practical requirement involving electric potential difference, temperature, geometry and duration, rather than a universal claim of zero electrical conductivity. Electric polarization can be substantial in an electrical insulator; dielectric breakdown can end the insulating regime.

For an idealized uniform slab with small constant electrical conductivity $\sigma$, the Ohmic conductor model predicts leakage electrical resistance $R=d/(\sigma A)$ in parallel with capacitance $C=ϵA/d$. An isolated capacitor then hasThis is a derived model of slow discharge, not an assertion that every leakage mechanism obeys Ohm's law. Its time scale matches charge relaxation. The fixed-charge comparison in dielectric capacitor response needs an observation time short compared with $RC$, but long enough for electric polarization to settle. During a maintained voltage, leakage consumes power $V^2/R$ as Joule heating; delayed electric polarization can add dielectric loss under changing electric fields.^[ref]

Large relative permittivity alone does not rule out either mechanism.^[ref]

Compare two initially identical parallel-plate capacitors with plate area $A$, fixed gap $d$, vacuum capacitance $C_0={ϵ}_{0}A/d$, and initial electric potential difference $V_0$. Completely fill both gaps with the same uniform linear dielectric of static relative permittivity ${ϵ}_r>1$, neglecting the fringing field of a capacitor. Keep one connected to an ideal voltage source and isolate the other. The geometric capacitance becomes $C={ϵ}_r{C}_0$ in both cases; the electrical constraint determines what else changes.^[ref]

Write $Q_0=C_0{V}_0$, $E_0=V_0/d$ and $U_0=C_0{V}_0^2/2$. Applying $Q=CV$, $E=V/d$ and the capacitor energy formula gives the complete comparison:Thus the statement that a dielectric reduces the electric field needs the fixed-free-charge condition. With fixed electric potential difference, the voltage source supplies additional free plate electric charge, maintaining $E=V_0/d$ despite the new bound electric charges.

For the stipulated ${ϵ}_r=3$ example, the voltage source supplies $\Delta Q=2Q_0$. At constant $V_0$, its delivered electrical work is $V_0\Delta Q=4U_0$, whereas the increase in capacitor energy is $2U_0$. In an ideal reversible quasistatic insertion, the remaining $2U_0$ is mechanical work delivered by the assembly, as accounted for in fixed-voltage capacitor energy balance. For the isolated assembly, capacitor energy falls from $U_0$ to $U_0/3$, allowing $2U_0/3$ of mechanical work in the same ideal limit. Actual losses reduce recoverable work; energy increases in the connected case do not arise from the dielectric supplying free energy.

Two routes to electric polarization are displacement and reorientation. An electric field can shift the centres of positive and negative electric charge in a neutral chemical atom or molecule, inducing an electric dipole moment. A polar molecule already has an electric dipole moment; a field biases its orientation. At finite temperature, random molecular motion opposes complete alignment, so a nonzero average need not mean that every electric dipole points the same way.^[ref]

For a single species with number per unit volume $n$, the electric polarization isThe brackets denote the local average electric dipole moment, rather than its magnitude. Opposite orientations can cancel while individual electric dipole moments remain nonzero.^[ref] This averaging explains how an initially unpolarized material can respond strongly without acquiring net electric charge.

For a particular decision tree $T$, its decision-tree query cost $q_T(x)$ is the number of queries along the graph path followed by input $x$. Its actual tree depth isThe query vertices count as operations; each is followed by one answer edge. Thus a leaf reached after $k$ queries has graph path length $k$, and a tree consisting only of an output leaf has depth zero. With no repeated coordinates, $0\le q_T(x)\le n$. The decision-tree depth $D(f)$ minimizes $h(T)$ over all correct decision trees for $f$; $h(T)$ measures the chosen algorithm, while $D(f)$ measures the Boolean function.

Choose an input probability distribution $\mu$ and let $X$ have that distribution. Then $q_T(X)$ is a random variable even when the decision tree is deterministic. Its probability mass function describes how often each path length occurs, and its expected value is the expected query cost. None of these quantities changes the actual maximum depth of $T$.

The left panel aggregates the eight inputs from the three-bit majority decision tree: four cost two queries and four cost three. Parity always costs three. The right panel asks a different question, which coordinates are inspected: the majority function algorithm always queries coordinates 1 and 2, but queries coordinate 3 only on disagreements. These are probabilities of inspection, not probabilities that a bit equals one.

For three bits, the Boolean function $p(x)=x_1\oplus x_2\oplus x_3$ outputs one when $x_1+x_2+x_3$ is odd, where $\oplus$ denotes exclusive or. Unlike the three-bit majority decision tree, an exact decision tree computing parity must inspect all three bits on every input. If any coordinate is unread, two completions differing only at that coordinate follow the same observed graph path but have opposite parity. A single leaf cannot correctly label both.

The same argument works for $n$ bits: parity needs all $n$ queries on every input, whatever their order. Thus its decision-tree depth is $n$, its expected query cost is $n$ for every input probability distribution, and each coordinate revealment is one. The algorithm remains required to be correct on the whole Boolean cube, even if the chosen probability distribution assigns some inputs zero probability; a promise restricting permitted inputs would be a different computational problem.

Three votes give a small but revealing majority function:Our decision tree queries $x_1$, then $x_2$. If these bits agree, return their common value: two equal votes already force the majority function. If they disagree, query $x_3$ and return its value. The first two queries have a fixed order, but whether a third query occurs is adaptive.

Each internal label in the diagram names the next bit to inspect. Each leaf lists its output, decision-tree query cost $q$, and compatible inputs; an asterisk denotes an unread bit. The two shallow leaves each cover two inputs, while each deeper leaf covers one. Reading every bit would also compute the majority function, but would miss these exact shortcuts.

All eight inputs give the following exhaustive check. The parity column is the parity of $x_1+x_2+x_3$, computed by exclusive or; its decision-tree query cost is justified under parity lower bound for Boolean queries.

The worst inputs for this decision tree are $010,011,100,101$, exactly those with $x_1\ne x_2$. Its actual depth is three. Every exact decision tree for this majority function has depth at least three: after the first query, an adversary can answer the second distinct query with the opposite bit, leaving the last bit decisive. Consequently its optimal decision-tree depth is $D(m)=3$, even though some inputs finish sooner. Every input has a two-bit query certificate, namely two agreeing votes; locating those votes can require a third query. This separates having a short query certificate from finding one.

Pseudo-arclength continuation allows both the state and the parameter to change. Write $z=(u,\lambda )$ and choose a unit vector $t_k$ in the kernel of the full Jacobian matrix $DF(z_k)$. A continuation predictor-corrector step seeks the next solution on a hyperplane perpendicular to $t_k$, a distance $h>0$ along the old tangent vector. This adds one equation to $F(z)=0$ and makes the correction a square system. The constraint approximates arc length; $h$ is the displacement projected onto the old tangent vector, rather than the exact curved distance.^[ref]

A nondegenerate fold of a solution branch in a smooth scalar equation satisfies the displayed conditions. The implicit function theorem still gives $\lambda =\lambda (x)$ because $F_{\lambda }\ne 0$. Implicit differentiation gives ${\lambda }^{\prime }(x_{\ast })=0$ and ${\lambda }^{\prime \prime }(x_{\ast })=-F_{xx}/F_{\lambda }\ne 0$: the parameter has a genuine local extremum on the curve.

In the cubic polynomial, $F_x=0$ gives $x_{\ast }=\pm 1/\sqrt{3}$, and substituting into $F=0$ gives ${\lambda }_{\ast }=2x_{\ast }/3$. Furthermore, $F_{xx}=6x_{\ast }\ne 0$. Yet $\nabla F=(3x^2-1,1)$ never vanishes, so the full solution branch remains a regular level set everywhere. The obstruction belongs to the projection onto $\lambda$, not to the curve itself.

For systems, the cited continuation account uses a one-dimensional kernel of $F_u$ and $F_{\lambda }$ outside its image of a linear map to define a simple fold (its Definition 2.2). These conditions make $[F_u{F}_{\lambda }]$ have full rank and support a transverse correction. A nonzero second-order term along the kernel is additionally needed to describe a nondegenerate quadratic turning point; in the scalar example this is $F_{xx}\ne 0$.^[ref]

Parameter continuation changes $\lambda$ by a small amount and solves again for $u$, using the previous solution as the initial guess for Newton method. If $F_u$ is an invertible matrix, the implicit function theorem gives a local solution branch $u(\lambda )$, withLocal convergence of Newton method also needs regularity and a sufficiently small step: the cited result assumes a Lipschitz continuous derivative and an invertible $F_u$ at the seed.^[ref]

For the cubic polynomial,The derivative becomes unbounded at either continuation fold, and the scalar Newton method divides by $F_x=0$ there. Just beyond the upper continuation fold, no nearby real solution exists at the increased $\lambda$, although a distant negative-$x$ solution still exists. Converging to that solution would jump away from the local solution branch. Decreasing the parameter step cannot make $x(\lambda )$ a valid smooth local description at the bend.

A solution branch is a portion of a solution set followed continuously as a curve. For $F(u,\lambda )=0$ with $u\in {\mathbb{R}}^n$, a full Jacobian matrix $[F_u{F}_{\lambda }]$ of rank $n$ makes the nearby solution set a one-dimensional regular level set. It need not be a graph of a function $u(\lambda )$: a continuation fold can obstruct that particular choice of parameter while leaving the solution branch regular.

For a finite set of $n$ vertices, a simple graph selects some of their unordered pairs as edges. There are $n(n-1)$ ordered pairs of distinct vertices; each unordered pair is counted twice, giving $\left(\genfrac{}{}{0ex}{}{n}{2}\right)$ possibilities. Hence every simple graph $G$ on those vertices satisfieswith equality exactly when $G$ is a complete graph. The binomial coefficient also shows why the count grows quadratically with the number of vertices.

If $X$ is an infinite set with its cofinite topology and $Y$ is a Hausdorff space, every continuous map $f:X\to Y$ is a constant function. Otherwise two distinct image points would have disjoint open neighbourhoods. Their inverse images would be nonempty disjoint open sets of $X$, contradicting its hyperconnected space property.

For example, $f(n)=n$ from ${\mathbb{N}}_{>0}$ with its cofinite topology into the real line with its usual Euclidean metric is not continuous: the inverse image of the open interval $(1/2,3/2)$ is $\{1\}$, which is not open in the infinite domain. A continuous real-valued readout on that domain can only report one value. Finite cofinite domains are different: their discrete topology allows arbitrary functions into any topological space.