Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
An adrenergic receptor is a G protein-coupled receptor responsive to catecholamine signals such as adrenaline and noradrenaline. The alpha and beta receptor families differ in coupling and physiological effects. Response depends on receptor subtype, tissue expression and downstream machinery, so the same hormone can produce different effects in different organs. Receptor activation and ligand binding remain distinct measurable events. [ref]
For functions and taking values in the same field, their quotient of functions is defined by on the common domain of a function restricted to points where . Thus and on the real line give a quotient of functions defined only for .
A function output is the value assigned by a function to a function input . It belongs to the codomain ; all such function outputs together form the image of a function .
A function input to a function is an element of its domain of a function , also called its argument. The corresponding function output is .
Function evaluation determines the function output for a specified function input in the domain of a function. Numerical integration uses these values at selected quadrature nodes.
The NIST validation report used carbonyl sulfide in argon to illustrate the readout. A pulsed nozzle injected a molecular beam along a two-mirror cavity. Approximately excitation prepared quantum coherence; a receiver digitized the decaying electric field, then a Fourier transform produced spectral lines. Counterpropagating cavity waves produced a Doppler shift doublet; its midpoint represents one rest-frame transition.[ref]
The Validation of Fourier-Transform Microwave Spectroscopy for Trace-Gas Analysis. The Validation of Fourier-Transform Microwave Spectroscopy for Trace-Gas Analysis, printed pp. 25–26, Figures 2–3: coaxial apparatus, excitation and OCS readout; PDF pages 31–32
Original functional schematic of the NIST trace-gas FTMW validation experiment
. An original arrangement of the documented sample, cavity, excitation and readout functions; no published figure is copied. The frequency-reference branch summarizes the later portable electronics described in the NIST historical account. The sample fraction is a reported preparation, not a synthetic measured spectrum. Details.The portable electronics used a common microwave source and a offset derived from a reference. Cavity tuning selects the accessible band; it does not independently calibrate the line's frequency. Absolute accuracy also requires a characterized reference and receiver offset.[ref]
Evolution of Microwave Spectroscopy at the National Bureau of Standards (NBS) and the National Institute of Standards and Technology (NIST) by F. J. Lovas and others. §5, printed pp. 282–283, Figure 20: source splitting, frequency reference, single-sideband modulation, mixer and digitizer
Reported controls included nozzle off/on, carrier-gas changes, and a blind nitrogen mixture. Assigned components were correctly identified. Single-component standards supplied preliminary concentration calibration; one standard per quantified component left response validation incomplete. Condensation and departure from thermal equilibrium in the nozzle were acknowledged limitations.[ref]
The Validation of Fourier-Transform Microwave Spectroscopy for Trace-Gas Analysis. printed pp. 26–27: nozzle/carrier comparison in Figure 6, blind mixture in Table II, one-standard calibration and nozzle-expansion limitations
The lesson is that rotational spectral line assignment and concentration inference answer different questions. Reproducible frequencies support molecular identity; converting signal size into concentration requires calibrated response under the same transfer and excitation conditions. The thermal absorption example above does not model a nozzle's nonequilibrium populations or the cavity's pulsed response.
A quantifier binds a free variable in a first-order formula and specifies how its truth depends on elements of a first-order structure: universal quantification requires every element, while existential quantification requires at least one.
Adding an optimization constraint removes possibilities: if it permits a set , the new feasible region is . It can leave unchanged when all its members already satisfy the added restriction. For a fixed objective function, restricting the feasible set cannot lower a minimization problem's infimum. In the equality slice of a feasible triangle, it raises the attained value from to .
Instead add to the feasible triangle with a squared-distance objective. No point can have both and . The resulting feasible set is the empty set, so there is no feasible point and no optimizing decision. Under the extended-value convention for a minimization problem, its infimum is .[ref]
A nonempty feasible set can also lack an optimizing decision. With domain , minimize subject to the strict inequality . The feasible region is an open set. Its infimum is , approached by the feasible points , but is excluded. Every feasible point is beaten by , so no minimum is attained. Replacing by includes the missing optimum. Open feasible regions do not always prevent attainment: minimizing on the same open set attains value at . A useful sufficient condition is instead the extreme value theorem: a continuous objective function on a nonempty compact set attains its minimum.
Keep the feasible triangle with a squared-distance objective, but add the equation . An equality requires an exact relation, whereas an inequality allows a range. Here the equality selects a line, and intersecting that line with the original feasible region leaves just the line segment from to :The lower bound comes from ; the upper bound comes from . This is a nonempty closed set even though it has empty interior in the plane. An equality can reduce the dimension of the allowed decisions without making the feasible region empty.
The old optimum violates the added equality. On the surviving line segment, the objective function isThe derivative shows that the unique global minimum is at , giving and value . The nearest point on the entire equality line would be , at with value , but it violates . Both the equality and the original inequalities must hold simultaneously.
Equality slice of a feasible triangle: the allowed line segment ends at the optimum (2,1), while the nearest point on the entire line is infeasible
. Details. Use and to fix the multiplier sign convention in the optimization Lagrangian ; the Lagrange multipliers of and are again zero. At , Karush-Kuhn-Tucker conditions hold with and :The Lagrange multiplier of an equality has no nonnegativity restriction. For an independent global certificate, completing the square gives . On the feasible set, and , so , with equality exactly at .
Feasible triangle with a squared-distance objective by
Codex 0 Created 2026-10-14 Updated 2026-10-31
Take the decision domain and minimize the objective functionEach inequality permits a closed half-space; their intersection is the filled triangle with vertices , and , including its edges. The feasible region is a compact set and a convex set. The point is a feasible point, but its objective function value will not be best. Without the optimization constraints, the unique global minimum is at with value . That point is infeasible because .
The objective function is the squared Euclidean distance from . Its positive level sets are circles centered there. Expanding a circle from that center, the first contact with the feasible region is at , with objective function value . Thus the optimum is the Euclidean projection onto a convex set of the target . Squaring a nonnegative Euclidean distance preserves which point is nearest.[ref]
Convex Optimization by Stephen Boyd and Lieven Vandenberghe. §8.1.1, printed p. 398: squared Euclidean projection onto a polyhedron and half-space projection formula
Feasible triangle with a squared-distance objective: the first attainable level set has value 0.5 at (1.5,1.5)
. Details. Here is a direct certificate, without relying on the picture. Put and . The objective function becomesEquality requires and , so the unique optimum is . At this point is an active constraint, while and are strict. An active constraint identifies a tight restriction at a specified point; it alone does not establish optimality. For example, has the same tight sum restriction but objective function value .
For a check using the Karush-Kuhn-Tucker conditions, write the inequalities as , , . Their Lagrange multipliers at the optimum are . The gradient equation isFeasibility, nonnegative Lagrange multipliers and complementary slackness also hold. With this strictly convex function and affine optimization constraints, the Karush-Kuhn-Tucker conditions certify the unique global minimum.[ref]
Convex Optimization by Stephen Boyd and Lieven Vandenberghe. §5.5.3, printed pp. 243–244, equation (5.49) and sufficiency for convex problems
An actual teaching experiment in LM-0300 Fabry Perot Spectrum Analyser by Walter Luhs, §§3.1.1–3.1.2, prepares a green laser beam by aligning it near and far along a rail, then centring back-reflected light from adjustable curved mirrors. An actuator using piezoelectricity moves one mirror. A screen first displays interference fringes; a focusing optical lens and photodiode then replace the viewing arrangement. The oscilloscope records the photodiode signal and the piezo drive reference on separate channels, using the latter as its trigger. Alignment and mirror separation are adjusted to suppress extra transverse normal modes; source temperature and drive electric current are controlled. Repeated peaks calibrate the scan using the appropriate free spectral range, and their spacing divided by their full width at half maximum estimates finesse.[ref]
This experiment uses a confocal curved-mirror cavity, whose repeated peak families can have spacing in air; it must not be calibrated blindly with the parallel-mirror . Extra transverse normal modes can mimic source features. A finite measured peak width bounds source sharpness only after instrumental broadening is considered; it does not determine the source's intrinsic width by itself.[ref]
LM-0300 Fabry Perot Spectrum Analyser by Walter Luhs. §3.1.2 p. 20: transverse modes, confocal calibration and source-linewidth inference
For an independent ideal scan calculation, hold a narrow laser wavelength fixed and vary the parallel-mirror gap at normal incidence. Advancing one resonance order requires . If changes uniformly over the measured interval, the time between repeated peaks divided by their full width at half maximum in time equals finesse. The cancellation of scan rate follows from : both peak spacing and peak width are divided by the same . It fails if the scan rate changes appreciably over that interval. A practical control in the University of Washington's motor-driven flat-mirror experiment is to check that successive peaks are equally spaced before using the time axis this way; its handout also warns that table strain and aggressive low-pass filtering alter the trace.[ref]
A Fabry–Pérot etalon fixes mirror separation in a Fabry–Pérot interferometer, selecting wavelengths through its transmission resonances.[ref]
The finesse of a Fabry–Pérot interferometer is its free spectral range divided by a transmission peak's full width at half maximum. Large finesse means a narrow accepted frequency interval compared with the spacing between repeated orders. Here half maximum means of the ideal unit peak, with zero detector background subtracted; it does not mean halfway between the transmission minimum and maximum.
Write for the coefficient multiplying in Fabry–Pérot transmission from multiple reflections. This coefficient is sometimes called the coefficient of finesse; it is not the finesse . About a resonance , put . Solving givesand, since one free spectral range advances the wave phase by ,These are exact for the ideal nondispersive model with constant and linear frequency dependence of . The inverse sine requires , or . At equality, neighbouring peaks merely touch half maximum at their shared minima: the nominal width is one full free spectral range and . Isolated half-maximum peaks require the strict inequality. Below this threshold the transmission never falls to , so this peak-width definition supplies no finesse; at the transmission is flat.
For large reflectivity, the small-angle approximation givesThis is a high-reflectivity approximation, not an identity for every . The original dimensionless examples below have exact full width at half maximum values obtained from the inverse sine formula.
Increasing mirror reflectivity narrows Fabry–Pérot interferometer transmission peaks
. Original stipulated dimensionless model for , with and modulo . All curves peak at unity and repeat after . The second panel enlarges the central resonance; coloured segments at mark each exact full width at half maximum. The inset compares exact finesse with the high-reflectivity approximation. These are calculations, not measured scans. Details.The beauty of the narrowing is visible directly in the geometric series: large preserves contributions from many round trips, so a small phase difference accumulates across many terms and spoils their addition. For the stipulated vacuum gap, gives an ideal full width at half maximum of about . This instrumental width is not a measured spectral line width. A real scan also depends on the source profile, accepted angles, mirror shape, alignment, and scan stability. The University of Washington handout separately discusses mirror-reflectivity, mirror-flatness, and detector-pinhole contributions; increasing alone cannot remove the others.[ref]
Fabry-Perot Interferometer, University of Washington Physics 331. Finesse discussion, equations (5)–(8), and §2.3 Determine the Finesse
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









