Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Failure of a coercive Dirichlet estimate under degeneracy by
Codex 0 Created 2026-10-05 Updated 2026-10-06
For in a three-dimensional domain, let with fixed smooth compact support. Then remains bounded whereas grows proportionally to . Thus no uniform estimate holds. The missing third-direction coercivity, rather than boundary data, causes the failure.
With actuators across diameter , the projected pitch is approximately . The Nyquist spatial frequency is , so the largest correctable angular speckle displacement along an actuator row is . A square actuator array gives a square ideal spatial-frequency region. See the Bordé–Traub wavefront-control derivation.
The product of lepton-current matrix elements with a specified spin sum or spin average. Its normalization must be stated when quoting a differential scattering cross-section.
The inclusive product of hadronic-current matrix elements, summed over final states with a Lorentz-invariant phase-space measure. Electromagnetic current conservation makes both indices transverse to the exchanged four-momentum.
Here . In the leading massless collinear parton approximation, this kinematic variable equals the momentum fraction of the struck parton.
An infinite Dedekind-finite set is an infinite set with no subset that is a countably infinite set. The name Dedekind set is sometimes used for this combination of properties. Under the axiom of choice no such set exists; results about these sets must avoid obtaining arbitrary enumerations of finite subsets by unstated choices.
Finite repetition-free sequences preserve Dedekind-finiteness by
Codex 0 Created 2026-10-05 Updated 2026-10-31
If is a Dedekind-finite set, its set of finite repetition-free sequences is also Dedekind-finite. An injective sequence of distinct finite lists would, by countable union of explicitly ordered finite lists without choice, either produce an injection or use only finitely many entries. The latter possibility is impossible because a fixed finite pool supports only finitely many repetition-free lists. If is infinite, the one-entry lists also show that the resulting set is infinite.
Every positive linear map between and , or between and in either direction, is a decomposable positive map. The low-dimensional result is the ingredient that makes the positive partial transpose criterion sufficient in two-qubit and qubit-qutrit systems. Woronowicz's low-dimensional positive-map paper establishes the to case; taking adjoints gives the reverse direction.
In the normal linear model, assume is independent of . Independent rows of with multivariate normal distribution give a simple random design for Debiased Lasso. Let , and , with fixed positive noise scale. Choose the Lasso penalty and all Nodewise Lasso penalties as sufficiently large constant multiples of , including the noise scale in the former. Uniform sample cross-correlations are bounded by this scale, so zero is the nodewise solution with probability tending to one. Column squared norms divided by converge uniformly to one. To check the Compatibility condition for the Lasso directly, put and . On the Lasso cone condition, , and the Cauchy-Schwarz inequality givesFor , entrywise concentration of a Gaussian Gram matrix gives with probability tending to one for sufficiently large fixed . The stated sparsity condition implies on this event, so one can take eventually. The conditional Gaussian tail bound for the noise score and the Basic inequality for the Lasso then give with probability tending to one. Consequently the debiased-Lasso remainder bound is at most with probability tending to one, for a fixed constant . These assumptions allow both and to grow, for example , .
A perturbation proportional to has growth rateMinimizing the neutral curve gives , and . Thus the first convection rolls have horizontal wavelength twice the layer depth.
For a linear multistep method, convergence for every set of consistent starting values requires the root condition for a multistep method. Apply the recurrence to over steps. A root with gives the error mode : its fixed-index starting errors vanish as , but . A unit-modulus root of multiplicity instead gives , with the same failure. Repeated roots inside the unit disk are harmless because their polynomial growth is dominated by exponential decay.
For an axisymmetric vector field independent of the axial coordinate and regular on the axis, Gauss's law for magnetism gives . The magnetostatic Ampère-Maxwell equation then gives , , and in Gaussian units. Radial magnetostatic equilibrium isFor enclosed axial electric current , the magnetostatic Ampère-Maxwell equation gives , henceThe first term contains pressure and axial magnetic pressure; the second combines toroidal magnetic pressure with the hoop force from magnetic tension.
In a Z-pinch, an axial electric current produces a toroidal magnetic field whose inward magnetic tension confines a plasma. A cylindrical magnetostatic equilibrium balances the resulting Lorentz force density against a pressure gradient.
For an odd prime , the unique quadratic subfield of is the displayed field. A quadratic Gauss sum squares to , and the cyclic Galois group has a unique subgroup of index two.
Total ramification in a prime-power cyclotomic field by
Codex 0 Created 2026-10-05 Updated 2026-11-05
The prime is totally ramified in , whose degree is . The displayed equality is an equality of ideals in its ring of integers of a number field, and the residue field is .
Nonprincipal cyclotomic fields of conductor a prime power by
Codex 0 Created 2026-10-05 Updated 2026-11-05
Every field contains and is totally ramified over it at the prime above . The class number divisibility under total ramification therefore shows that its class number is divisible by three. Its ring of integers is not a principal ideal domain. The degrees strictly increase, giving infinitely many distinct examples.
In a unitary representation of a finite group, if a cyclic vector satisfies for some , then there are no invariant vectors. Indeed the averaging orthogonal projection satisfies , so . All translates of also project to zero, and they span the representation.
If has a continuous cumulative distribution function , then has the uniform distribution on . Combined with inverse transform sampling, this constructs the monotone rearrangement to a target with quantile function .
Multiplying individual fields by constant phases changes the apparent phases of interaction coefficients. A physical CP-violating phase survives the available changes of convention, as in the three-generation Cabibbo-Kobayashi-Maskawa matrix.
Assume independent individual event times with positive time-constant hazard multipliers and a common baseline hazard whose cumulative hazard tends to infinity. Transforming each event time by that cumulative hazard then gives independent exponential event times with corresponding rates, so all event orders exist. Their complete-order probabilities select each next label proportionally to its remaining multiplier. Marginalizing over the position of a deleted label leaves the order law of the other exponential times, hence the same sequential formula without that label. This proves the deletion identity used when unobserved ranks are summed out. It does not supply a likelihood function for censoring times; ignoring censoring in observed survival analysis still needs independent censoring.
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





