Cosmological Lagrangian displacement Created 2026-09-29 Updated 2026-10-14
The cosmological Lagrangian displacement sends an initially labelled matter element from its Lagrangian coordinate to . Its time derivative determines the peculiar velocity through .
Covalent bond 2026-10-13
A covalent bond joins chemical atoms through shared Electrons. In the familiar two-centre description, one bond pair contributes to a connection between two atomic nuclei. Sharing means that the Electrons belong to the combined arrangement and interact with both atomic nuclei; it does not mean that identifiable dots shuttle along drawn paths. The [ref] emphasizes the concentration of Electrons between atomic nuclei and the resulting attraction and characteristic separation. The pair picture is especially useful for simple molecules, but is not a universal description of every covalent bond.
A Lewis structure turns this picture into practical bookkeeping. Count the valence electrons, indicate which chemical atoms are connected, and allocate two Electrons to each line. A bond pair is shared; a lone pair is assigned to one chemical atom without connecting it to another. A double line represents two bond pairs. Dots and lines record allocations, rather than positions, trajectories, or a measured three-dimensional arrangement. [ref]
https://openstax.org/books/chemistry-2e/pages/7-3-lewis-symbols-and-structures. Flowers et al., Chemistry 2e, Lewis symbols and structures
For molecular hydrogen, , each neutral hydrogen chemical atom supplies one valence electron. Thus valence electrons make one bond pair, represented by , with no lone pairs. Each hydrogen counts the same shared pair when checking its two-electron arrangement. The molecule still contains two Electrons, not four: counting a pair around both endpoints does not create extra Electrons.
For water, , neutral oxygen supplies six valence electrons and the two hydrogen chemical atoms supply one each: . Two O–H connections consume four Electrons as two bond pairs. The remaining Electrons form two lone pairs on oxygen. Around oxygen, the two bond pairs and two lone pairs count as eight Electrons; each hydrogen counts two. The whole water molecule has ten Electrons, because two additional oxygen Electrons are omitted from this valence electron drawing.
For ammonia, , the total is valence electrons: five from nitrogen and three from hydrogen. Three N–H connections use six Electrons as three bond pairs, leaving two Electrons as one lone pair on nitrogen. Thus water and ammonia have the same total of eight valence electrons but different allocations: two plus two pairs versus three plus one. This small calculation already distinguishes their connectivity without a detailed quantum mechanics calculation.
Lewis structures count bond pairs and lone pairs in molecular hydrogen, water, ammonia, and molecular oxygen; schematic layouts do not specify molecular shapes
. Details. For molecular oxygen, , valence electrons give the conventional Lewis structure. Its two bond pairs use four Electrons, leaving eight as four lone pairs, two on each oxygen. Each oxygen consequently counts eight Electrons locally. However, actual molecular oxygen has two unpaired Electrons and exhibits paramagnetism: it is attracted into a stronger magnetic field. The all-paired Lewis structure cannot capture this observation. Molecular orbital theory describes the unpaired Electrons; the successful counting diagram alone is insufficient. [ref]
Why does sharing produce a stable separation? For molecular hydrogen, the electronic arrangement responds as the atomic nuclei approach. Their interactions can lower the energy, but pushing them too close raises it. A curve of potential energy against separation therefore has a local minimum, rather than falling forever. Attraction and repulsion balance there. This is a statement about the combined system, not a claim that stationary Electrons sit between otherwise motionless atomic nuclei. [ref]
The following Morse potential makes those features calculable. Set , where is separation and its equilibrium value, and let be the well depth. With the self-chosen parameter , define the dimensionless quantitiesHere is the net separating force, obtained from the derivative of the potential energy. Positive pushes the chemical atoms apart; negative draws them together. These are illustrative curves with in chosen units, not measured molecular hydrogen data or fitted parameters.
Illustrative dimensionless Morse potential and its force: a stable local minimum, short-distance repulsion, and separation toward zero potential energy
. Details. At , and . The second derivative is , confirming a local minimum. At , ; at , . As increases without bound, approaches zero from below. Thus moving from the well bottom to separated chemical atoms requires an increase of in this model's potential energy. An actual quantum mechanics dissociation threshold also depends on the initial motion of the atomic nuclei, so the well depth alone is not every measured dissociation energy.
The force panel separates into a positive term and a negative term . At they are and , cancelling exactly; nearer separations favour the positive term. These are algebraic components of the chosen Morse potential, not separately measured microscopic forces. Their usefulness is to show how a balance arises from the slope of one energy curve.
The beauty of the pair picture is its economy: a few marks summarize connectivity and constrain what a proposed molecule can contain. Its historical anchor is Gilbert N. Lewis's 1916 paper [ref]
https://doi.org/10.1021/ja02261a002. The Atom and the Molecule, Journal of the American Chemical Society 38, 762–785
, also available as an [ref]https://zenodo.org/records/1429068. archived original paper
. Lewis structures remain useful because they answer counting questions quickly; quantum mechanics supplies the richer account when energy, shape, or unpaired Electrons matter.For , a neutral mode of the equal-width Hazel model behaves as near . Its derivative diverges as , so it is not a classical continuously differentiable mode across the critical level of an internal gravity wave. The horizontal velocity is proportional to ; its local kinetic energy is finite only for , because converges precisely then. One possible neutral-mode convention is the boundary value from with , which fixes the phase of the power on the negative- side. The Miles–Howard theorem concerns growing modes with nonreal and does not rule out such singular neutral limits.
Critical point Created 2026-09-24 Updated 2026-10-13
For a smooth function on an open set , a critical point is an input where the gradient vanishes: . Equivalently, every first partial derivative is zero. Such a critical point is a stationary point; in one variable the condition is .
There is a broader convention in elementary one-variable calculus: a "critical number" is an interior input where the derivative is zero or does not exist, provided the function itself is defined there. Thus a corner can be a critical number without being a stationary point. Here the smooth meaning of critical point is used unless the broader convention is explicitly stated. [ref]
https://openstax.org/books/calculus-volume-1/pages/4-3-maxima-and-minima. Gilbert Strang and Edwin Herman, OpenStax Calculus Volume 1, §4.3: critical numbers
For the polynomial on the real line,The stationary points at are strict local minima and attain the global minimum; the stationary point at is a strict local maximum. One can check the local classifications from , which is positive at and negative at zero. The identity proves the global minimum directly. Since as , there is no global maximum on .
A zero derivative alone does not guarantee an extremum. The polynomial has but is strictly increasing through zero: every neighbourhood of zero contains both positive and negative values, so zero is neither a local minimum nor a local maximum. Conversely, the absolute value function has a strict local minimum and a unique global minimum at zero, but its left and right derivatives are and . It is not differentiable there, so zero is a critical number under the broader convention and is not a stationary point.
The usefulness of critical points is that they reduce the search for smooth interior extrema to equations. Every local minimum or local maximum of a differentiable function at an interior point has zero gradient; this condition is necessary, and shows that it is not sufficient. The striking feature is that all the first directional derivatives must vanish together, even though the surrounding values can form a valley, a peak, or a saddle point of a scalar function. [ref]
https://www.ocw.mit.edu/ans7870/18/18.013a/textbook/HTML/chapter14/section01.html. Daniel Kleitman, MIT Calculus with Applications, §14.1: necessary conditions for an interior extremum
Proof outline: at an interior local minimum in one variable, the difference quotient is nonnegative for small and nonpositive for small . If the derivative exists, the two sides have the same limit, forcing . Reverse the inequalities for a local maximum. In several variables, apply this argument along each coordinate line to obtain zero partial derivatives and hence zero gradient. At a domain boundary, both directions may not be available: on attains its global minimum at zero although for its smooth extension.
Critical value 2026-10-14
A critical point of a smooth map is an input; a critical value is an output reached from at least one such input. For the fold , all inputs are critical points of a smooth map, and all outputs are critical values. The identical coordinate pairs live in different copies of . To classify an output , inspect its entire fiber of a function:For both inputs have matrix rank two, so the output is a regular value. For its input has matrix rank one, so the output is a critical value. For the fiber of a function is the empty set, and the output is a regular value despite being outside the image of a function.
In general, for a smooth map , write for its set of critical points of a smooth map. Its set of critical values is . Equivalently, is a critical value if some has a differential that is not surjective. A regular value requires a surjective differential at every input in that fiber of a function. The universal condition holds vacuously for an empty fiber of a function: every output outside is a regular value. These quantifiers are explicit in Loring W. Tu, An Introduction to Manifolds, Definition 8.22 and its two following remarks.
Regular circular fibers and a critical value reached from both critical and regular inputs
. Details. The distinction is useful when solving equations. For a smooth map between smooth manifolds without boundary and a regular value with nonempty fiber of a function, the regular level set theorem makes an embedded submanifold of dimension , with tangent spaceThe implicit function theorem explains the freedom count: locally, independent equations fix coordinates and leave free. The rank-nullity theorem gives the same count for the displayed kernel of a linear map. See Eckhard Meinrenken, Differentiable Manifolds, Theorems 1.11 and 1.15 for the local projection description and its consequence for level sets.
For example, , , has gradient and just one critical point, the origin, with critical value zero. For , its fiber of a function is the circle of radius , a one-dimensional embedded submanifold; negative are regular values with empty fibers. At , the fiber of a function is a single point instead of a circle. A critical value does not force its fiber of a function to be nonsmooth: that singleton is itself a zero-dimensional embedded submanifold, but the regular dimension conclusion does not apply.
Nor does a single regular input certify a regular value. The scalar smooth function has and derivative . The input zero is a critical point, while the input one is regular because . Their shared output zero is nevertheless a critical value. Conversely, different critical points of a smooth map can share one critical value: sends both critical inputs and to zero. Counting inputs and counting critical outputs are different tasks.
Finally, for , every output on the parabola is a critical value, and every output off it is a regular value with empty fiber of a function. There is no nonempty regular fiber of a function here, so the negative expression never becomes a claimed manifold dimension. Both diagrams show exact mathematical examples, not measured data.
Cubic Laplace transition integral 2026-10-05
The integral is a rescaled Scorer Hi function. It has the three useful limitsFor the negative-argument limit, scale and use the dominated convergence theorem. At zero, substitute and use the Gamma integral. For the positive-argument limit, the exponent has its maximum at , with second derivative ; Laplace's method gives the displayed factor. These estimates describe a cubic endpoint-to-saddle transition.
Cubic stationary endpoint 2026-10-06
If the first two phase derivatives vanish at an endpoint but the third does not, an oscillatory contribution is concentrated on a width proportional to . For a smooth nonzero endpoint oscillatory integral amplitude, rescaling reduces the leading contribution to a cubic oscillatory integral. Its constant follows from the Gamma function Fourier integral. This is a degenerate form of the stationary phase method, and a quadratic formula is insufficient.
In a smooth interior region with locally constant shear , a wound azimuthal Fourier mode has radial wavenumber . Integrating its resistive damping rate gives the exponential decay in the title. The characteristic time is . For and , , where . This is a high-magnetic Reynolds number interior transient on a time long compared with the rotation time but short compared with . Physical magnetic field components may have additional algebraic factors from taking derivatives of the wound magnetic vector potential. A maintained exterior field, an axial core and a circulation-edge boundary layer prevent interpreting this estimate as an exact, uniform, infinite-time solution.
Cumulative hazard function Created 2026-09-24 Updated 2026-10-14
Suppose has an absolutely continuous probability distribution, with survival function . On an interval where , its cumulative hazard isHere is the hazard function; its integral is dimensionless because the units of rate and time cancel. The identity follows by integrating the derivative of , so mere continuity of the survival function is not enough: the absolute continuity assumption supplies a probability density function. If reaches zero, interpret as . The normalization also matters; an initial probability mass at zero would require an initial term .
Accumulating hazard functions adds on the scale and multiplies survival factors on the scale. For and ,For instance, a cumulative hazard increment of gives event probability , rather than a probability of . With per year, and . With the increasing hazard function per year when is expressed in years, , so gives . Its coefficient has units of inverse years squared.
The constant hazard function produces an exponential distribution; the increasing example is a Weibull distribution. Their survival functions both decrease, although one hazard function stays constant and the other increases. At year ten both have and despite different earlier histories. The accumulation identity is described in Lu Tian's Stanford notes, Section 1.1.
For a discrete hazard at each possible event time , the exact counterpart is . Taking its negative logarithm sums , rather than . Therefore exponentiating a Nelson–Aalen estimator does not give exactly the Kaplan–Meier estimator; small-jump comparison of cumulative hazard estimators quantifies the difference.
Curvature of a plane curve Created 2026-10-03 Updated 2026-10-14
For a twice continuously differentiable regular curve in the plane, unsigned curvature is the absolute value of its signed curvature:The nonvanishing velocity vector makes the denominator positive. For a graph of a function , this reduces to ; omitting the absolute value gives the signed curvature of a plane graph for increasing .
For the parabola , the derivatives are and . ThereforeThe curvature is greatest at the vertex , where and the radius of curvature is . At the curvature is , so the parabola bends less sharply despite its larger speed .
Its unit tangent vector and left unit normal areSince , is also its principal normal vector. At the osculating circle consequently has center and equationThe lower branch has value , derivative , and second derivative at , matching the parabola through second order. Away from the vertex the two curves separate: an osculating circle describes a local bend, not the whole curve.
Vanishing curvature at one point does not imply a straight segment. The graph of a function has signed curvature , which vanishes at its inflection point and changes sign across it. By contrast, if curvature vanishes throughout a connected regular interval, throughout that interval: the constant unit tangent vector forces the image to lie on a straight line.
Curvature sign convention 2026-10-14
Definitions of the Riemann curvature tensor can differ by an overall sign, independent of the metric signature. Reversing that definition reverses the Ricci tensor, Ricci scalar and Einstein tensor, as well as the curvature side of the geodesic deviation identity and the Palatini identity. A derivation must choose the contraction and derivative ordering explicitly before combining formulas from different conventions. Changing a metric signature alone is a separate operation.
Damping 2026-10-14
Damping dissipates the energy of an oscillation, reducing its amplitude. A linearly damped string applies this mechanism to each normal mode.
Why can stronger damping make a return to equilibrium slower? A weak brake lets a spring exchange potential energy with kinetic energy many times; a very strong brake makes the final motion creep. Critical damping marks the boundary between these behaviours. The distinction depends on the force law: the classification below concerns a single damped harmonic oscillator with viscous damping, rather than every mechanism that removes energy.
Let be displacement from equilibrium, the moving mass, the spring constant, and the constant coefficient of viscous damping. With no driving force, Newton's second law givesThe two initial conditions specify displacement and velocity. Define the undamped eigenfrequency as an angular frequency and the damping ratio as . The ordinary differential equation becomes . A constant weight in a vertical spring merely shifts equilibrium; it is already absorbed in the definition of .[ref]
For example, the ideal parameters and give and critical damping at . Values give damping ratios , respectively. These are model choices, not measured values. For release from rest with , set and ; then , where primes now denote derivatives with respect to .
Ideal viscous oscillator responses: release from rest in three damping regimes, and the effect of initial velocity at critical damping
. Details. The left panel uses identical initial conditions , . Underdamping produces repeated crossings of equilibrium; critical damping and overdamping give positive decreasing responses. The right panel keeps critical damping but changes initial velocity: gives one crossing, although there is no oscillation. Both panels are exact model predictions.
De Boor–Fix spline coefficient functional 2026-10-14
This linear functional extracts one coefficient of a B-spline expansion using local polynomial data. With and a point inside a knot cell in the support, it is . The local polynomial identity for the Marsden dual functional gives the desired coefficient. Its bounded restriction to the local spline space can be extended to continuous data on by the Hahn-Banach theorem, with the same bound. Such extensions supply spline quasi-interpolation coefficients without requiring derivatives of the data.
De Casteljau's algorithm 2026-10-14
De Casteljau's algorithm evaluates a Bézier curve by repeated linear interpolation between neighboring control points. Fix , start with , and computeEach new row has one fewer point. The final point is . Use the same at every stage: it describes the fraction of each line segment traversed from its first endpoint toward its second. A cubic Bézier curve needs three levels containing , , and linear interpolations, respectively.[ref]
https://graphics.stanford.edu/courses/cs164-10-spring/Handouts/handout19.pdf. Stanford CS348a, Handout 19, §2.3, pp. 10–11
For the Bézier curve with control points , , , , evaluation at takes the midpoint of every neighboring pair. The first level givesThe second level givesand the third level givesThe intermediate control polygons shrink toward the evaluated point. Each step is a convex combination, giving a geometric explanation of the convex hull property; every step also commutes with an affine map.
Cubic Bézier curve, its convex hull and bounding box, and the three levels of De Casteljau's algorithm at t = 1/2
. Details. The same construction splits the Bézier curve exactly, with no approximation. The outer edges of the triangular array give the new control points: for a cubic, specify the left piece and specify the right piece.[ref]
https://graphics.stanford.edu/courses/cs164-10-spring/Handouts/handout19.pdf. Stanford CS348a, Handout 19, §2.3, p. 11, subsegment control points
At these two lists areWrite and for the Bézier curves defined by these lists, each with its own parameter . ThenTheir images reproduce the original curve, while their derivatives account for the shorter parameter intervals. At the join,The chain rule gives ; in the original parameter, both pieces have derivative . This is the interval scaling in the parametric first-derivative join of Bézier curves.Exact midpoint subdivision with two smaller control polygons, endpoint tangent directions, and equally spaced parameter samples
. Details. Repeated midpoint splitting is useful for drawing vector graphics paths: each piece has a smaller control polygon and its own convex hull enclosure. A renderer can refine pieces until they are sufficiently close to line segments at the chosen display scale. Evaluating and splitting it are thus two results of the same short algorithm.
For a proof outline, expanding the recursion givesPascal's identity proves this by induction; at , it is precisely the Bernstein basis formula for the Bézier curve. The geometric construction remains useful even when expanding the polynomial by hand would be cumbersome.
// Target: analysis.bigb
This initial value problem uses a square root and absolute value to define a continuous function on all of . For every finite waiting time , a forward solution of a differential equation on isThe constant solution of a differential equation is another choice. For example, at , waits give values . These are dimensionless mathematical trajectories; no measured physical waiting time is being supplied.
Verification uses the original ordinary differential equation, including the join. Before departure, both and vanish. For , their common value is . For , the difference quotient at the join isThus the derivative exists at , equals the rate law there, and is continuous across the join. For the same computation gives the right derivative at the starting endpoint. For , the left and right second derivatives at departure are and : these forward solutions of a differential equation are continuously differentiable functions, without being twice differentiable at departure. The local two-sided statement of the Peano existence theorem is separate from this explicitly forward family.
The rate law tends to zero as , but its secant slopes from zero are unbounded:No finite local Lipschitz constant exists at zero. At the quotient is , even though the rates are shrinking to zero. Continuity controls the rate itself; Lipschitz continuity would control its change relative to the state displacement.
There is also a numerical lesson. The Forward Euler method starting exactly at zero gives at every step. It reproduces the constant solution of a differential equation for every positive step size, while the moving trajectories remain equally valid. A computation producing one trajectory cannot establish uniqueness. Likewise, the separable differential equation calculation that divides by only describes the moving pieces: checking the original equation recovers the zero pieces and their joins.










