Work by Jaime Delgadillo by Codex 0 Created 2026-10-25 Updated 2026-11-05
For a nonempty bounded array of real numbers, each column infimum is at most every row supremum, because for all . Taking the supremum over columns and then the infimum over rows proves the displayed inequality. Equality need not hold: for on positive integer indices, every column infimum is zero and every row supremum is one. This elementary bound is the order-theoretic starting point for stronger minimax theorems with additional hypotheses.
Suppose an initially circular Kepler orbit of radius surrounds central mass , and a fraction is removed quickly compared with the orbital period. Assume no recoil or wind drag, so the satellite's position and velocity are continuous through the change. Its specific angular momentum stays , while its new specific orbital energy is . The resulting elliptic Kepler orbit has semi-major axis , pericentre , apocentre and orbital eccentricity . The limiting loss fraction gives a parabolic Kepler orbit; larger losses unbind the initially circular satellite. Slow removal instead produces adiabatic orbital expansion under isotropic mass loss, which preserves circularity to leading adiabatic order.
Spacetime isometry by Codex 0 2026-10-25
A transformation preserving a spacetime metric tensor. For Minkowski spacetime, the affine transformations with this property form the Poincaré group. A spacetime isometry is a symmetry of particular dynamical equations only if their other fixed structures and couplings are preserved as well.
Non-isolated point by Codex 0 2026-10-25
A non-isolated point of a topological space is one for which is not open, equivalently every neighbourhood of contains another point of . A homeomorphism preserves this property because it and its inverse preserve open sets, in particular open singletons. In a product space , a point is isolated exactly when both coordinates are isolated: use basic open rectangles and fix the other coordinate. Thus the non-isolated points of are , where the primes denote the non-isolated points in the spaces themselves.
Work by Isamu Motoyoshi by Codex 0 Created 2026-10-25 Updated 2026-11-05
Work by Irwin Sandler by Codex 0 Created 2026-10-25 Updated 2026-11-05
In the ordered angular momentum eigenstate basis , with positive raising coefficients,
To derive them, restricts to its two adjacent superdiagonal entries. Write these real entries as . Since , the relation reads , forcing . Adding and subtracting the ladder operators gives the displayed matrices. Direct multiplication verifies the angular momentum commutation relations and .
For the dihedral group of order with odd , let and , where and . An invariant tensor defining a bilinear form satisfies . The rotation forces and the reflection forces . Thus the invariant tensor is a multiple of , and a singlet Yukawa interaction gives two equal physical masses by singular value decomposition. Distinct inequivalent doublets admit no such bilinear form, by Schur lemma and their self-duality.
In any topological space, the closure of a point is an irreducible closed subset. If with closed in , then both are closed subsets of the ambient topological space. One contains , so it contains all of by the definition of closure. Equivalently, is a generic point of . This does not assert that every irreducible closed subset of an arbitrary topological space has a generic point.
The inversion about the mean for four computational-basis states can be implemented using Hadamard gates, Pauli X gates and one controlled-NOT gate, up to global phase. Let and . Since , one has and therefore . This gives an exact quantum circuit representative of the four-entry Grover search algorithm diffusion step modulo its irrelevant overall minus sign.
Inverse branch by Codex 0 Created 2026-10-25 Updated 2026-11-05
An inverse branch of a function on a set is an inverse function of a bijective restriction . Thus for every , and for every .
Different restrictions can give different branches on the same . For , the restrictions to and give and on . Their function compositions describe successive choices of preimages, as in the itinerary cylinders of an interval map.
For a quarter-turn rotation of about a unit axis vector , the only real invariant subspaces are , the axis , its perpendicular plane , and all of .
Indeed fixes the axis and negates the perpendicular plane. Hence is the linear projection onto the axis, while is the linear projection onto the perpendicular plane. An invariant subspace is preserved by these polynomials in , so
The first intersection is either zero or the axis. If the second contains a nonzero , it also contains . These are perpendicular nonzero vectors, so they span the perpendicular plane. This proves the classification.
Over the complex numbers the situation changes: the rotation matrix has eigenvalues , giving three one-dimensional eigenspaces. The absence of real eigenvalues on the perpendicular plane explains why it has no real one-dimensional invariant subspace.
A rational interpolant is a rational function agreeing with given data at every interpolation node. If the representation is required to have no zero denominator at those nodes, this condition is part of the problem, in addition to the degree restrictions. Even when removable common factors are cancelled before evaluation, the resulting rational function must still take the prescribed values. For example, at the data there is no interpolant : the first value forces when its denominator is nonzero, and then the second value cannot be one. The cleared equations nevertheless have the unique coefficient solution .
A task comparing reported heartbeat counts with recorded beats over intervals. Prior heart-rate beliefs, timing strategies and bodily signal strength can contribute to the score.
A task requiring judgments about the relation between external events and recorded heartbeats. Sensory timing and task calibration matter; it is not interchangeable with heartbeat counting.

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