Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Let be nonzero real constants with . The real function displayed in the title has exactly one stationary point:Indeed the partial derivatives are , each of which has precisely one zero. The Hessian matrix at that point is .
If every , each summand is a strictly convex function tending to as its argument tends to either infinity. Consequently has a unique global minimum. If every , negating gives the preceding case, proving a unique global maximum. If both signs occur, restricting to two coordinate directions of opposite signs gives a saddle point of a scalar function. No degenerate Hessian matrix is possible under the nonzero assumptions.
The zero level set of is the union of the coordinate axes and the circle of radius . The gradient isIts nine stationary points are the origin, the four axis points at distance , and the four points with . The factored gradient proves completeness: a zero coordinate gives the five axis cases; two nonzero coordinates give a linear system in .
The Hessian matrix has diagonal entries and off-diagonal entries . At the origin its eigenvalues are ; at the four unit-direction axis points they are . These are saddle points of a scalar function. At the two interior points with equal coordinate signs, the eigenvalues are , giving strict local minima of value . Opposite coordinate signs give the negative eigenvalues and strict local maxima of value .
The stationary points of this polynomial are the origin and , . Its Hessian matrix at the origin has eigenvalues , so the origin is a saddle point. At each of the other points the eigenvalues are and , giving strict local minima. The identityshows that they are also the only global minima, with value .
For , the level set has two closed components, one surrounding each minimum. The zero level set has two lobes meeting at the origin with the coordinate axes as tangent directions. For , there is one closed outer component. These statements also follow in polar coordinates from the quadratic equation in , together with the absence of other stationary points.
Initialize a mutable endpoint array to the inclusive cumulative counts . Scan input array indices . For each complete sorting record with sort key , first decrement , then write at output array index . This is equivalent to writing at the old endpoint minus one and then decrementing the endpoint.[ref]
11.2 Counting Sort and Radix Sort. Open Data Structures: An Introduction by Pat Morin; §11.2.1 Counting Sort, final scan paragraph and stability paragraph after Theorem 11.7
In the worked example, the first input sorting record read is at array index six. Its endpoint changes from to , so the complete sorting record goes to . Next, changes from seven to six and goes to . Writing before the decrement at the old endpoint would put outside its reserved integer interval and try to put beyond the output array. All seven writes are:Each endpoint changes only when a sorting record with its own sort key is placed. Consequently, stays at five through the placements of before dropping to four for .
Here is a complete implementation under the stated input contract; each sorting record is a pair whose first component is its integer sort key:
def counting_sort_records(records, K):
end = [0] * K
output = [None] * len(records)
for key, data in records:
end[key] += 1
for key in range(1, K):
end[key] += end[key - 1]
for i in range(len(records) - 1, -1, -1):
key = records[i][0]
end[key] -= 1
output[end[key]] = records[i]
return outputThe same array
end successively stores frequencies, inclusive cumulative counts, and moving exclusive endpoints; the formulas describe their mathematical values without requiring three stored arrays. The write copies the complete sorting record, including its associated data. In particular, two occurrences of an identical pair still cause two separate writes.For a short algorithm correctness proof, let be the number of already placed sorting records with sort key . A loop invariant isAll integer intervals here mean output array indices. Initially , so each whole reserved integer interval is unfilled. When the next sorting record has sort key , fewer than such occurrences have been placed, giving . Decrementing selects a fresh slot inside its reserved integer interval. At termination, and : every output slot has been filled exactly once with a complete input occurrence. The disjoint, increasing sort key ranges establish sortedness, while the fresh-slot property establishes sorting permutation preservation.
For stable sorting, take two input occurrences with equal sort keys at array indices . The backward scan visits first and puts it farther right in their shared integer interval. When is visited, the endpoint has decreased at least once, so its output position is smaller. Thus their original order survives. A forward scan with this same decrement rule reverses every equal-sort key group: it would put at positions five, four, three. A forward scan can instead be stable if it starts from and fills each integer interval left to right, incrementing after each write. The scan direction and endpoint convention must agree.
Count initialization takes writes, output initialization takes writes, counting takes updates, the prefix sum pass takes updates, and placement takes writes. Hence time complexity and auxiliary storage are in Big O notation, assuming constant-cost sort key access, integer arithmetic, array indexing and complete sorting record movement. Large records can instead be represented by constant-size references.[ref]
11.2 Counting Sort and Radix Sort. Open Data Structures: An Introduction by Pat Morin; §11.2.1 Counting Sort, auxiliary counter and output arrays, loop-cost discussion and Theorem 11.7
For example, three sorting records with sort keys zero, and zero require one million counters if ; unused sort keys still incur initialization and prefix sum work. The bound is therefore linear in the input length only when . Empty input skips the record scans, but this implementation still initializes counters and accumulates their prefix sums. For nonempty input, counting all records and filling their ranges gives a concrete termination argument.
Direct sort key indexing is a different operation from a binary comparison. The comparison sorting lower bound concerns comparison sorts; counting sort uses its restricted integer sort keys as array indices. Its small- speed is particularly useful for categorical numerical labels and for each stable sorting pass of radix sort: the reserved integer intervals turn group sizes into exact destinations.
For sorting records with integer sort keys in , where , let count the input occurrences of sort key . Define two prefix sums:The empty sum gives . Here are counts of sorting records. Exactly sorting records have smaller sort keys, so the output positions for sort key form the half-open integer intervalIts right endpoint is excluded: the last occupied array index is when .[ref]
11.2 Counting Sort and Radix Sort. Open Data Structures: An Introduction by Pat Morin; §11.2.1 Counting Sort, paragraphs after Figure 11.7: running sums count keys at most k and determine the output block
For the seven-sorting record example, the frequency array, inclusive cumulative count array, and start array areThus sort keys zero, one, two and three occupy the integer intervals , , and , respectively. In particular, the three sorting records with sort key two belong at array indices three, four and five. The inclusive cumulative count counts all six sorting records with sort keys at most two; six is the exclusive endpoint, not the final position of a sorting record with sort key two.
These integer intervals fit together because for , and . Their lengths add to , so they partition all output positions without overlaps or gaps. An absent sort key contributes an empty integer interval: with frequencies , the endpoints are and sort key two has range . For empty input, every count and endpoint is zero; every reserved integer interval is empty. This makes the same formulas cover missing sort keys and the empty case.
The Cosmic Background Explorer connected two questions: does the cosmic microwave background follow a Planck spectrum, and how does its temperature vary across the sky? John C. Mather and George F. Smoot shared the 2006 Nobel Prize in Physics for these discoveries.[ref]
George F. Smoot – Facts by Nobel Prize Outreach. 2006 award and discovery summary
The FIRAS and COBE DMR comparisons below explain why measuring spectral shape and measuring angular structure require different information.In 1965, Arno Penzias and Robert Woodrow Wilson reported measurements with a 20-foot horn-reflector antenna at . They manually switched a traveling-wave maser receiver between the horn and a helium-cooled reference. From zenith antenna temperature, atmospheric and antenna/ground contributions left an excess .[ref]
A Measurement of Excess Antenna Temperature at 4080 Mc per Second by Arno Allan Penzias and Robert Woodrow Wilson. pp.419–420: apparatus, temperature contributions and residual
Elevation scans estimated the atmospheric term. Taping horn seams produced no measurable change; a nearby transmitter tested ground response. These controls addressed distinct possible contaminations.[ref]
The comparison does not make all nuisance contributions disappear. A reference can establish a response scale, but atmospheric emission and pickup through unwanted antenna directions are also real incident radiation. In his later account, Robert Woodrow Wilson describes these competing contributions as central to a radio astronomy measurement.[ref]
The Cosmic Microwave Background Radiation by Robert Woodrow Wilson. 1978 lecture, introduction and sectionII: sky, ground, atmosphere and instrument contributions
The Princeton group proposed primordial thermal radiation as an interpretation and called for more wavelength measurements. Their separate radiometer had not yet produced results.[ref]
Cosmic Black-Body Radiation by R. H. Dicke and others. pp.415–416: interpretation, Princeton apparatus and need for further wavelengths
A single-frequency excess therefore does not by itself establish a complete Planck spectrum. Reproducibility across independent instruments, observing directions and frequencies tests the interpretation further.For a convex set and , a supporting hyperplane has a nonzero normal vector such that for all . It touches while containing the set on one side.
A nonholonomic constraint is a nonintegrable restriction on allowed velocities: it cannot locally be replaced by relations among generalized coordinates and time. In contrast, a velocity equation with constant radii integrates to a holonomic constraint . Rolling without slipping is therefore not automatically nonholonomic: planar rolling on a prescribed curve can be holonomic, whereas rolling with additional directional freedoms can impose nonintegrable velocity constraints. Unwrapped angles may be needed to record the winding of a rolling trajectory.
In Arthur Holly Compton's A Quantum Theory of the Scattering of X-rays by Light Elements (1923), pp. 494–495 and Figure 4 compare X-rays from a molybdenum target with rays scattered by graphite at right angles. Slits select the rays; a calcite crystal analyzes their wavelengths by Bragg's law. The plotted readout is scattered wave intensity against the crystal's glancing angle, distinct from the fixed photon deflection. The primary-beam comparison uses the same slits, crystal, and tube potential. First-order diffraction lines on both sides establish angular zero. The displaced spectral line supports a longer outgoing wavelength and hence photon energy transfer. The two curves use different vertical scales, so their heights cannot directly compare absolute wave intensities. The paper postpones a fuller apparatus description; it also states on p. 496 that recoil electrons from ordinary X-rays had not been observed. Thus this spectral test infers recoil through the conservation model rather than directly tracking an electron.[ref]
A Quantum Theory of the Scattering of X-rays by Light Elements by Arthur Holly Compton. Compton, Physical Review 21 (1923), pp. 494–496, Experimental Test, Figure 4 and opening of Velocity of recoil of the scattering electrons
Inverse Compton scattering transfers energy from an energetic electron to a photon in a Compton scattering event. Transforming into the electron's rest frame blueshifts an approaching photon; scattering there and transforming back can produce a much more energetic outgoing photon.
For a head-on collision with an ultrarelativistic electron of Lorentz factor , the low-recoil limit gives an approximately forward maximum photon energy , where is the incident photon energy. This requires ; recoil limits the increase outside that regime.
A laboratory source overlaps a laser beam with an electron beam and selects scattered photons within an angular acceptance. Electron energy spread, beam divergence and collection angle affect the emitted bandwidth, so one photon-energy value does not characterize every collected event. [ref]
https://journals.aps.org/prab/abstract/10.1103/PhysRevAccelBeams.24.050701. Intense monochromatic photons above 100 keV from an inverse Compton source, 2021, source design and kinematic discussion
Choose the incident photon direction as and the plane of the collision as the plane, with the outgoing photon above the axis. The electron initially has zero momentum. Conservation of energy and momentum conservation, using the relativistic energy–momentum relation, giveSquaring the electron energy and the momentum magnitude in these two equations yieldsCancel common terms to obtain . Division by gives . Substitution of proves both Compton scattering formulas. Using the nonrelativistic approximation here would lose the exact relativistic result.
Let be the nonnegative electron recoil angle below the incident direction. For , the vector components above implyThis assumes exactly the same initially stationary free electron and single outgoing photon. At , the electron moves forward with ; at it stays at rest, so its recoil direction is undefined even though the limiting angle as is . At in the chosen example, and .
Bound-electron scattering without a Thomson frequency window by
Codex 0 Created 2026-10-18 Updated 2026-10-24
A classical Thomson scattering frequency window for a harmonically bound electron requires , with and recoil scale . There is no parametrically separated window if , equivalently . This is a scale comparison, not a prediction of a sharp transition between scattering mechanisms.
At that binding scale, an oscillator quantum has energy comparable with the electron rest energy. The nonrelativistic Lorentz oscillator model is then inadequate, so a physical cross-section requires a relativistic quantum description. Compton scattering itself does not switch on discontinuously at ; its recoil corrections become substantial near that scale and tend to the Thomson scattering limit at low photon energy for a free target.
Isothermal flow through molecular hydrogen formation by
Codex 0 Created 2026-10-18 Updated 2026-10-20
Across a thin steady transition with negligible external impulse, mass conservation and momentum conservation give the displayed relations. If the gas stays isothermal while neutral atomic hydrogen becomes molecular hydrogen, the mean particle mass doubles and for its isothermal sound speed. Let . The downstream subsonic branch has , , and .
For , the leading behavior is , and , at unchanged temperature. Radiation of the molecular binding energy prevents that released energy from necessarily heating the gas; it does not, by itself, establish an isothermal thermal closure. If temperature evolution is allowed, an energy balance and a cooling model are required to determine all four changes uniquely.
Let , and . The real and imaginary coordinates obey , a hyperbola. Put , which is strictly increasing. Then traces a horizontal line, and traces a parabola. Eliminating gives the displayed quadratic relation between real part and imaginary part. The value of fixes an orientation and determines which segment is traversed; the full real parabola is obtained as ranges over .
A phasor is a complex amplitude representing a sinusoid at one specified angular frequency: . Its modulus gives the peak amplitude and its complex argument gives the wave phase in this convention. Both may instead use root mean square magnitudes if that normalization is stated.
Excitation of an atomic nucleus by the electric field of a passing charged projectile. For suitable collision energies and separations, the electromagnetic interaction can populate collective states without requiring contact through the nuclear force. Electric quadrupole transition strengths connect excitation yields with collective charge motion; inferring a shape additionally assumes a nuclear model. Contributions from the nuclear force, competing transitions and the collision kinematics must be controlled before identifying a yield with a single quadrupole strength.
A collective oscillation of the quadrupole shape coordinates of an atomic nucleus. Near spherical equilibrium, the ideal harmonic description has five components, corresponding to the five magnetic substates of angular momentum two. Each quantum carries ; it is an excitation of the many-nucleon system rather than an extra constituent. Its frequency is , and its energy spacing follows the quantum harmonic oscillator.
One quantum produces a level at . Two identical quadrupole quanta can couple to in a symmetric state, giving a degenerate multiplet at in the ideal model. Odd total would be antisymmetric under their exchange. Thus the first to first excitation ratio is , rather than the nuclear rotational band value . Real nuclear quadrupole vibrations can be anharmonic and their multiplets split: the ratio is a diagnostic of a limiting model, not a universal classification rule.
Pinned article: Introduction to the OurBigBook Project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
Intro to OurBigBook
. Source. We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.Figure 1. Screenshot of the "Derivative" topic page. View it live at: ourbigbook.com/go/topic/derivativeVideo 2. OurBigBook Web topics demo. Source. - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.Figure 5. . You can also edit articles on the Web editor without installing anything locally. Video 3. Edit locally and publish demo. Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension. - Infinitely deep tables of contents:
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact









