Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
For , with period , half-wave rectification givesThe Fourier coefficients are , , , with all remaining coefficients zero. To derive the cosine coefficients, integrate over and use the product-to-sum identity. The sine coefficients follow from orthogonality. A half-period delay reverses only the fundamental sine term and leaves the constant and even-frequency cosine terms unchanged, by translation of a Fourier series.
Let and real . Extend with period . In the Fourier series convention , put . Direct integration givesFor example, the required antiderivatives are and . The Dirichlet-Jordan convergence theorem gives the exponential value away from the jumps and their midpoint at odd multiples of . For , the function is identically one, with and all other Fourier coefficients zero.
Let be nonzero real constants and let be a smooth periodic function of period , with real Fourier coefficients . Write the unknown periodic solution with Fourier coefficients . Fourier orthogonality applied to the equation givesSolving these two-by-two linear systems givesThe smooth forcing has rapidly decreasing Fourier coefficients, so the resulting series and its derivatives converge and satisfy the equation. Uniqueness follows because the difference of two solutions is , which is periodic only when . A single sinusoidal forcing therefore gives a single sinusoidal response with changed amplitude and phase.
Extend from with period . It is an even function, so all sine Fourier coefficients vanish. The product-to-sum identity givesIndeed, integrate on and use . ThusThe coefficients are , so the series converges absolutely and uniformly. The Dirichlet-Jordan convergence theorem identifies it with the periodic function everywhere, including the endpoints because the two endpoint values agree. Substituting a noninteger rational frequency and a convenient yields explicit series sums. Integer frequencies require taking removable limits rather than substituting into a zero denominator.
For a complex weakly stationary process with finite second moment and continuous uncentered autocorrelation , there is a unique finite positive spectral measure of a stationary random field. With the optical sign convention, write it asThe sign reverses the frequency coordinate relative to the alternative positive-exponential convention. To see the positivity behind the theorem, expand . This makes the correlation a positive-definite function, so Bochner's theorem supplies the measure.[ref]
245C, Notes 2: The Fourier transform by Terence Tao. Bochner theorem immediately before Exercise58; applied here to the positive-definite correlation function
An ordinary power spectral density exists when . If is integrable, . Stationarity alone does not guarantee such a density. For at every time and , the correlation is one and .
The normalized Lorentzian line shape gives . Its width therefore describes decay of temporal coherence. A persistent spectral line instead contributes an atom, which cannot be treated as an ordinary integrable density.
For this sign convention, cross-correlation compares a function with translated copies of another, conjugating the first factor. If , Fubini's theorem gives Fourier transform . Indeed, the substitution factors the double integral into and . The zero-lag value for is the squared L2 norm. Fourier inversion applied to this correlation proves the Parseval identity, first for Schwartz functions and then by density for L2 space.
The four-wavevector combines the angular frequency and spatial wavevector of a plane wave. Phase invariance gives . Under a boost , , and . For metric signature , is a Lorentz scalar. A vacuum light wave has .
Three-momentum is the spatial part of a particle's four-momentum, . Its components depend on the reference frame, while is a Lorentz invariant.
Compute , the triangular number , for a nonnegative integer . The empty sum gives zero when . Use exact mathematical integers and keep the input unchanged; every comparison and variable assignment is a terminating operation. The original sequential procedure isThe order of the two variable assignments matters: the addition uses the newly incremented . For , the pairs at successive condition checks are . At the last check, is false, and the returned sum is .
require n is an integer and n >= 0
i = 0
s = 0
while i < n:
i = i + 1
s = s + i
return sThe precondition is with , under the exact-arithmetic model just stated. The postcondition for returned value is , with still equal to its starting value. At each condition check use the loop invariantand the loop variant . The equation says that the accumulator is the triangular number for precisely the processed prefix ; the inequalities connect that prefix to the loop's condition.
The summation loop restores its invariant before each condition check
. Original sequential control flow for the summation loop verification. The blue loop head carries the loop invariant; the orange body increments before adding it to . A false condition leads to the postcondition. The loop variant decreases on the return arrow. All values are mathematical integers and remains unchanged. Details.Initialization gives , so holds, including when . For preservation, let the old values satisfy and . Write and for the values after both variable assignments. Since are integers, gives , andThus the completed body restores . Between the two variable assignments, the equation can be false; the loop invariant is required at the loop head. This preservation step is mathematical induction on the number of completed iterations.
At exit, the false condition gives , while gives . Hence , so : this proves partial correctness. For algorithm termination, gives the nonnegative integer . When the condition is true, ; the terminating body gives . Therefore the loop cannot repeat forever. Together these arguments prove total correctness for every permitted input, including .
Two changes expose what the proof checks. Swapping the two body instructions computes , returning rather than for . Leaving unchanged can preserve an initial equation forever without producing any answer. The first change breaks the intended postcondition; the second breaks algorithm termination. A trace can reveal these failures, while the two proof obligations explain them.
The exact-arithmetic assumption has a concrete boundary. In a stipulated unsigned eight-bit model where each addition wraps modulo , fits in the input representation, but its intended triangular number is . The stored accumulator instead finishes at , so the mathematical postcondition fails. This is integer overflow, and the proof above does not apply to that altered model. Restricting the same implementation to prevents overflow in its stored loop values, since ; alternatively use a representation supporting the required exact integer arithmetic. The equations in the proof are mathematical statements, not instructions to evaluate products in eight bits.
A force per unit length describes a distributed force on a filament and has units . For a charged filament with linear charge density and longitudinal current , the external Lorentz force is . Length, density and force must all refer to the same measurement frame. An infinite uniform filament generally has a finite force density but no finite total force.
An entropic force is the part of a generalized force arising from the dependence of entropy on a coordinate. At fixed temperature, the system's force is , where is the Helmholtz free energy. If the internal energy is independent of the coordinate, the force is entirely entropic. For an ideal chain whose configurations become less numerous on extension, it acts toward shorter extension. The external tension holding the chain extended has the opposite sign. Thus the force depends on the statistical number of available configurations, even when the energy of each configuration is unchanged.
A propulsive force exerted on a body by an engine or another momentum-transfer mechanism. In a vehicle moving through a fluid, its direction need not coincide with the vehicle's actual velocity, and a transverse component can steer the motion. The component along the velocity contributes mechanical power ; a purely transverse component changes direction without doing instantaneous work. Rocket thrust is one particular mechanism and includes momentum carried by expelled material.
For every , this recurrence relation converges to the unique nonnegative fixed point . If , then , since . If , then . Thus the iterates form a monotone bounded sequence, and continuity forces their limit to be . A cobweb plot alternates vertical steps to and horizontal steps to , approaching the same intersection from either side. More quantitatively,so the error keeps its sign and decreases in absolute value by at least the uniform factor . The asymptotic factor is .
For on and outside, the lowest bound state is even about , has no nodes, and has . Write and . The interior wavefunction is proportional to ; the exterior tails decay exponentially. Wavefunction matching at a finite potential step gives the displayed condition. Its lowest root has , so , the infinite square well ground state energy. As increases, the penetration length tends to zero and that limiting energy is approached from below.
A metal-oxide-semiconductor field-effect transistor, with an insulating layer separating the gate from the semiconductor. Its gate electric field controls the channel's mobile charge carriers; a semiconductor inversion layer can form a two-dimensional electron gas.
A junction field-effect transistor controls a conducting semiconductor channel using reverse-biased p-n junctions at its gate. Changing gate voltage changes the depletion region and therefore the cross-section available to mobile charge carriers. A depletion-mode n-channel device normally conducts at zero gate-source voltage and is depleted by a more negative gate. The small reverse gate electric current gives high input resistance, while a source-drain supply provides output power.
Zero sound is a collisionless collective Fermi surface deformation sustained by Landau quasiparticle interactions.[ref]
Oscillations in a Fermi Liquid by Lev Davidovich Landau. Opening and section 1, pp.101–103
A useful analogy is a crowd whose members respond to their neighbors' density without repeatedly bumping into them: the restoring interaction can remain effective when collisions cannot relax the distribution within one cycle. Zero sound is collective; it is not a single Landau quasiparticle outrunning every other excitation.
A Landau quasiparticle is a fermionic excitation connected continuously to a Fermi gas particle when interactions preserve the phase. Near an isotropic Fermi surface, its energy relative to the chemical potential is , with Fermi momentum and Fermi velocity .[ref]
The Theory of a Fermi Liquid by Lev Davidovich Landau. Section 1, pp.921–922
The Pauli exclusion principle restricts decay. For a three-dimensional normal Fermi liquid with regular short-range interactions, a representative low-energy lifetime model isHere is an energy scale and is dimensionless; sharpness requires at zero temperature.[ref]
Renormalization Group Approach to Interacting Fermions by Ramamurti Shankar. Section VIII, manuscript p.114, quadratic lifetime corrections
For an original example, stipulate and . At , the decay energy is , just of the excitation energy; halving reduces that ratio to . Approaching the Fermi surface improves the particle description even though the microscopic interaction has not weakened. This quadratic illustration is three-dimensional; low-dimensional corrections require separate analysis.
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








