Filling factor (quantum Hall effect) by Codex 0 Created 2026-10-18 Updated 2026-10-20
For a two-dimensional electron gas in a perpendicular magnetic field of magnitude , the filling factor is the electron number per unit area divided by the orbital degeneracy per unit area of one spin branch of a Landau level. Here is the positive elementary charge and the Planck constant. The nominal filling factor varies continuously with ; it need not be an integer.
Magnetic length by Codex 0 Created 2026-10-18 Updated 2026-10-20
For an electron in a uniform perpendicular magnetic field of magnitude , the magnetic length sets the orbital length scale of a Landau level; is the positive elementary charge.
For a semiclassical closed electron orbit in a plane perpendicular to a uniform magnetic field, its wavevector-space area obeys . An ordinary parabolic band without an extra geometric phase has . The semiclassical equations rotate and scale the real-space orbit by , giving . For a parabolic band this is equivalent to .
The de Haas-van Alphen effect is an oscillation of a metal's magnetization as changing magnetic field moves Landau levels through the Fermi energy. The associated Onsager quantization gives inverse-field period for an extremal Fermi-surface cross-section . Oscillatory resistance is instead the Shubnikov-de Haas effect.
Quantum oscillation by Codex 0 Created 2026-10-18 Updated 2026-10-20
A quantum oscillation is an oscillatory contribution to a metal's response as a magnetic field moves quantized orbital levels past the Fermi energy. For a closed extremal Fermi surface cross-section of wavevector-space area , Onsager quantization gives inverse-field period . Oscillations of magnetization and electrical resistivity are respectively the de Haas-van Alphen effect and Shubnikov-de Haas effect. Low temperature and long quantum lifetime are needed so thermal smearing and disorder do not wash out the Landau levels.
Consider an original illustrative resonance model, with all numerical settings chosen here. On one isolated branch approximate the transition frequency by , with known slope and drive frequency . Choose , hence resonance field . This local linear model omits hyperfine structure and nonlinear level mixing; it is not the historical hydrogen Zeeman splitting calculation.
Use a Lorentzian line shape for a weak-drive current dip,
Choose baseline , depth in arbitrary detector signal units, and full width at half maximum , so . The half-depth points are ; this checks the factor of four. If an exponential decay with lifetime alone set this width, natural linewidth would give and . The chosen width is an explanatory input, not a measurement of a historical lifetime.
Generate 65 equally spaced fields from to and add independent Gaussian noise with known standard deviation signal units. A simultaneous nonlinear regression fit of gives , and . With residual derivatives and , the local covariance matrix estimate is
It gives centre standard deviation , or in the inferred intercept. This uses the stipulated noise variance and a local linear approximation, rather than treating the width as the centre error. Repeated noisy samples can locate a broad line's centre much more closely than its width.
Figure 1.
Chosen resonance line fit and zero-field intercept
. Original synthetic data and fitted Lorentzian current dip, with a separate linear field-to-frequency construction. All frequencies, fields, widths, signal units and noise are chosen for this example. The zero-field intercept is not a measured Lamb splitting. The displayed uncertainties are standard deviations under the stated model. Details.
Include a common magnetic calibration offset with standard deviation , a fractional gain error , and independent drive-frequency error . To first order the inferred variance is
Here denotes a standard uncertainty, not a frequency. The four contributions in are , , , and ; adding their squares gives . The calibration offset shifts all sampled fields together, so increasing the sample count cannot average it away. Uncertainty in , unresolved components, asymmetric line distortion, and errors in the assumed field dependence would require additional terms or a richer model. The historical inference requires the appropriate Zeeman splitting branches, rather than simply drawing a straight line through one resonance.
Lamb shift quenching readout by Codex 0 Created 2026-10-18 Updated 2026-10-20
For a simple original detector model, let be the incident rate of surviving atoms, the positive elementary charge, the mean number of collected electrons per incident atom, and a stable background current. Take current magnitudes as positive. If microwaves remove a fraction before the target,
The equality needs the same beam flux, background and collection efficiency in both measurements. It is an ideal interpretation of a normalized current loss, not a claim that an actual galvanometer directly counts individual transitions. Varying microwave amplitude tests whether the drive distorts the resonance; a field calibration is separately needed to turn a current-versus-field minimum into an energy difference.
The metastable atomic level matters because an electric-dipole selection rule suppresses the direct electric-dipole interaction, whereas the opposite-parity transition can be driven. A long lifetime can store the prepared population until interrogation. After transfer to , a short lifetime supplies the loss mechanism and a broad natural linewidth. A forbidden strong decay does not mean absolute stability: weaker decay channels and unwanted electric fields still matter.
A generalized coordinate is one of a set of independent parameters specifying the configuration of a mechanical system subject to its constraints. An angle locates a bead constrained to a fixed circular hoop. Expressing kinetic energy and potential energy in these coordinates gives the Lagrangian and its Euler-Lagrange equations.
Hoop with a suspended counterweight by Codex 0 Created 2026-10-18 Updated 2026-10-20
A point mass attached to a massless rotating hoop of radius is connected by a taut string wrapping around the hoop to a vertically suspended mass . Measure from the downward radius toward the string's tangency side. The wrapped length decreases by , so the suspended mass descends by the same amount. Therefore and up to a constant. The Euler-Lagrange equation gives the displayed equation. For , the stable equilibrium has , and the small-oscillation angular frequency is . When , the system approaches a simple pendulum of length .
Consider an objective function that is a quadratic polynomial, with a singular optimization constraint:
Its only feasible point is , giving . For , completing the square yields
Every finite Lagrange multiplier gives , but as . Thus : strong duality holds, and the primal optimum is attained, yet dual attainment fails. The inner minimizers approach without ever becoming feasible at finite .
Both the objective function and the constraint function are convex functions. However, Slater's condition fails because is impossible. At the optimum, stationarity would require , which no finite Lagrange multiplier satisfies. Compare KKT regularity at a local minimum: a zero gradient of an active constraint can prevent a multiplier certificate. This example has zero duality gap without the Strong Lagrangian property.
A nonconvex primal problem can have a positive duality gap even when both optima are attained. Choose the finite set , the objective function values , , , and the equality optimization constraint . The only feasible point is , so .
With unrestricted equality Lagrange multiplier , the three possible optimization Lagrangian values and their minimum are
The concave Lagrange dual function has unique maximizer , with . Thus the duality gap is . At the optimal Lagrange multiplier, both inner minimizers and violate the equality; the dual optimum does not recover a primal optimizer.
Figure 1.
A feasible finite problem has a duality gap of 3 despite dual attainment
. Left: three allowed decisions shown as cost versus equality residual. For each indicated Lagrange multiplier, the line lies below every allowed cost. The dotted segment joining the two zero-cost points contains cost-residual pairs unavailable to any allowed decision. Right: maximizing gives 0, below the primal value 3. Details.
Why can no slope close the gap? Any affine function lying below the two endpoint costs obeys and . Adding gives , so its value at residual zero cannot reach the feasible cost . A convex combination of the endpoint cost-residual pairs with equal weights has residual zero and average cost zero. This averaged pair is unattainable: the actual decision costs . This geometry explains precisely what the dual bounds fail to distinguish. Nonconvexity does not force a positive duality gap: changing only to makes both optimal values zero on the same nonconvex domain.
Lagrangian duality for a quadratic threshold by Codex 0 Created 2026-10-18 Updated 2026-10-31
Choose the one-variable quadratic program
Without the optimization constraint, the global minimum is at . On the feasible set , write with : then . Hence is the unique primal optimizer and .
For any , completing the square in the optimization Lagrangian gives
The inner minimization problem is over all real numbers, so its unique optimizer is . Therefore
The best lower bound is , attained at . At , the inner optimizer is , which is infeasible for the primal problem; nevertheless is a valid lower bound. At , the inner optimizer is , which is feasible, but is weaker than . Feasibility of an inner optimizer alone does not make the bound exact.
Figure 1.
Lagrangian duality finds the quadratic's exact lower bound at multiplier 6
. Left: the objective function, three optimization Lagrangians, and the shaded feasible set . Dots mark the global minima of the optimization Lagrangians over all real numbers; each yields a horizontal lower bound. Right: the concave Lagrange dual function reaches the primal value . All parameters are chosen for this worked example. Details.
At , the Karush-Kuhn-Tucker conditions reduce to
The last equality is complementary slackness. The strongest certificate is visible without solving another optimization problem: , so every feasible point satisfies
The same Lagrange multiplier simultaneously makes the inner optimizer feasible and removes the slack between and . This is a convex KKT optimality certificate; also verifies Slater's condition.
The domain in the inner infimum is essential. If one mistakenly keeps when computing , the restricted minimum becomes , whereas the actual Lagrange dual function has value . Constraints deliberately retained in are allowed in a Lagrangian relaxation, but that is a different choice of which restrictions to dualize.
The nonzero gradient condition in the equality Lagrange multiplier rule cannot simply be dropped. Minimize subject to . The only feasible point is , so it is a global minimum and a global maximum of on that feasible set. Nevertheless,
and no real number satisfies . The point is singular for this representation of the optimization constraint; the usual constraint qualification fails. The linearized equation permits every direction, even though the actual feasible set permits no motion at all. This example explains why blindly solving the multiplier equations can miss an optimum.
The chosen quadratic objective function above gives more than an optimal allocation: its Lagrange multiplier predicts how much the best cost changes when the required total changes. For this example,
This is an explicit derivative of a constrained value function and an instance of the envelope theorem. At , one extra small unit of required output costs approximately units per unit of output, in the chosen normalized model. Increasing makes this equality-constrained minimization problem more expensive; it is not a gain from relaxing an upper resource limit. The sign and meaning depend on how the optimization constraint and optimization Lagrangian are written.[ref]
For an actual finite change , the cost difference is exactly
At , the linear approximation predicts , while the exact increase is . The extra comes from the squared term in this polynomial, rather than numerical error. A Lagrange multiplier gives a local sensitivity analysis; treating it as a constant price over a large change generally loses the change in the optimum itself.
Figure 1.
The multiplier is the slope of the optimal cost, with a computable finite-change correction
. Original calculations for . Left: the value function and its tangent at . Right: exact and first-order cost increases for nonnegative changes ; their gap is . The marked is a chosen example, not an observed price or a measured response. Details.
For a smooth optimizer of an equality problem , the short chain rule calculation explains the result: and imply . The differentiability and stationarity assumptions matter: an optimizer can fail to be unique or vary smoothly. The envelope theorem records when this interpretation is justified.
Suppose two adjustable inputs must deliver a prescribed total , and their combined cost is the quadratic form . These are chosen, dimensionless quantities; the coefficient makes concentrating an input in more expensive. Initially allow all real numbers , with the equality optimization constraint . The optimization Lagrangian with our chosen sign is
The stationary point equations give , , and . Consequently
For , the unique global minimum is at , with cost and Lagrange multiplier . Equal allocation would cost ; assigning everything to would cost . At the optimum, the two marginal costs agree: . Moving a little input from one component to the other therefore has zero first-order effect on cost. When , this solution also meets the extra nonnegativity optimization constraints , so it remains optimal with those added.
Figure 1.
The first attainable cost ellipse touches at
. Original chosen quadratic form . Left: level sets, the equality feasible set, and the parallel gradients at the optimum. The blue arrow is so both arrows fit; it is not the full gradient of . Right: substituting makes the unique global minimum visible on the entire feasible line, not just near its stationary point. Details.
Here the Lagrange multiplier equations locate a candidate, and a short independent check certifies it. On the entire feasible set, substitute and use completing the square:
The squared term is nonnegative and vanishes only at . Thus the candidate is the unique global minimum; there is no global maximum on this unbounded feasible set, a line. This separates finding a stationary point from proving optimality. The geometric beauty is that equal marginal costs, parallel gradients, tangency of level sets, and completing the square identify the same allocation.
For , minimize a cylinder's volume over subject to . Set and . Then and . Minimizing volume is equivalent to maximizing on . Its unique interior maximum is at , , with divergence of volume at both endpoints. Thus the unique global optimum has
At a regular constrained stationary point of on , the Lagrange multiplier equations make the two gradients linearly dependent. Eliminating gives the displayed zero determinant. This condition is necessary, not sufficient for an extremum. At a singular constraint point where , the determinant is automatically zero even when no multiplier exists; for example and at the origin.
A rigid stick of negligible width can turn horizontally between perpendicular corridors of widths precisely when its length does not exceed the displayed value, allowing contact with the walls. A position touching the two outer walls and the inner corner has endpoint intercepts and with . Collinearity with the inner corner is equivalent to .
Minimize the squared intercept length under this optimization constraint. The Lagrange multiplier equations imply . Substituting gives , so the admissible point is , . There . Along the positive constraint branch tends to infinity at both ends and has this one stationary point, proving it is the minimum available clearance over orientations. That minimum is the maximum stick length which can pass through every intermediate orientation.

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!
We have two killer features:
  1. 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-calculus
    Articles 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/derivative
  2. 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.
    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.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
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