Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
For an -quasirandom group, uniform expectations, and the normalized convolution on a finite group, a scalar mean-zero function satisfiesThe Fourier analysis on a finite group proof bounds each nontrivial matrix component of in operator norm using its weighted Hilbert-Schmidt norm. For subsets of subset density values , the error in their normalized product count is at most . In particular guarantees a solution of in the three subsets.
The top quark is the up-type member of the third quark generation. Its mass exceeds the W boson mass, so a real W boson cannot decay into an on-shell top quark. A massless approximation for accessible decay products must not silently remove this channel threshold.
Apply a Controlled-Z gate to input and a fresh quantum ancilla. Measuring the input in the equatorial qubit measurement basis at angle , with outcome , leaves the unnormalized outputEach branch has probability , independently of the input. The logical output is with known Pauli frame ; the input qubit has been measured, so this does not clone it.
For and normalized , filtering by succeeds withThe inequality follows by replacing each nonnegative by its minimum and using . Equality holds exactly when all occupied eigenvectors belong to the minimum-eigenvalue eigenspace. If , success is positive exactly for inputs outside the kernel of .
Singular obstruction to normalized quantum matrix multiplication by
Codex 0 Created 2026-10-06 Updated 2026-11-05
If lies in the kernel of , then has no normalized quantum state. A request to produce that normalized vector with positive probability is consequently undefined. For example, on one qubit has distinct dyadic eigenvalues, but annihilates . The corrected filtering assertion requires ; it cannot be repaired by assigning a positive success probability to this input.
Query a known set of inputs and store its output table. If no function collision occurs there, each of its distinct outputs has exactly one partner in the complement, for a two-to-one function. A compute-phase-uncompute construction marks those partners using two function queries and reversible table comparison. Known-subset Grover search then uses such phase queries. Including table preparation and a final verification query givesChoosing balances both terms and gives . The Grover rotation angle rounding bound gives success tending to one. This is a query bound; it does not make reversible table lookup free in a gate or physical-memory cost model.
If is the quantile function of an absolutely continuous probability distribution with probability density function , then for almost every . Gaps in the support may give jumps in , so the identity concerns its ordinary almost-everywhere derivative. It follows by differentiating the inverse relation to the cumulative distribution function.
For , , the quantile function is a monotone function and is left-continuous. The distribution function is right-continuous, giving exactly when . If , a point between them has and contradicts this equivalence for some . A jump just to the right of is possible when is flat on an interval.
For a Newtonian Kepler orbit, let be the total mass and the reduced mass; put , , and , with . In the convention , differentiating the acceleration givesThe two terms have zero cross tensor contraction, with squared norms and . Therefore . Substitution into the quadrupole formula in this convention, , proves the luminosity. It is nonnegative since . The formula uses a weak gravitational field, slow motion and leading radiation order; orbital averaging gives a secular luminosity.
For a slowly evolving circular binary star with separation , reduced mass and orbital angular frequency , the leading gravitational wave losses satisfy . One direct check uses the standard quadrupole angular-momentum loss lawwhere is the mass quadrupole moment and is the Levi-Civita symbol. For , put ; then , , , and . Substitution gives and the quadrupole formula gives . Their ratio proves the balance relation. The same relation follows from the rotating wave's angular harmonic number two and frequency . The additional angular-momentum flux law, not the energy flux alone, is needed to justify preservation of secular circularity.
For a point mass moving as along one fixed axis, the trace-free mass quadrupole moment is . Its radiating component has twice the source angular frequency. The quadrupole formula gives for this contribution in the leading slow-motion weak-field approximation. Any physical driver or support has its own quadrupole contribution; this expression is for the prescribed mass alone.
For two equal point masses at falling from rest at under Newtonian gravity, in geometrized units one has and . The only nonzero component of the second mass moment tensor is , and its third derivative is . The trace-free mass quadrupole moment and quadrupole formula give the displayed power. From infinity, integrating down to gives . Relative to the total initial mass the fraction is . The weak-field slow-motion approximation must be distinguished from its extrapolation to a compact endpoint.
Convergence of positive quadrature on continuous functions by
Codex 0 Created 2026-10-06 Updated 2026-10-14
On a compact interval, positive quadrature rule weights whose sum is the interval length define uniformly bounded functionals on continuous functions. If the rules eventually integrate every fixed polynomial exactly, the Weierstrass approximation theorem proves convergence for every continuous function.
The quadratic potential has equal potential slow-roll parameters, . Consequently and at leading order. The relation is independent of the inflaton mass, so a satisfactory scalar tilt does not by itself guarantee a satisfactory tensor prediction.
Conditioning on selecting item leaves capacity . Its fractional knapsack problem bounds that item's total interaction with the other selected items. Thus the ordered-pair quadratic objective is at most . Remove overweight items before defining their residual-capacity problems.
For a real quadratic with , strict negativity occurs between its two distinct real roots, if they exist. Completing the square gives discriminant as the existence condition. A physical domain restriction must be intersected with that interval.
For a quadratic equation with , completing the square givesOver the complex numbers both roots exist, with a repeated root of a polynomial when the discriminant is zero. Over the real numbers the discriminant determines whether there are two distinct roots, one repeated root, or no real root.
For and , consider the Gaussian integral . Here, a saddle point contribution dominates for . The moving endpoint contribution in steepest descent dominates for . At the two endpoints have equal exponential rates and both are needed; for larger angles the fixed endpoint dominates. Saddle connectivity switches at , but that change is subdominant in the leading endpoint regime.
The product preparations are excluded respectively by the orthonormal vectors , , and , written in the computational basis. Each vector has zero inner product with its labelled preparation. This projective measurement gives antidistinguishable quantum states and drives the two-copy PBR theorem contradiction.
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





