Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Such a quantum state remains an eigenstate of for every control input. Its projector commutes with all available generators, so its population is conserved. This obstructs full-space pure-state controllability even when the orthogonal bright subspace can be controlled. An instantaneous dark state of a slowly varying Quantum Hamiltonian instead supports adiabatic quantum control if a spectral gap and slowness condition are maintained.
For , let be the upper branch , oriented left to right. Above , lies in the lower half-plane, where a decaying half-line Fourier transform is analytic. For , closing upward proves that the displayed integral vanishes. An additional multiplier analytic above with at most polynomial growth is allowed, using exponential decay and, if needed, regularized contours. This supplies a null term in a Fokas method inversion formula without changing the function in the interior.
For , the Half-range Fourier transform is holomorphic in the lower half-plane. Let , and , with their boundaries oriented counterclockwise. The rotated arguments on and on remain in the lower half-plane. For and transform-admissible smooth decay, the Cauchy integral theorem and Jordan lemma give the displayed null integrals. Arbitrary multiples can therefore be added to Fourier inversion without changing the recovered function on the positive half-line.
// Target: integrable-systems.bigb
In a real normed vector space with a specified countable dense subset, a bounded linear functional on any vector subspace admits a norm-preserving extension without the axiom of choice. Add the dense vectors one at a time using the supremum endpoint in the one-dimensional dominated extension of a real linear functional. This makes the recursion deterministic. Extend from the resulting dense subspace by continuity, using the least index in the dense list which approximates a given vector to within .
If is a sublinear functional, a superlinear functional and on a real vector space, there exists a linear functional between them. More generally, a linear functional on a subspace extends with this domination whenever for all ambient and subspace . In a one-dimensional extension the admissible values for a sandwich extension form a nonempty real interval. Positive homogeneity checks the extension on both signs of the new coordinate. Chain unions preserve linearity and the mixed domination, so Zorn's lemma gives a maximal extension, whose domain must be the whole space. Finally in the mixed inequality gives the upper bound; using the pair gives the lower bound. Conversely, any linear between obeys the mixed inequality by .
Convex domination form of the Hahn-Banach theorem by
Codex 0 Created 2026-10-14 Updated 2026-10-25
A linear functional dominated by a finite real convex function on a vector subspace extends with the same domination to the whole real vector space. To add , choose between the supremum of and the infimum of , over and . Convexity, applied to , makes every lower candidate at most every upper candidate. The candidates at bound the interval by finite numbers. Chain unions preserve domination, so Zorn's lemma gives a full extension. No homogeneity of is assumed.
For the Hadamard test with a density operator in the auxiliary register, the output control qubit has Pauli Z gate expectation and Pauli Y gate expectation , where . The minus sign comes from the final Hadamard gate, since . Measuring in therefore estimates the imaginary part using the minus-outcome frequency minus the plus-outcome frequency.
A flat reference over adjacent Fock states has overlap with a one-photon shift and with a two-photon shift. These overlaps, obtained by counting shared number states, determine the reduced qubit channel of a number-conserving Hadamard interaction. For , its squared fidelity with the desired pure output is for input Bloch vector . Its worst-case infidelity is because . At the two-shift overlap is zero, not , and the fidelity is . Broad coherent number support, rather than merely a large fixed photon number, suppresses distinguishability of the outgoing field states.
A compact smooth h-cobordism of dimension at least six between connected simply connected closed manifolds is diffeomorphic to a product, relative to its incoming boundary. The boundary manifolds consequently are diffeomorphic. The dimension and simple-connectivity hypotheses are sufficient conditions, not necessary properties of a product cylinder. The two boundary inclusions being homotopy equivalences are necessary for a trivial cobordism.
For a spherical cell with its centre of mass displaced by from its geometric centre, gravity produces torque . Rotational resistance gives angular velocity . Taking its cross product with gives the displayed orientation equation with . Steady orientation therefore requires the two terms on the right to sum to zero; placing the vorticity term alone on the other side changes its sign.
For orientation probability density on the unit sphere, deterministic drift and isotropic rotational diffusion coefficient give . The derivatives are tangential to the sphere, and normalization is . The spherical divergence of is .
For fluid velocity and , the stable deterministic orientation is . Once this orientation has relaxed, swimming at speed shifts the centre of the circular material trajectories to in the plane. Its distance from the cylinder axis is . General initial orientations produce an orientation transient before these circular paths.
For a bottom-heavy spherical swimmer in axial flow , the bottom-heavy spherical-cell orientation dynamics with aligning rate gives , . On the upward-stable branch , the cells tilt inward in a downward Poiseuille flow. Zero radial cell flux with scalar diffusivity gives , . For , integration and the average normalization give the displayed concentration. A steady deterministic orientation requires ; beyond this shear threshold the stationary orientation closure fails.
For one marked element among candidates, set . The first nonnegative Grover search algorithm iteration count attaining marked probability at least is the displayed integer. Before the first success interval, the angle is below ; entering that interval requires . Rounding up gives an angle less than , so it cannot skip the interval. Moreover . For , the known candidate is already the answer and no iteration is needed; the two-dimensional marked--unmarked plane degenerates.
If the marked fraction is and , the success probability after Grover search algorithm iterations is . For , its first value at least occurs atBefore this integer the angle is below , so success is below . At this integer, the angle lies in , contained in , where squared sine is at least . If , no iteration is needed. For small , is asymptotic to .
Smooth representation of a locally profinite group by
Codex 0 Created 2026-10-14 Updated 2026-11-05
A complex group representation is smooth when every vector is fixed by some compact-open subgroup. Equivalently each vector's stabilizer is open. Smoothness is local constancy of orbit maps with the vector space regarded discretely, not ordinary continuity into a finite-dimensional complex topology.
Distinct-character extensions of an abelian group split by
Codex 0 Created 2026-10-14 Updated 2026-11-05
A two-dimensional representation of an abelian group fitting into an extension of two distinct linear characters splits. Choose an element on which the linear characters differ. Its matrix has two distinct eigenvalues, and all commuting group operators preserve its two eigenlines. Those eigenlines supply the two invariant linear character summands. The argument does not apply when the two linear characters coincide.
If a representation has one-dimensional endomorphism algebra, it cannot be a direct sum of two nonzero invariant subspaces: the two coordinate projections would be independent endomorphisms. This obstruction does not require either summand to be irreducible, and does not assert that scalar endomorphisms alone imply irreducibility.
A representation over the rational numbers is a group representation on a finite-dimensional rational vector space. Choosing a basis gives rational matrices. It differs from a rational representation of an algebraic group, where rational refers to regular matrix-coefficient functions rather than the ground field. Scalar extension yields representations over every characteristic-zero field.
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





