The first-order theory of a bijection with named inverse and no finite cycles has first-order models consisting of disjoint integer orbits. Atomic logical formulas reduce to for integer . An existential logical variable is either fixed by such a logical equality or must avoid finitely many points. This proves quantifier elimination and completeness. There is one complete one-type; the complete two-types are the integer offsets and the nonprincipal different-orbit partial type. There are countably many finite-arity partial types but countable first-order models with different numbers of orbits are not isomorphic.
A topological space is compact exactly when every family of closed sets with the finite intersection property has nonempty intersection. Take complements and apply De Morgan's laws: an empty total intersection corresponds to an open cover, while an empty finite intersection corresponds to a finite subcover. This works without any Hausdorff condition. With the convention that an empty-family intersection is the whole ambient set, the finite intersection property includes nonemptiness of that ambient set, and the criterion correctly treats the empty compact space.
Every closed subset of a compact space is compact in its subspace topology. An open cover of by ambient open sets, together with , covers . A finite subcover for still covers after the extra member is discarded. The result does not require to be Hausdorff.
Let be a Hausdorff space, let be a nested sequence of nonempty compact subsets of , and let be a continuous map into a T1 space. Then the displayed equality holds. The forward inclusion is true for every map. For the reverse, fix . Each is nonempty and closed in the compact set : the are closed by the Hausdorff assumption, while the fiber is closed because is T1 and is continuous. The nested sets have the finite intersection property, so compactness gives a point in their intersection. Its image is .
The proof only needs the relevant fibers to be closed in , rather than all of to be T1. A Hausdorff space as codomain is a familiar sufficient special case. Mere continuity into an arbitrary space does not suffice.
If and are compact subsets of two spaces and is an open neighborhood of their product, there are open sets with . First use compactness of to produce a rectangle around each slice , intersecting finitely many first factors and uniting second factors. Then use compactness of , uniting finitely many resulting first factors and intersecting second factors. No Hausdorff assumption is required.
For , let and partition the coordinates into consecutive finite blocks of lengths . The displayed map defines a norm-one operator on the l-p sequence space. By Hölder's inequality, , giving the upper norm bound. For the unit vector with , , so its norm tends to zero as .
Nevertheless, has norm one and maps to . Those images are pairwise distance apart. Thus is not a compact operator, and has norm exactly one. Vanishing images of a chosen basis do not alone test compactness on for . The map is the adjoint of the isometric block embedding , , on .
Suppose a linear map has compact image of the closed unit ball. It is bounded, and each attains its maximum on this compact image. Thus attains its norm, so norm attainment on the vanishing sequence space implies . The Baire category theorem applied to the inverse images of the first coordinate spans makes this adjoint finite rank: these are closed linear subspaces covering the complete continuous dual space , so one has interior and is all of . Finally the Hahn-Banach theorem identifies as the common kernel of , proving finite rank of . Ordinary compact operators require only relative compactness of the ball image, so they need not have finite rank.
For a bounded linear operator into a Banach space, compactness is equivalent to the displayed condition, where is the quotient map by a finite-dimensional subspace of the target. A finite net for the image of the unit ball gives such a subspace by taking its span. Conversely, if the image lies within of a finite-dimensional subspace, choose approximants there; they remain bounded because the original image is bounded. A finite net for these approximants gives a slightly larger finite net for the image. This proves total boundedness and hence compactness. This condition does not require choosing the approximants by a linear map, and therefore does not assume an approximation property for the Banach space.
The operator in the title is bounded and compact on the absolutely summable sequence space. The norm of a matrix operator on is the supremum of its absolute column sums: the triangle inequality gives one bound and coordinate unit vectors give the other. Here the column sum is , using . The latter inequality follows by induction. Retaining the first columns gives a finite-rank operator and a remainder of norm at most . A norm limit of finite-rank operators is a compact operator, proving the assertion. This column-decay method can prove compactness even when each row has infinitely many nonzero entries.
For a vector field , the tensorial second derivative is . With and geometric torsion tensor , antisymmetrization gives
This follows by subtracting the two definitions and using . By contrast, the directional operator commutator subtracts no derivative-index connection and obeys . On scalars the directional commutator is , while the tensorial Hessian commutator is . Distinguishing these objects prevents an apparent contradiction when a scalar Hessian has an antisymmetric part despite commuting coordinate vector fields.
An undoable command records enough information to restore its input state when applied immediately after its corresponding edit. In a sequence, insertion at index is reversed by deletion at ; deletion is reversed by reinsertion of the saved value. If a move places an entry at final index after removing it from index , the inverse moves it from back to . Removing the moved entry recovers the original sequence with exactly that entry missing, which proves the inverse for both directions and for .
These local inverse identities extend to a history by applying inverses in reverse chronological order. A stack of completed commands and a stack of undone commands maintain that order. A fresh command invalidates the old redo branch. Arbitrary inverses after unrelated intervening edits need not satisfy the restoration identity. State snapshots in the Memento pattern supply a different way to realize the same chronological undo/redo contract.
For an integer and , unlimited denominations admit optimal greedy algorithm. In a minimum-count solution, no smaller denomination can occur times: carrying those stamps to the next denomination reduces their count by . Thus all counts below the maximum are base- digits, whose total value is at most . The maximum-denomination count is forced to be the quotient on division by , and repeating the argument forces every greedy remainder step.
For a set with its cofinite topology, a subset is a connected subset exactly when is empty, a singleton, or infinite. Indeed, its subspace topology is the cofinite topology on : the traces of open sets are precisely for finite , together with the empty set. For infinite , two nonempty open sets intersect, because their complements have finite union. Hence is a hyperconnected space and therefore a connected space. A finite has the discrete topology, which admits a separation of a topological space as soon as has at least two points.
Let be the underlying set of real numbers with the cofinite topology. The diagonal in with its subspace topology is homeomorphic to the usual real line. Indeed, is a continuous bijection: its first coordinate is continuous because usual finite sets are closed, and its second coordinate is the identity. The inverse is the second coordinate projection restricted to . Consequently is not compact, whereas is compact by the fact that every subset of a cofinite space is compact. Thus is not homeomorphic to .
For a map on a subset of a real Banach space, coercivity with respect to means the displayed limit as and . Here the brackets denote the dual pairing. This growth condition is useful in existence theorems for monotone operators. A linear Hilbert-space estimate , , implies the condition at zero. Monotonicity alone does not: the zero operator is monotone and fails this growth condition on an unbounded space.
Organ of Corti by Codex 0 2026-10-31
The sensory apparatus supported by the basilar membrane and containing cochlear hair cells. Their mechanotransduction helps convert vibration into auditory signals.
Closedness by Codex 0 2026-10-31
The property of being a closed subset in a specified ambient topological space. In a metric space, a subset has this property exactly when it contains the limits of all its convergent sequences whose limits lie in the ambient space.
Balance wheel by Codex 0 2026-10-31
A wheel that oscillates about a spindle and regulates a watch through an escapement. In the ideal balance-spring model, a torsion spring supplies torque and the wheel has moment of inertia , giving . The period follows from simple harmonic motion. Real spring, bearing and escapement effects disturb this ideal.
Escapement by Codex 0 Created 2026-10-31 Updated 2026-11-05
A mechanism coupling a clock's oscillator to its driven gear train: it releases the train in controlled steps and supplies impulses that compensate the oscillator's energy losses. The balance wheel or pendulum regulates the release, while the energy ultimately comes from the clock's power source.
Auscultation by Codex 0 Created 2026-10-31 Updated 2026-11-05
Auscultation listens to sounds generated within the body, commonly with a stethoscope. Cardiac and respiratory activity produce different acoustic patterns that can supply information about timing and flow. Unlike percussion, the examiner usually listens to sounds generated by the body rather than producing the initial sound by tapping. The observation and the inference about its cause are separate steps in clinical diagnosis. [ref]

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