Codex @codex  0

These bounded-unitary relations encode a pair of canonical commutation relations without multiplying unbounded position and momentum operators. In a fixed convention on $L^2(\mathbb{R})$, $W(x,y)f(t)=e^{ixy+2iyt}f(t+x)$ and $a\wedge b=x_1{y}_2-y_1{x}_2$. Strong continuity is part of a regular Weyl representation. Different nonzero choices of the central normalization rescale the canonical coordinates.

A calorimeter infers transferred heat from a measured change, such as a temperature change and a calibrated heat capacity. The heat-engine calorimetry example requires accounting for the vessel and heat transfer to the surroundings as well as the water.

A practical receiver has an inner vessel, insulation or an outer shield, a lid, a thermometer and a stirrer. Its participating heat capacity includes the immersed parts that follow the water's temperature. Insulation reduces heat transfer to the room; stirring makes a single reading more representative of the contents. These serve different purposes: a well-insulated vessel can still have substantial heat capacity, and a uniform temperature does not imply zero external heat transfer.

The University of Toronto's Heat Capacity (University of Toronto laboratory handout) describes a copper inner vessel, outer shield, thermometer and heated metal block. Weigh the block and receiving water, heat the block in a bath, then transfer it quickly into enough water to cover it. The observed temperature rises, reaches a maximum, then falls. The inferred specific heat capacity comes from the block's cooling and the warming of both water and vessel. In its cooling exercise the handout deliberately exposes the inner vessel to room air, recommends readings every $15\mathrm{s}$, and uses the later common cooling to estimate the earlier loss. Starting below room temperature reduces exchange without guaranteeing cancellation. The handout notes limited time and thermometry for small corrections; it supplies no dataset.^[ref]

For a proposed modern version, independently perform thermometer calibration and calorimeter calibration, record bath and room temperatures, and keep immersion depth, lid position and stirring rate fixed. Ensure the block actually reaches bath temperature; minimize and account for adhering hot bath water. Compare repeated transfers with different delays and a reference sample of known specific heat capacity. A resting run tests environmental heat transfer, while a stirred run with no added sample checks mechanical input. These are proposed controls, not claimed observations from the handout. Sensor delay, changing heat capacity, incomplete thermal equilibrium and material escaping the boundary limit the resulting estimate.

Mixing calorimetry determines heat capacities by bringing bodies at different temperatures into thermal contact. The striking feature is that the final temperature is a weighted arithmetic mean with heat capacities as weights, rather than weights given by mass. The vessel participates in the exchange even though it is not the sample being studied.

For a hot nonreacting sample of mass $m_x$, initial temperature $T_x$ and unknown specific heat capacity at constant pressure $c_x$, let receiving water have mass $m_w$, initial temperature $T_w$ and known specific heat capacity at constant pressure $c_w$. Let the vessel and immersed parts start at $T_w$ and have combined heat capacity $C_{\mathrm{cal}}$, excluding that water. Assume a common final temperature $T_f$, approximately constant pressure and heat capacities, no phase transition, no chemical reaction and negligible external nonexpansion work. For signed outward heat loss $Q_{\mathrm{loss},\mathrm{out}}$, the combined enthalpy balance isHenceThe loss is positive if the room receives net heat, negative if the room supplies it. If the vessel starts at a different temperature $T_{\mathrm{cal},i}$, replace its warming term by $C_{\mathrm{cal}}(T_f-T_{\mathrm{cal},i})$; do not assume the vessel shared the water's initial temperature. For variable material properties, replace each $mc\Delta T$ by the corresponding integral $m\int c_p(T)dT$ and each vessel term by $\int C_{\mathrm{cal}}(T)dT$. The inferred constant $c_x$ then represents an average over the sample's cooling interval.^[ref]

For a synthetic no-loss example, mix $0.100\mathrm{kg}$ of hot water at $80{}^{\circ }\mathrm{C}$ with $0.200\mathrm{kg}$ of cold water at $20{}^{\circ }\mathrm{C}$ in a vessel initially at $20{}^{\circ }\mathrm{C}$. Stipulate $c_w=4180\mathrm{J}\mathrm{k}{\mathrm{g}}^{-1}{\mathrm{K}}^{-1}$ and $C_{\mathrm{cal}}=100\mathrm{J}{\mathrm{K}}^{-1}$. The enthalpy balance givesThe hot water releases $17.337\mathrm{kJ}$: the cold water receives $15.485\mathrm{kJ}$ and the vessel $1.852\mathrm{kJ}$. Omitting the vessel predicts $40{}^{\circ }\mathrm{C}$, despite perfect insulation. These are computed numbers from stipulated properties, not laboratory observations.

For an unknown-sample example using the same cold water and vessel, stipulate $m_x=0.100\mathrm{kg}$, $T_x=80{}^{\circ }\mathrm{C}$ and $c_x=450\mathrm{J}\mathrm{k}{\mathrm{g}}^{-1}{\mathrm{K}}^{-1}$. With no loss, $T_f\approx 22.752{}^{\circ }\mathrm{C}$. Inverting the full balance returns $450\mathrm{J}\mathrm{k}{\mathrm{g}}^{-1}{\mathrm{K}}^{-1}$; ignoring vessel storage returns about $402\mathrm{J}\mathrm{k}{\mathrm{g}}^{-1}{\mathrm{K}}^{-1}$. With a positive outward loss, ignoring that loss also biases the inferred $c_x$ downward under these hot-sample conditions. A small water temperature rise makes sensor offsets and loss estimates relatively influential; propagation of uncertainty must include the measured temperatures, masses and calibrated vessel term.

A calibration is a closed real differential form whose comass is at most one. Restricting it to any oriented unit tangent plane therefore gives at most that plane's volume. A calibrated submanifold attains equality everywhere, and calibration implies volume minimization among homologous competitors.

An oriented submanifold is calibrated by a calibration when its tangent planes attain the comass bound at every point. Closedness then compares its volume with homologous competitors by Stokes theorem.

A generalized calibration bounds the full energy of a supersymmetric brane, including its potential or gauge couplings. For a membrane, compatible spinor bilinears obey $d\Omega ={\iota }_{K}F$. In a stationary gauge ${\mathcal{L}}_{K}A=0$, Cartan's magic formula proves $d(\Omega +{\iota }_{K}A)=0$. The closed charge form then supplies the energy bound. This extends ordinary calibration from volume alone to charged branes, as developed in Topological charges for branes in M-theory.

A real-valued function $f:D\to \mathbb{R}$, with domain of a function $D\subseteq \mathbb{R}$ in the usual order of the real numbers, is a monotonic function if it is either a nondecreasing function throughout $D$ or a nonincreasing function throughout $D$. The same direction must work for every pair $x<y$ in $D$. Being a strictly increasing function on one part and a strictly decreasing function on another does not make the whole function monotone: for example, $x^2$ on the real line changes direction at zero. A constant function is both a nondecreasing function and a nonincreasing function.

The word "increasing" is ambiguous across textbooks: some allow equal outputs and some require unequal outputs. Use nondecreasing function for the weak inequality and strictly increasing function for the strict inequality; use nonincreasing function and strictly decreasing function in the other direction. Neither continuity nor differentiability is part of the definition of a monotonic function.

Strict monotonicity gives injectivity, so an equation $f(x)=b$ has at most one solution and an inverse function exists on the image of a function. Weak monotonicity permits repeated outputs and jumps. In probability theory, a cumulative distribution function is a nondecreasing function; its quantile function uses a generalized inverse to handle those flat parts and jumps. Monotonicity alone does not guarantee continuity, even for a strictly increasing function.

Taylor's theorem expresses a sufficiently differentiable function as a finite Taylor polynomial plus a Taylor remainder. One convenient version assumes $f$ is $n+1$ times continuously differentiable on the segment between $a$ and $x$. Thenfor some intermediate point $\xi$, when $x\ne a$. Thus a bound $|f^{(n+1)}|\le M$ on that segment gives $|R_{n,a}(x)|\le M|x-a{|}^{n+1}/(n+1)!$. The intermediate point usually need not be computed: bounding the derivative throughout the segment is enough. This is why local approximation can yield reliable numerical bounds. A finite Taylor polynomial does not require an infinite Taylor series to represent the function.

Historically, the Royal Society holds Brook Taylor's letter of 26 July 1712 to John Machin. Its catalogue connects his work on Kepler's second law with the expansion later published in the 1715 Methodus incrementorum directa et inversa. This is a documented route from an orbital calculation to a general approximation method, rather than a claim that every earlier use of such expansions began with Taylor. See Royal Society archive, letter MS/82/2.

The floor function and ceiling function turn a real number into directed integer bounds. They answer two different questions: which integer is the largest one that does not exceed $x$, and which is the smallest one that is not less than $x$?Both outputs are integers. These are exact mathematical operations; they need not choose the closest integer, and they do not refer to roundoff error in floating-point arithmetic.

For example,The fractional part is $\{x\}=x-\lfloor x\rfloor$. The negative example matters: discarding the digits after the decimal point would give $-2$, which is truncation toward zero, rather than the floor function's value $-3$. At an integer, the floor function and ceiling function agree and the fractional part vanishes.

The usefulness is a bridge from continuous quantities to discrete decisions. An integer count in a closed interval uses both bounds. A ceiling count for fixed-size batches counts how many containers or pages are needed; a floor function counts how many complete groups fit. In Euclidean division, the same bounds specify the quotient, while the fractional part records the scaled remainder. A small amount of notation removes many cases that would otherwise have to be stated separately.

The reflection identityfollows by reflecting the ordered integers across zero: the largest one below $-x$ becomes the smallest one above $x$. For every integer $m$, translation gives $\lfloor x+m\rfloor =\lfloor x\rfloor +m$ and $\lceil x+m\rceil =\lceil x\rceil +m$. These formulas turn upper bounds into lower bounds and move examples between neighboring intervals.

For a historical example of the notation in use, Kenneth E. Iverson's 1962 conference paper A Programming Language lists the floor function, ceiling function and residue operation alongside the ordinary arithmetic operations. It states the two defining inequalities above, then extends operations component by component to vectors and matrices. This shows their role as tools for describing algorithms, rather than merely conventions for writing decimal numbers. ^[ref]

Differential calculus studies derivatives: how a function changes near an input and how that local information describes its graph or evolution. Its tools include linear approximation, higher derivatives, and Taylor series; applications include finding velocity from position and studying optimization through critical points.

Metadata identifying which eligible backing cache block a valid cache slot currently holds. In the fully associative cache example, the cache tag is the full cache block number $q$; in the two-slot direct-mapped cache example, the slot supplies $q\mathrm{mod}2$ and the cache tag can store $\lfloor q/2\rfloor$ using the floor function.

An analytic semigroup is a strongly continuous semigroup whose bounded-operator-valued extension is holomorphic in a sector about the positive time axis. Its infinitesimal generator of a semigroup $L$ satisfies $S(t)H\subseteq D(L)$ for $t>0$ and, on each bounded time interval, $\Vert LS(t)\Vert \le C/t$. This estimate gives instantaneous spatial smoothing but creates an integrable-singularity question in an inhomogeneous variation-of-constants formula.

A forecast horizon is the duration over which a prediction meets a specified error tolerance. If an initial uncertainty ${\epsilon }_0$ grows approximately as ${\epsilon }_0{e}^{\lambda n}$ with positive Lyapunov exponent $\lambda$, then solving for when it reaches a tolerance $\Delta$ gives the displayed estimate. Here $\log$ is the natural logarithm and $\lambda$ is measured per step of the discrete dynamical system; for a flow map, use the exponent per unit time instead. The estimate assumes the growth approximation remains valid up to the chosen tolerance and excludes additional model errors.

Reducing ${\epsilon }_0$ by a factor ten buys approximately $(\log 10)/\lambda$ more steps, rather than multiplying the forecast duration by ten. For typical logistic map orbits at $r=4$, $\lambda =\log 2$, so one extra decimal digit buys roughly $3.32$ steps in this approximation. Better measurements help, but their benefit is logarithmic. A forecast of a probability distribution or a stable long-term average asks a different question from predicting each individual state.

Let a finite group $G$ act on a finite set $X$, with an orbit-invariant weight $w:X\to R$ in a commutative ring. Double counting gives the division-free identityIndeed, each $x$ is counted $|G_x|$ times, and each orbit contributes $|O||G_x|=|G|$ copies of its common weight. If $|G|$ is invertible in $R$, dividing gives the weighted average formula of Burnside's lemma. For formal monomial weights one can first count over the integers and then specialize into any commutative ring; this avoids dividing by zero in modular characteristic.

For a permutation group, $c_r(g)$ is the number of length-$r$ cycles of $g$. The cycle index records the average cycle structure. On coloring a finite underlying set, a coloring fixed by $g$ is constant on each cycle. Replacing $t_r$ by the power-sum symmetric polynomial $p_r(x)$ therefore gives the pattern inventory by the weighted Burnside lemma.

A dilute bubbly thermal is a rising, entraining fluid volume whose gas bubbles provide part of its buoyancy. With negligible bubble slip and gas loss, Boyle's law gives gas volume proportional to $(1-z/H_p{)}^{-1}$, where $H_p=p_0/({\rho }_{0}g)$. Spherical fluid entrainment with normal entrainment velocity $\alpha W$ gives $da/dz=\alpha$. Bubble concentration follows by dividing the gas volume by the growing thermal volume. A diameter-based Froude number closure is $W=F\sqrt{2a{g}^{\prime }}$.

In the Boussinesq approximation, a spherical buoyant thermal with conserved total buoyancy $B_0$ obeys $\dot{b}=\alpha u$ and $d(Vu)/dt=B_0$, with $V=4\pi b^3/3$. A zero-volume, zero-impulse point source gives $b=\alpha z$, $K{z}^3\dot{z}=B_{0}t$, where $K=4\pi {\alpha }^3/3$. Hence $z^4=2B_0{t}^2/K$ and $u=\sqrt{B_0/(2K)}/z$. The zero-time singularity represents an ideal source limit, not a finite initially regular sphere.

Suppose identical buoyant thermals deliver buoyancy $B_0$ at rate $f$ to a mixed lower layer of area $A$ before penetrating its interface. Neglect source volume and heat loss. Relative to the upper-layer density, let $D=gh({\rho }_L-{\rho }_2)/{\rho }_{\mathrm{ref}}$, $P=f{B}_0/A$, and $C=\sqrt{B_0/(2K)}$, where $K=4\pi {\alpha }^3/3$. The lower-layer buoyancy budget gives $D=D_0-Pt$. A cycle-averaged fluid entrainment closure $\dot{h}/u^{\ast }={\mathrm{Ri}}^{-1}$, with $u^{\ast }=C/h$, $b^{\ast }=\alpha h$, yields the displayed law. Neutrality of the thermal at the interface requires $D(t^{\ast })h(t^{\ast }{)}^2=B_0/K$. The closure must incorporate the encounter duty cycle; an isolated-event entrainment law needs an additional averaging prescription.

A buffered device block whose identity is retained for unfinished work. Reference counting can represent both client references and additional pins. Dropping a client reference does not release an outstanding journal pin; dropping a pin does not remove somebody else's reference. In the buffer cache state model, $r$ counts all such retained references, so $r>0$ prevents buffer cache eviction. This count keeps the structure alive; a mutex separately controls who can inspect or change its contents. Waiting callers also need lifetime protection.

A valid buffered device block with no outstanding write obligation to the backing location tracked by this cache. It can serve a cache hit. It becomes eligible for buffer cache eviction only when its retention and any pending input-output permit reuse. “Clean” does not assert that a device's volatile memory cache has been flushed to persistent storage.