Periodicity 2026-10-25
Periodicity is invariance under translation by a nonzero period : a periodic function satisfies at every point in its domain, with translation preserving the domain. For an angular coordinate on a full circle, single valuedness requires -periodicity. The sine and cosine factors and are -periodic for nonzero real precisely when is an integer. Their Fourier series supply the angular modes for the harmonic expansion on a disk.
Polar form of a complex number Created 2026-10-06 Updated 2026-10-20
A nonzero complex number has polar formwhere is its modulus and is an argument. The equality uses Euler's formula; sine and cosine recover the imaginary part and real part from polar coordinates. For , take and radians, so and .
If , thenThus multiplication multiplies moduli and adds arguments modulo ; division divides moduli and subtracts arguments modulo . Since , multiplying by gives , of modulus and argument radians. One formula simultaneously describes its new size and direction.
Complex multiplication rotates every direction and scales every length equally
. Details. Repeated multiplication now becomes especially simple: for a positive integer . This explains the evenly spaced arguments of the roots of a complex number. For example, has modulus and principal argument radians. The Cartesian calculation and the polar form provide independent checks on both its location and its size. Choose polar form when the task concerns multiplication, division, or repeated turns; use real parts and imaginary parts for addition.
Pythagorean trigonometric identity Created 2026-09-29 Updated 2026-10-14
For every real angle ,It is the equation of the unit circle written in terms of its sine and cosine coordinates. For an acute angle, dividing the Pythagorean theorem by the square of the hypotenuse gives the same relation in a right triangle. The circle interpretation explains why it remains true outside that first-quadrant triangle.
For example, if , the identity gives , so is either or . The sign needs the angle's location: it is positive in the first quadrant and negative in the second. Thus the identity determines the magnitude of the missing coordinate without determining the direction.
The relation is useful for eliminating one squared trigonometric function, checking that a coordinate pair has unit length, and checking that the columns of a rotation matrix are unit vectors. It also holds for complex arguments under the complex exponential definitions, although then the squares are algebraic squares rather than squared moduli.
Quadrature demodulation 2026-10-14
Quantum mechanics Created 2026-09-24 Updated 2026-10-18
Quantum mechanics describes a quantum system using a quantum state, with observables represented by self-adjoint operators. For a single particle in one dimension, a pure state can be described by a wavefunction : its squared modulus gives the probability density for position. The Schrödinger equation predicts how this probability amplitude evolves between interventions; measurement in quantum mechanics connects it to experimental outcomes through the Born rule. A wavefunction therefore predicts a distribution of possible positions rather than a single trajectory as in classical mechanics.
The infinite square well makes three central ideas visible with elementary sine functions. Confinement selects discrete energy eigenvalues; wavefunction normalization converts a shape into quantitative probabilities; and a quantum superposition can have a changing probability density even when each constituent energy eigenstate has a stationary one. This combination explains why quantum mechanics uses both linear algebra and differential equations: eigenfunctions describe the building blocks, while quantum phases determine how they interfere. The same tools help explain the discrete energies of chemical atoms and molecules, although their Quantum Hamiltonians require different potentials and often many particles.
In his first 1926 paper, Erwin Schrödinger formulated quantization as an eigenvalue problem for a hydrogen atom in nonrelativistic quantum mechanics. On its opening page he compared the emergence of integers with the number of nodes of a standing wave on a vibrating string. The infinite square well below realizes that appealing idea especially transparently: the allowed integers follow from the boundary conditions. This historical analogy concerns the origin of discrete energies; the Born rule supplies the statistical interpretation of the modern wavefunction. [ref]
Quantisierung als Eigenwertproblem (Erste Mitteilung) by Erwin Schrödinger. Schrödinger, Quantisierung als Eigenwertproblem, 1926, pp. 361–363
. Quotient topological space Created 2026-10-06 Updated 2026-10-25
A quotient topological space is a quotient set equipped with the quotient topology. For a concrete gluing, give the closed interval its usual subspace topology, identify , and leave every interior point in its own singleton equivalence class. The resulting quotient space is a circle: the two endpoints become one point, while interior points remain distinct.
The exact continuous map to the unit circle in the plane isHere sine and cosine give , and holds exactly when or . Thus induces a bijection . [ref] The universal property of the quotient topology makes continuous. The quotient of a compact space is compact, and the unit circle is Hausdorff, so the compact-to-Hausdorff continuous bijection theorem makes a homeomorphism. This verifies the topology, not merely the point identifications.
To inspect an open neighbourhood of the seam, choose and let . Its full preimage isBoth pieces are open in the subspace topology on , so is open in the circle. In contrast, is open in , butis not open in : it contains without any neighbourhood of . Hence is not open in the circle. A quotient map can therefore fail to be an open map.
An open neighbourhood crosses both sides of the glued seam; a one-sided arc fails the full-preimage test
. Details. For a continuous function , the only gluing condition is . For example, defines a continuous function on the circle, whereas does not. This lets us use an interval as a coordinate for a periodic function while making the seam invisible. More general quotient spaces encode glued geometric pieces in the same way: describe continuous maps before gluing and check that their values agree on every equivalence class.
The Hausdorff property need not survive a quotient topology. In the non-Hausdorff quotient of the real line by rational translation, means . A nonempty open preimage must contain all translates by rational numbers of any open interval inside it. The density of the rational numbers then forces : for any , some rational number has in that interval. Thus this quotient space has the indiscrete topology. The irrationality of the square root of two gives distinct equivalence classes for and , so this quotient space is not Hausdorff. Unlike the endpoint-gluing circle, this gluing identifies a dense subset with each point.
Raster sampling and reconstruction 2026-10-13
A point-sampling model assigns to a pixel on a grid, where is a continuous function representing an image signal. An area-sampling model instead assigns the average value of a function over a specified footprint. These are different models: a narrow feature between point samples can be missed, whereas its contribution to an area sample depends on its width and shade. Neither model says that the recorded value uniquely determines everything inside a grid cell.
The upper panels start with exactly the same array. Nearest-neighbor interpolation repeats its values into a display; successive linear interpolations in the two coordinate directions produce a smoother display. Original sample positions are marked. Both displays use 384 output pixels, but only the same 24 recorded values. The extra values follow the chosen interpolation rule. Between-grid appearance is inferred, not independently recorded.
Spatial resolution needs a stated meaning. A grid over a rectangle of width and height has nominal cell pitches and . Over the same rectangle, doubling both dimensions halves these pitches and quadruples the pixel count. That is a finer grid, not a guarantee of more recoverable detail. Blurring before sampling, quantization and aliasing can make different originals share the same recorded array. Enlarging the rectangle without adding samples instead increases the displayed pitch.
A reproducible computational demonstration makes the ambiguity exact. Take the one-dimensional profiles and , repeated identically along every row. Sample at for . Since , the fact that the sine is a periodic function gives . Both yield , although at they give approximately and . The lower panel draws both originals and their common samples: no operation on those samples alone can identify the original profile. This is aliasing in an ideal point-sampling model, without image noise or rounding.
The Nyquist–Shannon sampling theorem describes reconstruction under a bandwidth restriction and ideal sampling assumptions; it does not grant uniqueness for arbitrary image signals from a finite raster image.[ref]
https://fab.cba.mit.edu/classes/S62.12/docs/Shannon_noise.pdf. Shannon, Communication in the Presence of Noise (1949), section II, Theorem 1 and reconstruction from the infinite sample sequence
The beautiful lesson is constructive: choose what detail the grid should preserve before sampling, and choose a reconstruction rule suited to the information actually retained. Richardson extrapolation 2026-10-14
Richardson extrapolation improves an approximation by combining two resolutions so that their leading truncation errors cancel. The useful surprise is that the size of that leading error need not be known: its scaling under refinement is enough. This lets an existing finite difference method or quadrature rule produce a more accurate answer from two runs, without first deriving a new method from scratch.
Suppose approximates a fixed limit as the positive resolution parameter tends to zero, with an asymptotic expansionHere is known, is independent of , and denotes Big O notation. The same asymptotic expansion, with the same , must describe both and . Nested grids make it natural to reuse samples, although nesting itself does not establish this error model. Define the linear combinationThe weights sum to one, preserving , while . Thus Richardson extrapolation gives : the next available term in the asymptotic expansion determines the improved order. Justin Solomon's numerical analysis text develops this cancellation for finite differences and applies it to numerical integration.[ref]
https://people.csail.mit.edu/jsolomon/share/book/numerical_book.pdf. Justin Solomon, Numerical Algorithms, §14.3.3 and Exercise 14.9
Geometrically, regard the approximation as a function of . Its first two terms are a straight line . The two computed points lie at positive ; extending the line through them to gives . This is why the operation is extrapolation: it estimates a value outside the sampled parameter interval. The remaining curvature corresponds to the uncancelled terms of the asymptotic expansion.
Worked example: a centered derivative of sine. For the smooth function , the exact derivative at is . The centered difference quotient, a central finite difference, isThe Taylor series of sine gives the signed truncation errorThus , and . Halving divides the leading truncation error by four. Combining the two centered difference quotients with Richardson extrapolation givesIndeed, the coefficient becomes ; the coefficient vanishes. This is the even-power case of Richardson extrapolation discussed in Persson's authored lecture notes.[ref]
https://persson.berkeley.edu/math128a/lecture_notes/math128a_lecture_notes_chapter_4.html. Per-Olof Persson, Math 128A, Chapter 4, §§4.1–4.2
For and , the actual computations areThe absolute error drops from about for to for , an improvement by roughly a factor of 498. Refining again gives , whose absolute error is about . The refined truncation errors decrease by nearly four for and nearly sixteen for , reflecting their second and fourth orders.
Centered sine derivative errors: second order before Richardson extrapolation and fourth order after cancellation
. Source. Details. The logarithmic scale on each axis turns power laws into straight lines. The dashed reference curves are and , the magnitudes of the leading truncation errors. The plotted errors are computed with 70-digit decimal arithmetic, rather than clipped to a display floor; this isolates the asymptotic expansion from roundoff error.
Worked example: integrating an exponential. Approximate the definite integral of the exponential function on :For numerical integration, the composite trapezoidal rule adds the areas of trapezoids between successive samples; this is the quadrature use of the endpoint average that also occurs in the ODE trapezoidal rule. On equal intervals, with , defineSumming the geometric series gives . Expanding the exponential function near zero yieldsThe leading truncation error again has , . On the uniform nested grids with and intervals, Richardson extrapolation therefore givesThis linear combination is exactly composite Simpson's rule on the finer grid, whose spacing is . On each coarse panel, an old endpoint receives weight and the new midpoint weight ; shared old endpoints receive weight . These are the usual Simpson's rule weights multiplied by . The equivalence is explained directly in LeMesurier's university notes.[ref]
https://lemesurierb.people.charleston.edu/elementary-numerical-analysis-python/notebooks/definite-integrals-3-simpson-richardson.html. Brenton LeMesurier, MATH 375, §19.1: The Basic Simpson's Rule by Richardson Extrapolation
For two coarse panels and four fine panels,The absolute errors are about , and , respectively. Reusing the fine-grid samples makes Richardson extrapolation especially attractive here: the resulting Simpson's rule needs no samples beyond those already used by .
Exponential quadrature on nested grids: trapezoidal areas, reused sample nodes, and the fourth-order Simpson combination
. Source. Details. When the improvement is justified. Richardson extrapolation requires the stated asymptotic expansion and the correct positive . If the actual leading exponent is , its coefficient after combination is , so the leading truncation error generally remains. Merely knowing does not supply a common coefficient or a higher-order remainder. A discontinuity of a function, a singular endpoint, or unrelated changes between grids can invalidate the assumed asymptotic expansion; refinement alone does not guarantee improvement for every numerical problem.
Roundoff error and errors in the sampled values survive the cancellation of truncation error. If the coarse and fine values have absolute perturbations bounded by , the perturbation in is bounded by ; for this is . In floating-point arithmetic, a centered difference quotient can also amplify sample errors through division by , so an indefinitely smaller need not be more accurate. Persson's notes describe this balance between truncation error and roundoff error.[ref]
https://persson.berkeley.edu/math128a/lecture_notes/math128a_lecture_notes_chapter_4.html. Per-Olof Persson, Math 128A, Chapter 4, §4.1: Roundoff Error Instability
The same cancellation idea appears in step-doubling error estimation. For an order- one-step method for an ordinary differential equation, two half steps each contribute local truncation error of order , so their accumulated leading local error has ratio to one full step. This explains the denominator there; the appropriate exponent follows from that local error model, rather than automatically from a generic use of Richardson extrapolation.
Rotation matrix Created 2026-09-24 Updated 2026-10-14
A rotation matrix turns vectors while preserving their shape relationships. For column coordinate vectors in an orthonormal basis, its defining conditions arewhere is the transpose and the identity matrix. In the usual Cartesian basis of the plane, an active counterclockwise planar rotation through an angle usesHere the vector moves and the basis stays fixed: . Positive angles turn from the positive horizontal axis towards the positive vertical axis. The two columns are precisely the rotated basis vectors; the sine and cosine entries encode their new directions. Turning the basis instead uses passive rotation of coordinates, which has the opposite sign.
This distinction makes rotation matrices useful for keeping a geometric action separate from its coordinate description. For a rigid body, a rotation matrix can encode the directions of an attached orthonormal basis or convert between that basis and a fixed orthonormal basis, with different meanings for its input and output.[ref]
Modern Robotics: Mechanics, Planning, and Control by Kevin M. Lynch and Frank C. Park. Modern Robotics, §3.2.1.2, preprint p. 69: three uses of a rotation matrix
The orthogonal matrix condition preserves every dot product:Consequently Euclidean norms and angles between nonzero vectors are preserved, as is the Euclidean norm of the difference between any two endpoints. The additional determinant condition preserves orientation of a vector space and oriented volume: for any square matrix whose columns are the input vectors, . An orthogonal matrix of determinant , such as a reflection matrix, preserves dot products but reverses orientation of a vector space. The matrix inverse is especially simple: .[ref]
Modern Robotics: Mechanics, Planning, and Control by Kevin M. Lynch and Frank C. Park. Modern Robotics, §3.2.1, definition 3.1 and propositions 3.3–3.6, preprint pp. 67–69
Sine Created 2026-09-24 Updated 2026-10-14
For a real angle , is the vertical coordinate on the unit circle reached by a counterclockwise rotation through radians. For an acute angle in a right triangle, it is the opposite side divided by the hypotenuse. In particular,The first-quarter rise and second-quarter fall are visible in the circle projection; the lower semicircle gives negative values.
Reflecting the unit circle across the horizontal axis gives , so sine is an odd function. A full turn gives , making it a periodic function. For real arguments, its range is and its zeros of a function occur at for integers . The cosine describes the perpendicular coordinate of the same point, and the Pythagorean trigonometric identity keeps their two values tied together.
Sine fixed-point iteration Created 2026-10-25 Updated 2026-10-31
The sine fixed-point iteration converges to zero from every real starting value. After one step, , and . Since for , the absolute values form a bounded monotone sequence. Its limit satisfies by continuity, forcing . This proves convergence even though the sine is not a contraction mapping on any interval containing zero in its interior.
Sine power kernel integrability 2026-10-31
For , the function is Lebesgue integrable on exactly when . Near zero, , so absolute integrability is equivalent to that of , which requires . At infinity, gives the upper bound . For , on each interval ,and the corresponding P-series diverges.
The signed improper integral nevertheless converges for every : near zero the same local comparison applies, and at infinity the Dirichlet test for improper integrals uses the bounded antiderivative of sine and the decreasing factor . Thus gives conditional convergence, while gives absolute integrability. In particular, substituting turns into the divergent tail .
Single-slit diffraction Created 2026-10-14 Updated 2026-10-18
Single-slit diffraction is the spreading of light transmitted by one slit. Consider an ideal rectangular slit of width , illuminated normally by a uniform plane wave with a single wavelength in the surrounding medium. This monochromatic wave has uniform wave amplitude and equal incident wave phases across the slit, providing the required optical coherence. In the scalar Fraunhofer diffraction model, the normalized angular wave intensity isHere is measured from the forward normal in the plane across the slit width. The sinc function uses the unnormalized convention . The limit makes the central value one. This ideal envelope neglects additional direction-dependent propagation and detector factors; near the forward direction it describes the normalized screen irradiance. [ref]
https://openstax.org/books/university-physics-volume-3/pages/4-2-intensity-in-single-slit-diffraction. Ling, Sanny and Moebs, University Physics Volume 3, §4.2: single-slit intensity
.The noncentral zeros satisfyThe restriction follows from the range of the sine of a real angle. The first minima have when . If , this model has no noncentral zero in the forward hemisphere; equality puts the first zeros at grazing directions, outside the small-angle approximation and off any finite perpendicular screen. [ref]
https://openstax.org/books/university-physics-volume-3/pages/4-1-single-slit-diffraction. Ling, Sanny and Moebs, University Physics Volume 3, §4.1: positions of diffraction minima
.For , define the central width as the separation between the two first minima. Its angular width and its width on a perpendicular screen areThe angular approximation uses radians and requires ; the screen approximation uses . The tangent relation is exact straight-line geometry, even though the underlying Fraunhofer diffraction field is approximate. This width is distinct from the full width at half maximum.
For , and , the positive first minimum isThe dimensionless far-field parameter is . Doubling the slit width to gives and parameter ; both curves below use the Fraunhofer diffraction approximation. Choosing halves those parameters and doubles both screen widths.
Each curve is normalized to its own ; the arrows measure between first minima. The calculation uses before evaluating the sinc function, rather than replacing by . The lower diagram shows the exact screen geometry with the vertical scale enlarged. Normalization removes the change in peak brightness when the slit width changes.
The wave interference explanation is especially simple: divide the slit into equal narrow strips and add their complex amplitudes, rather than their wave intensities. With wavenumber , the continuous slit givesIntegrating the complex exponential gives the endpoint difference; its continuous value at zero is one. Taking the squared complex modulus gives the stated wave intensity. This is the Fourier transform of an interval indicator expressed in angular coordinates. Feynman's continuous-source argument obtains the same pattern by letting the number of sources tend to infinity. [ref]
https://www.feynmanlectures.caltech.edu/I_30.html#Ch30-S2. Feynman, Leighton and Sands, I §30–2: continuous distributions of oscillators
.At the positive first minimum, the wave phases span exactly across the slit. Every strip in one half has a partner away, with equal wave amplitude and phase difference , so the pairs cancel. At , all the wave phases align instead. [ref]
https://openstax.org/books/university-physics-volume-3/pages/4-1-single-slit-diffraction. Ling, Sanny and Moebs, §4.1: cancellation between the slit halves
.Complex amplitudes across a slit: aligned contributions at broadside and cancellation at the first minimum
. Details. The drawing uses equally weighted midpoint samples , with . At the first minimum their complex amplitudes are a common rotation of the eight roots of unity, so their head-to-tail polygon closes exactly. This finite sum illustrates cancellation; the continuous integral, rather than eight point sources, defines the slit pattern at general angles. The circle shows the continuous range of wave phases; coloured arrows show the eight samples.
A narrower aperture requires a larger angle to accumulate the cancelling phase difference, so narrowing the slit widens the beam. This is a useful limit on geometrical optics: confining light more tightly at an opening increases its subsequent angular spread. At fixed incident irradiance and slit height, reducing also reduces transmitted power, exposing a practical balance between diffraction-limited resolution and light throughput. In a diffraction grating, this single-slit diffraction envelope modulates the wave interference between different slits.
Slowly varying function Created 2026-10-05 Updated 2026-10-14
A positive measurable function is slowly varying at infinity iffor every fixed . It has regular variation of index zero. “Slowly” concerns relative change under multiplication of the argument; it does not mean that the function must be bounded, have a small derivative, or converge to a finite value.
Every positive constant is a slowly varying function. So are , and for any fixed real number , on . Indeed,The first grows without bound, the second tends to zero, and the constant does neither. Another unbounded example is :This function can grow much faster than while retaining regular variation of index zero.
Even convergence is unnecessary. The bounded functionoscillates between and . It is nevertheless a slowly varying function: the change in the argument of the sine under isand the Lipschitz continuity of the sine makes the logarithm of the ratio tend to zero. The sequences and give the two values and for every nonnegative integer , so there is no limit at infinity.
Contrast this with , which is positive and bounded but is not a slowly varying function. Fix . Along its rescaling ratio is ; along the ratio is . The persistent oscillations prevent even a limit for this one fixed rescaling. It is not regularly varying with any finite index either.
Two bounded oscillating functions: logarithmic rescaling makes one ratio approach one, while the other keeps oscillating
. The horizontal coordinate is , and the fixed rescaling is . The displayed range illustrates the formulas; the limiting claims follow from the arguments in the text. Details.The useful distinction is whether a fixed proportional change of input eventually produces a negligible proportional change of output. A slowly varying function can therefore preserve the scaling exponent of a power law while changing its magnitude substantially. The decomposition in regular variation explains why a logarithmic factor can matter in numerical estimates without changing the limiting exponent.
Spatial sampling of a wave 2026-10-14
In spatial sampling of a wave, a detector records a wave at positions separated by pitch . Angular wavenumbers differing by , with integers , give identical samples of a complex Fourier mode:This is spatial aliasing. To distinguish arbitrary sinusoids within a prescribed band, require , equivalently , the Nyquist spatial frequency. Thus for the shortest allowed wavelength. At equality a sine can vanish at every sample, so phase information can be lost. The Nyquist–Shannon sampling theorem states the precise reconstruction conditions for a bandlimited function; a finite scan introduces further limitations.
The synthetic two-tone snapshot iswhere both count cycles per metre. The component wavelengths are and . With , both lie below the Nyquist spatial frequency of cycles per metre. With , the -cycle component aliases to the -cycle component: at every , . The sampled sum is therefore indistinguishable from , although the continuous curves differ between samples. Drawing lines between sample points cannot resolve this ambiguity.
Synthetic two-tone spatial waveform: fine samples distinguish the components, coarse samples hide the shorter wavelength
. Details. Spherical law of sines 2026-10-14
For a nondegenerate convex minor spherical triangle, with angular sides opposite interior angles , the spherical law of sines statesThe sines of sides refer to central angles, so a physical side length on a sphere of radius must enter as . All six angles lie in , and the denominators are positive. The reciprocal form, , is equivalent. This is Tatum's sine formula, equation 3.5.1, in Celestial Mechanics, section 3.5: spherical sine and cosine formulas.
A short proof explains the symmetry of the spherical law of sines. Let be the vertex unit vectors at . At , the outgoing unit tangent vectors towards are and . Their angle is , so the magnitude of their cross product is . Since both tangent vectors are orthogonal to , the scalar triple product obeysDividing by proves the spherical law of sines. Its beauty is that the same three-dimensional scalar triple product can be calculated at any vertex, producing all three ratios at once.
For the spherical triangle worked out under the spherical law of cosines, , and . Hence , and the spherical law of sines givesThe inverse sine gives , but the supplementary angle has the same sine. The spherical law of sines alone therefore leaves two candidates for this angle. The spherical law of cosines, using the known three sides, gives and selects ; likewise . When only two sides and an opposite angle are given, two distinct valid spherical triangles can remain. A cosine relation resolves an inverse sine branch only when enough additional data are known; it does not make every ambiguous data set unique.
Static friction Created 2026-10-05 Updated 2026-10-14
Static friction is the tangential contact force that maintains zero contact slip. “Static” describes the contact state: both surfaces can move together in the chosen inertial frame. In the ideal dry-contact model, the actual static friction adjusts to the equations of motion, subject to a bound, rather than always taking its maximum value.[ref]
6.2 Friction. Static and Kinetic Friction; Magnitude of Static Friction, equation 6.1 and responsive-force paragraph
Here is the magnitude of the normal force and the coefficient of static friction. Equality means limiting static friction; it is a threshold, not an instruction to replace every unknown contact force by .For a stipulated example, place a nonrotating block initially at rest on a stationary horizontal surface. Take gravitational acceleration and coefficient of static friction , with no other vertical force. The vertical force balance gives , so the largest allowed static friction magnitude is . Choose right as positive and apply a horizontal force . Remaining at rest requires Newton's second law to giveAt , the static friction is ; at , it is . Both states have zero acceleration. At , balancing would require , outside the bound, so this initially resting block cannot remain at rest. Its subsequent acceleration requires a kinetic friction law; setting after contact slip begins would still use the wrong contact state. At exactly , the ideal inequality still permits rest at the threshold. These are model calculations, not measured material properties.
Static friction adjusts to the applied force within its admissible bound
. Original signed horizontal model for the stipulated block: the shaded band is the allowed static friction, the solid line satisfies force balance, and the dashed line shows the demand outside that band. The crossed points at are impossible static demands, not sliding forces. Details.The toy model used in kinetic friction makes the contact-state distinction explicit: , , and coefficient of kinetic friction . On stationary ground, an initially resting box pushed right with has . At it cannot remain at rest; once it slides right, and . At , rest is allowed with , whereas an already right-sliding box has and . The applied force alone does not specify the friction branch: contact slip and motion history matter.
For a flat contact with two tangential directions, the bound applies to a vector norm, not separately to each component:For the stipulated bound, balancing horizontal components and requires a force magnitude , which is allowed. Components and require , which is forbidden even though each component separately is below . This circular bound assumes the same coefficient of static friction in every tangential direction. Near impending contact slip, the limiting static friction opposes the relative contact motion that would otherwise begin. Once actual contact slip exists, kinetic friction instead opposes its tangential relative velocity, which need not have the direction of the body's center of mass motion.
The normal force must also come from the equations of motion. On horizontal ground, an upward pull of magnitude at angle above horizontal gives, for a block remaining at rest with no other forces,The sine component unloads the contact and the cosine component demands tangential support. These equations require ; if the supporting contact opens, this dry-contact model cannot supply a negative normal force. For the stipulated block and , the positive threshold is , with and . A downward pull increases instead. An inclined plane gives another reason why is not always .
To solve a new problem, impose zero contact slip, find the required static friction and normal force from the equations of motion, then check the bound. A demand inside it permits that contact state; a demand outside it rules the state out. For an ideal driven tire undergoing rolling without slipping on stationary ground, a forward static friction can accelerate the vehicle. Its role is to prevent contact slip, rather than to oppose all motion of the whole body.
Nor does the word “static” by itself make friction do zero work. The contact power delivered to a body is , a dot product with its material contact-point velocity in the chosen inertial frame. At an ideal contact undergoing rolling without slipping on stationary ground, , so this power is zero. For a rigid body, adding the translational and rotational contributions gives , where is the contact torque about the center of mass and its angular velocity. Counting only the first term omits the rotational contribution.
At a moving contact with zero contact slip, the two material contact points share a velocity that can be nonzero. For instance, a nonrotating block moving with an accelerating belt receives positive contact power when the belt's rightward velocity and rightward static friction are positive. The belt receives by Newton's third law. These contact contributions sum to zero in the ideal no-slip model, while the block's kinetic energy can increase. Zero contact slip and zero work on each body are different conditions.
Static friction on an inclined plane 2026-10-14
An inclined plane tilted slowly from horizontal turns a coefficient of static friction into a critical angle. Assume a nonrotating block on a stationary, rigid, dry surface, with gravitational weight and the contact forces as its only forces. Take to be the angle between the uphill surface direction and horizontal. Let be a unit vector pointing uphill and a perpendicular unit vector pointing outward from the surface. Resolving the gravitational weight givesThe angle between the downward vertical and the inward normal is also . Thus the inward component uses cosine and the downhill component uses sine. These are components of one force, not two additional forces.
Before downhill contact slip, zero acceleration and Newton's second law requireThe required static friction points uphill. Substituting into the bound and dividing by the positive givesThe tangent function increases on this range of angles, so the last admissible resting angle isThe inverse tangent takes a dimensionless quantity to an angle. At equality the ideal model still permits a limiting resting state; increasing further excludes it. At a smaller angle, is the demand ratio, not the coefficient of static friction.[ref]
For the stipulated , and , the critical angle is approximately . At , and , comfortably below the bound . At , maintaining rest would require , but the bound is only : rest is impossible. At , and . Notice that the limiting tangential force here is smaller than the horizontal limit because tilting reduces the normal force.
Cancellation of mass makes this relation useful: the ideal critical angle tests a contact coefficient without needing a calibrated force gauge. Doubling the block's mass doubles both demanded static friction and its bound, leaving unchanged if is unchanged. This is a testable model prediction. It need not survive a change in surface condition, a direction-dependent coefficient, appreciable deformation, or vibration.
The derivation also assumes continued contact and that sliding occurs before tipping or rolling without slipping. The resultant contact force must act within the supporting footprint so that the block can satisfy torque balance; a tall block may tip first. No extra tension, imposed tangential pull, or lift is included. In a slowly raised apparatus, quasistatic process means that motion of the board contributes negligible inertial forces while locating the threshold. Once downhill contact slip begins, a constant-velocity sliding angle would concern kinetic friction, not the onset of static friction.
A density of states has zero-temperature oscillatory grand potential . Its Fermi-window convolution multiplies that oscillation by when the lower band edge is far below the chemical potential. The Fourier transform of the even window removes its sine component and gives the title factor. At high , ; at small , . The corresponding thermal change relative to zero temperature has amplitude proportional to , rather than .
Topologist's sine curve Created 2026-10-14 Updated 2026-10-31
Consider the graph of a function , using the sine of the multiplicative inverse of , together with a vertical closed interval:Give the subspace topology from the Euclidean plane. The symbol denotes a Cartesian product. The right endpoint belongs to . The continuous map sends the connected real interval onto . Hence is connected, and its closure is connected by closure of a connected set. Every height in is approached as tends to zero; for example,For , these inputs are and . For any other height , choose with ; then the sequence lies in and has limit of a sequence .
Nevertheless, has exactly two path components, and . Within , join inputs by the continuous path . Within , use for heights .
The obstruction to a continuous path between and is persistent oscillation, not a visible gap. Proof outline: suppose such a path exists, directed from to , and take its last time in . Immediately afterwards its first coordinate approaches zero and its second coordinate is . The intermediate value theorem forces the first coordinate to pass through inputs of both displayed types arbitrarily close to that departure time. The second coordinate therefore takes both values and arbitrarily close to that time, contradicting continuity. [ref]
The topologist's sine curve has one connected component and two path components; the graph of a function is drawn only for , with further oscillations omitted near the vertical closed interval
. Details. The sampled graph of a function illustrates the formulas; it does not prove connectedness or the failure of path connectedness. Taking a closure preserves connectedness, but this example shows that it can destroy path connectedness.













