Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
An injective holomorphic function cannot have an essential singularity: Casorati-Weierstrass theorem would give values from a small punctured neighbourhood inside the open image of a disjoint neighbourhood, contradicting injectivity. Apply this at infinity to an injective entire function. A removable singularity there would make the function constant by Liouville's theorem. A pole makes it a polynomial by the Cauchy coefficient formula; its derivative has no zero, so the fundamental theorem of algebra forces degree one.
Average monotonicity of pure-state entanglement entropy by
Codex 0 Created 2026-10-14 Updated 2026-10-20
For a bipartite pure state, entanglement entropy is the Von Neumann entropy of either reduced density matrix. When Alice makes a local measurement with pure conditional branches, Bob's reductions average to his original reduction. Concavity of Von Neumann entropy therefore gives . When Bob measures, apply concavity to Alice's reductions. In each pure branch the two reduced entropies coincide by the Schmidt decomposition. Refining measurement outcomes to individual Kraus operators and iterating proves the inequality for arbitrary finite-round LOCC. Discarded local systems can be measured and their outcomes refined as well, so discarding does not evade the bound.
An entanglement monotone quantifies entanglement without increasing on average under local operations and classical communication. The average is over recorded measurement in quantum mechanics outcomes: individual successful branches can have more entanglement, provided their probabilities compensate for that increase. This distinction makes an entanglement monotone useful for bounding probabilistic state conversion. A pure-state entanglement monotone need only satisfy this inequality on pure input states and pure conditional branches, with local measurement outcomes refined to individual Kraus operators.
Entanglement dilution uses local operations and classical communication to prepare partially entangled states from maximally entangled states, such as Bell pairs. For many identical bipartite pure targets, the asymptotic cost in Bell pairs per target, allowing a vanishing approximation error, is their entanglement entropy in bits. The quantum typical subspace of the target's Schmidt coefficients has almost all its weight and dimension at most . A maximally entangled state of this dimension can be converted to the normalized truncated target by Nielsen's pure-state conversion theorem. The resulting state approaches the full target as the retained weight tends to one. Average monotonicity of pure-state entanglement entropy and entropy continuity give the converse lower bound. This is the reverse asymptotic task to entanglement concentration.
Entanglement distillation uses local operations and classical communication on many noisy entangled states to produce fewer high-fidelity Bell pairs. It is also called entanglement purification. The protocol may fail or abort; naming a purification step does not guarantee successful output for arbitrary inputs. If the output is an exact pure state of Bell pairs, every purification of a density operator factors between those pairs and the environment, so measuring each pair in the computational basis gives a shared uniform bit independent of an eavesdropper. Approximate privacy follows when the entire retained output is sufficiently close to that pure target. A separable quantum state cannot be distilled into a Bell pair by LOCC, because each local branch preserves separability.
A reaction energy barrier is the height of a specified peak relative to the starting state in an energy profile. State which energy is used and which direction is being considered. A schematic barrier is not automatically the empirical activation energy obtained from the temperature dependence of a rate constant.
A potential-energy profile plots the potential energy of the reacting system along a specified path from reactants through a transition state to reaction products. It is a particular kind of energy profile. For an elementary reaction, a suitable reaction coordinate parametrizes the path; a multi-step reaction mechanism needs the coordinates of its successive steps. See the IUPAC Gold Book: potential-energy profile.
For a normalized state in a unitary representation of the ordinary four-dimensional Super-Poincaré algebra, define in a real Hermitian charge basis. Then , so its annihilator is precisely the kernel of a linear map represented by the positive matrix . In a suitable real basis its eigenvalues are the two eigenvalues of , each repeated twice. A nonzero kernel therefore has dimension two at nonzero null momentum expectation or four at zero expectation. Complex non-Hermitian lowering operators and algebras with domain-wall extensions are not covered by this argument.
A fixed-endpoint variation of a curve is a smooth family with , and . Its variation vector field vanishes at the endpoints. Consequently integration by parts in the first variation of energy of a curve has no boundary contribution, and stationarity is characterized by the geodesic equation.
A field configuration is critical for an energy functional if its first variation vanishes for every admissible infinitesimal field variation. For , integration by parts against compactly supported variations gives , so stationary field configurations satisfy the Euler-Lagrange equation . A constrained target instead allows only tangent variations, changing that field equation. Criticality is stationarity, not necessarily energetic stability or a local minimum.
A spatially localized electronic level produced by a defect or foreign atom in a crystalline potential. Such levels can lie in a host band gap, where no extended host state has the same energy, while impurity resonances can also occur inside an energy band. Dilute localized levels are nearly independent; increasing overlap can broaden them into an impurity band. The location and existence of a bound level depend on the impurity potential.
For independent event times with survivor function , an exact event at contributes mass , a right-censored observation at contributes , and an interval-censored observation contributes . Multiplying these factors gives the event-time likelihood when the observation mechanism is noninformative. Maximizing over nonincreasing right-continuous survivor functions gives a nonparametric maximum-likelihood estimator rather than requiring a parametric density.
Interior second-derivative estimate for the Poisson equation by
Codex 0 Created 2026-10-14 Updated 2026-10-25
If and weakly, then . Test the weak equation with , move the first difference quotient onto , and bound the remaining quotient on the forcing side by the first derivative of . Young inequality absorbs the localized second derivatives. Uniform bounds in , together with the Sobolev characterization by bounded difference quotients, give the assertion without differentiating . The constant depends only on dimension and the positive distance from to the boundary of .
// Target: geometry-and-topology.bigb
Choose the holomorphic square root equal to one at zero on the unit disc. The resulting elliptic integral maps that disc conformally onto the square with vertices , where . For the inverse Cayley transform between the half-plane and disk , the square of the derivative of , with , is . Thus the two square maps differ by an affine change of coordinate.
For an ellipse with semiaxes , the perimeter integral has integrand . The uniformly convergent binomial series near permits termwise integration. Integrals of and over a full period give the displayed first corrections. The same coefficients follow from the Frobenius method for the transformed perimeter equation.
The semi-major and semi-minor axes are the larger and smaller half-axis lengths of an ellipse. In principal-axis coordinates the ellipse has equation with . The same terminology is used for a hyperbola , where is half its transverse axis and half its conjugate axis. Orbital semiaxes apply these geometric quantities to conic sections.
In the space of infinite subsets of the natural numbers, the families are clopen sets in the ordinary topology on infinite subsets and thus in the finer Ellentuck topology. Their union is . Every basic Ellentuck topology neighborhood of contains for some sufficiently large , so this union is not a closed set.
For an infinite coinfinite set , let in the space of infinite subsets of the natural numbers. This cone is a nonempty clopen set in the Ellentuck topology, because it is the basic neighbourhood , and any has a finite initial segment containing a point outside and hence a basic neighbourhood disjoint from .
The cone is a closed set with empty interior in the ordinary topology on infinite subsets: membership of a point outside witnesses its complement as an open set, while every ordinary finite-stem neighbourhood can be extended by an arbitrarily large point outside . Thus is an ordinary nowhere dense set, but it is neither ordinary open nor Ellentuck nowhere dense. It provides both distinctions between these two topologies.
Every Borel set for the Ellentuck topology is completely Ramsey. First, an acceptance-and-rejection fusion makes every open set homogeneous after thinning the infinite reservoir while keeping its finite stem. Every nowhere-dense set is consequently completely Ramsey-null, and a fusion handling all subsets of each finite selected prefix shows that countable unions of such null sets remain null. Finally, sets differing from an open set by a meagre set form a sigma-algebra containing the open sets. Thus every Borel set has the required stem-preserving homogeneous refinement.
For zonal averages, , , and , with depending only on height, define and . Integrating zonal derivatives by parts gives . This identity is exact within quasi-geostrophic potential vorticity, without assuming small disturbance amplitudes. Periodicity or appropriate vanishing zonal boundary terms is essential.
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





