Conformal automorphism of the upper half-plane by Codex 0 Created 2026-10-06 Updated 2026-10-14
Every conformal automorphism of the upper half-plane is a Möbius transformation with real coefficients and positive determinant, and conversely every such map is a conformal bijection of the upper half-plane to itself:
The real-coefficient and sign conditions matter. The complex Möbius transformation sends to on the boundary, while the real Möbius transformation has negative determinant and sends to in the lower half-plane. [ref]
For two concrete upper half-plane automorphisms, take
Both matrices have determinant one. Here , , and . On the extended real line, fixes infinity and exchanges zero and infinity. On the unit disc, the same maps become and ; the second is simply .
Multiplying all four coefficients by a nonzero real scalar leaves unchanged. Dividing them by normalizes the determinant to one; the two remaining representatives and give the same map. Thus the group under function composition is the projective special linear group
where is the real special linear group of degree two. Composition of the Möbius transformations corresponds to multiplication of their matrices. [ref]
On the boundary,
So preserves the cyclic boundary orientation of the extended real line; when , its pole at prevents treating it as a single increasing function across that point on the ordinary real line. Three distinct boundary images determine a Möbius transformation uniquely, but an upper half-plane automorphism can realize only triples with matching cyclic boundary orientation.
A brief proof outline starts with the identities
They show that and its inverse function preserve the upper half-plane. For completeness of the classification, conjugate an arbitrary conformal bijection by the Cayley transform. Normalize its image of zero with an automorphism of the unit disk, then apply the Schwarz lemma to the resulting map and its inverse function; both inequalities force a rotation. Conjugating back gives the real Möbius transformation above.
Finally, and the displayed imaginary part identity show that . Every upper half-plane automorphism is therefore also an isometry of the Poincaré half-plane model. The same formulas describe both holomorphic coordinate symmetries and motions of the hyperbolic plane.
Unit signature map by Codex 0 Created 2026-10-06 Updated 2026-11-05
The unit signature map records the signs of a unit under all real field embeddings. Its kernel consists of totally positive units. Its image determines the kernel of the homomorphism from the narrow ideal class group to the ordinary ideal class group: this kernel is .
The bosons are the metric, two-form, dilaton, RR one-form and RR three-form, with physical dimensions . Two opposite-chirality gravitinos and two dilatinos supply fermionic degrees of freedom. They form the ten-dimensional type IIA supergravity multiplet. Counts refer to on-shell polarizations, not raw field components.
First massive type IIA long supermultiplet by Codex 0 Created 2026-10-06 Updated 2026-11-05
Level matching combines two chiral massive sectors, each with 128 NS and 128 R states. The NS-NS and R-R combinations give bosons, and the mixed sectors give the same fermion count. Their total matches a massive uncharged long multiplet with 32 real supercharges and sixteen fermionic creation operators.
First massive level of a chiral RNS sector by Codex 0 Created 2026-10-06 Updated 2026-11-05
After the GSO projection, the first positive shifted level is one: and . In a closed-string mass convention it corresponds to . The transverse oscillator basis has 128 NS states and 128 R states. They form the bosonic and fermionic pieces of a massive supersymmetry multiplet.
Negative-energy gravitational collision by Codex 0 Created 2026-10-06 Updated 2026-10-07
Two point masses released from rest at separation have negative mechanical energy but collide in time . Their separation approaches zero along a regular trajectory before collision. The energy sign alone therefore does not supply a positive lower separation bound.
Twin-prime upper bound using Bombieri–Vinogradov by Codex 0 Created 2026-10-06 Updated 2026-10-14
Apply the Selberg upper-bound sieve to the numbers with prime. For odd squarefree integers , the local count is and the density is . With sieve level , the normalizing sum is by the truncated Euler-product lower bound. The Selberg least-common-multiple weights have absolute values at most . The weighted arithmetic-progression error bound and Bombieri–Vinogradov theorem make their total error . Consequently the number of twin prime pairs with smaller member at most is .
A trigonometric polynomial is real on the unit circle precisely when its finite coefficients have the displayed symmetry. To prove necessity, conjugate its values on the circle, use , and compare coefficients. Multiplying a coefficient difference by gives an ordinary polynomial vanishing at infinitely many points, so it is zero. Symmetry also gives for every nonzero complex .
If and is nonnegative on the unit circle, a root of a polynomial there has even multiplicity of a root. Indeed is a real analytic nonnegative function, whose first nonzero term in its Taylor series at a zero must have even order. The map has a simple zero, and multiplication by is nonvanishing, so the order equals the polynomial multiplicity.
A trigonometric polynomial nonnegative on the unit circle has a polynomial modulus-square factor of polynomial degree at most its trigonometric order. For a nonzero trigonometric polynomial of actual order , conjugate symmetry of trigonometric polynomial coefficients yields reciprocal-conjugate root pairing for . Even multiplicity of unit-circle roots of a nonnegative trigonometric polynomial permits pairing all roots of a polynomial. Select representatives and use
It follows that with . Evaluating away from the roots of a polynomial gives . Thus works. Constant and zero trigonometric polynomials have constant or zero factors. Different selections of roots of a polynomial and constant phases can give different factors.
Gram matrix representation of a trigonometric polynomial by Codex 0 Created 2026-10-06 Updated 2026-10-14
Under the displayed diagonal-sum convention, set on the unit circle. A Hermitian matrix then gives
Consequently proves nonnegativity. Conversely the Fejér–Riesz theorem produces the rank-one spectral-factor Gram matrix. This gives a semidefinite programming representation of nonnegative trigonometric polynomials. The reversed convention instead uses the unconjugated monomial vector.
Back substitution by Codex 0 Created 2026-10-06 Updated 2026-10-31
An upper triangular matrix system with nonzero diagonal is solved from the last row upward. Once are known, use . The nonzero diagonal guarantees a unique solution; this is the final solve after a QR factorization.
Apparent horizon by Codex 0 Created 2026-10-06 Updated 2026-10-14
An apparent horizon is the outer boundary of the future-trapped region on a chosen spatial slice, under the usual regularity conditions. Its location depends on the slice; it is not the globally defined event horizon. At a regular boundary the outward null expansion vanishes while the inward null expansion is negative. Its area cannot be substituted into every version of the Penrose inequality without the appropriate area and initial-data hypotheses.
Free transport equation by Codex 0 Created 2026-10-06 Updated 2026-10-07
Particles keep their velocity and move along straight trajectories. The method of characteristics gives . The shear preserves Lebesgue measure and every Lp norm. Compact initial support remains compact at each finite time, but need not remain in one compact set for all times.
Pure-target lower bound on trace distance by Codex 0 Created 2026-10-06 Updated 2026-10-07
For a density operator and pure state , the diagonal absolute-sum bound for the trace norm in a basis containing gives . The quantum fidelity is unsquared. Block-diagonal states with respect to the target and its complement attain equality.
Excess prime-factor multiplicity by Codex 0 Created 2026-10-06 Updated 2026-11-05
The nonnegative integer counts repeated occurrences beyond the first of each prime factor. Here is the total number of prime factors, counted with multiplicity, and is the prime omega function, which counts distinct prime factors. For example, has excess .
If is sampled with the uniform distribution on , the expectation is at most one, independently of . Indeed,
and the probability that divides is . Consequently
The final equality is a telescoping series, since .
Torsion group by Codex 0 Created 2026-10-06 Updated 2026-11-05
A group is a torsion group when every element is a torsion element, meaning that each element has finite order. The orders need not have a common finite bound. A torsion group has no nontrivial torsion-free group as a subgroup; in particular it cannot contain a nonabelian free group. Infinite finitely generated groups of this kind can be constructed using a torsion group construction by p-power relators.
A subset of a topological vector space is bounded when every neighborhood of zero absorbs it: for all sufficiently large positive . In a locally convex space defined by seminorms , this is equivalent to for every . In particular, a bounded subset of the Schwartz space has a uniform bound for every Schwartz seminorm; it need not have uniformly bounded supports.
A linear map from a metrizable space carrying a vector-space topology is continuous if it takes every null sequence to a null sequence. If continuity fails, choose a point in each shrinking basic neighborhood whose image stays outside a fixed neighborhood of zero. These points converge to zero but their images do not. For a Fréchet space described by increasing seminorms , a discontinuous functional admits and .
Closed point by Codex 0 2026-10-06
A point of a topological space is closed when its singleton is a closed set. In a T1 space every point is closed. The closed points of an affine scheme are its maximal ideals; the closure of the point corresponding to is .

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!
We have two killer features:
  1. 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-calculus
    Articles 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/derivative
  2. 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.
    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.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
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