Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
For distinct points and , the distance-ratio locus is a sphere with center and radius . Completing the square proves this formula. It encloses but excludes , because their distances to the center are and . It is the zero-potential locus of two opposite-sign point charges with magnitude ratio . Equal magnitudes instead give a plane.
The sound-crossing time is the characteristic time needed for an acoustic wave to cross a region of size . If the speed of sound is nearly uniform, ; along a specified path through a nonuniform medium, the travel time is .
This is also a timescale for communicating a change of pressure. A gas compressed much more slowly than its sound-crossing time can often adjust toward mechanical equilibrium throughout the container. A rapid push can instead create substantial pressure differences and propagating waves. Comparing a collapse or heating timescale with helps determine whether a spatially uniform pressure approximation is plausible. The crossing time itself does not guarantee equilibration: reflections, geometry and damping determine what happens after the disturbance arrives.
A spectrograph records the optical spectrum dispersed by an instrument. Its spectral resolving power describes which nearby wavelengths it separates.
Fourier transform spectroscopy measures an interferogram as a function of optical path length difference. Its Fourier transform recovers the spectrum. An imaging implementation obtains an interferogram at every detector pixel, but a scanned cube is not simultaneous at all wavelengths.
For a small sinusoidal optical path length error , expand its phase factor to first order. The two exponential harmonics each have field amplitude relative to the unperturbed field, so each speckle has contrast . Its angular displacement is . Here is optical path error, not physical mirror displacement; a reflecting mirror introduces twice its surface displacement in the near-normal limit.
Compressed sensing reconstructs a sparse vector, or an approximately sparse one, from fewer linear measurements than its ambient dimension. Basis pursuit replaces counting nonzero coordinates by convex minimization. A null space property characterizes exact uniform recovery, while a robust null space property controls errors from noise and nonsparse tails.
For and , use the Lasso objective . Suppose the noise score has maximum norm at most , the true support has size , and . For any nonempty , the Karush-Kuhn-Tucker conditions implyThe upper bound is the Cauchy-Schwarz inequality. Hence . A finite first index violating this inequality must exceed . Its minimality also gives . If no such index exists within , use the always defined bound .
The ordinary topology on has basic sets for finite . It is the product topology on increasing enumerations, and also the subspace topology on infinite-subset indicator functions in .
For a finite set and an infinite set lying above , putThese sets form the basic neighborhoods of the Ellentuck topology, also called the star topology. It is finer than the ordinary topology on infinite subsets. Every basic neighborhood is a clopen set in the Ellentuck topology, and a closed set in the ordinary topology.
For a compact Hausdorff space , consists of continuous scalar-valued functions with the supremum norm. It is a Banach space and, with complex scalars, pointwise multiplication and conjugation make it a commutative unital C-star algebra.
Why does completeness hold? A Cauchy sequence in the supremum norm is Cauchy at every point, hence has a pointwise limit. The uniform Cauchy estimate passes to that limit, giving uniform convergence; the uniform limit theorem makes the limit continuous. Thus the norm and the chosen regularity of the functions cooperate to keep every limit inside .
Changing to the L2 norm on loses this property. For integers , the continuous functions approximate the step function for and for . Direct integration givesThe triangle inequality makes a Cauchy sequence, but no continuous function agrees with almost everywhere: continuity would force value zero on the whole left open interval and one on the whole right open interval. Hence this normed space is incomplete. The missing limit exists in L2 space, its completion of a normed space, showing exactly what the larger space adds.
The continuous dual space of is under the extension of the L2 inner product. The Fourier transform definition proves boundedness of the pairing by the Cauchy-Schwarz inequality, and the Riesz representation theorem proves that every continuous functional has this form. Consequently a bounded linear operator has an adjoint operator, relative to this pairing, from to . For an operator that smooths by two orders for every , this yields by taking .
Multiplication by a test function is bounded on every real-index Sobolev space. Its Fourier transform acts by convolution with a Schwartz function; frequency-weight estimates and Young's convolution inequality give the norm bound.
For , an inhomogeneous Sobolev space norm is , using weak derivatives. In particular, . The gradient seminorm alone defines a different completion, the Dirichlet energy space, unless a suitable Poincaré inequality makes the two norms equivalent on the chosen zero-boundary space.
A smooth manifold with boundary has charts in the half-space , with smoothly compatible transition maps. The boundary is the locus modeled on .
A closed manifold is a compact manifold with boundary whose boundary is empty. Here “closed” includes compactness.
A piece is a nontrivial combinatorial path that occurs in two essentially distinct positions on oriented cell attaching paths. These may be different cells or distinct admissible occurrences on one attaching path; occurrences identified by the defining attaching-path symmetry are not counted twice. In a symmetrized group presentation, it is a common initial segment of distinct relator words. Internal arcs of a reduced disc diagram are pieces, because otherwise the neighboring cells form a cancellable pair.
The condition requires that every piece in small cancellation theory occurring in a cell boundary have length strictly less than times that cell's perimeter. Length counts edges. For , an inner path made of at most three pieces has length strictly less than half the perimeter, so the complementary outer path is strictly longer. The attaching paths are combinatorial immersions and the piece convention is part of the chosen presentation or polygonal complex.
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





