Borel measure Created 2026-09-24 Updated 2026-09-28
A Borel measure on a topological space is a measure defined on the sigma-algebra generated by the open sets, equivalently on the Borel sets.
Borel set Created 2026-09-24 Updated 2026-09-24
Borel sigma-algebra Created 2026-09-29 Updated 2026-10-03
The Borel sigma-algebra of a topological space is the sigma-algebra generated by its open sets. Its members are exactly the Borel sets.
Chronological future Created 2026-10-05 Updated 2026-10-06
The chronological future of a subset of a spacetime is the set of points reachable from by future-directed timelike curves. The chronological future is an open set.
Clopen set Created 2026-09-28 Updated 2026-10-06
Closed set Created 2026-09-24 Updated 2026-10-06
Every compactly supported distribution on an open set is a finite sum with continuous compactly supported inside . One can first write for a continuous global convolution primitive, then multiply by a cutoff function equal to one near the support. The identity localizes every coefficient. Finite global representation can fail for a distribution of unbounded order.
Cylinder set Created 2026-10-05 Updated 2026-10-07
A cylinder set in a product of spaces restricts a finite collection of coordinates and leaves all other coordinates free. It has the form , where is the coordinate projection onto the finite subproduct. Taking to be a product of open sets gives the basic open cylinders for the product topology. In a finite-alphabet full shift, specifying exact letters at finitely many coordinates gives a clopen set.
Discrete space Created 2026-09-24 Updated 2026-10-03
Every open set in Cantor space is a countable disjoint union of prefix cylinder sets. Select all finite words whose cylinder lies in the open set but whose immediate predecessor's cylinder does not. These words are prefix-free, so their cylinders are disjoint. Every point of the open set has a shortest qualifying prefix. The whole space is represented by the empty prefix.
Fusion proof for open Ellentuck sets Created 2026-10-05 Updated 2026-10-07
Every open set in the Ellentuck topology is a completely Ramsey set. Fix a finite stem . An infinite tail accepts a finite extension if its entire basic neighborhood lies in the open set; it rejects if no infinite subtail accepts it. Decisions persist under thinning. A fusion chooses an infinite set deciding every finite extension. For any rejected extension, only finitely many possible next elements can yield accepted extensions, since infinitely many would themselves provide an accepting tail. A second thinning therefore makes all finite extensions rejected. Openness then rules out any point of the set in the resulting neighborhood.
Holomorphic function Created 2026-09-24 Updated 2026-10-06
Indiscrete topology 2026-10-06
Interior (topology) Created 2026-09-29 Updated 2026-10-03
Line bundles trivialized by an open cover 2026-10-06
A line bundle trivial on each open set is determined by unit-valued transition functions on pairwise intersections. Their cocycle identities make the local trivial bundles glue; changing frames changes the cocycle by a coboundary. The tensor product of sheaves multiplies the transition functions, giving the displayed group isomorphism with Čech cohomology.
Locally connected space Created 2026-10-05 Updated 2026-10-06
A topological space has local connectedness when every point has a neighborhood basis of connected open sets. In particular, a planar domain has local connectedness, but its domain boundary need not be. Local connectedness of the boundary is the condition governing a continuous extension of a conformal bijection to the parametrizing circle.
Morphism of sheaves Created 2026-10-05 Updated 2026-10-07
A morphism of sheaves assigns a map on every open set, commuting with all restriction maps. For sheaves of abelian groups, sheaves of rings or sheaves of modules, the maps must also preserve the relevant algebraic structure. It induces maps on every stalk, and equality of sheaf morphisms can be checked there.
Open determinacy 2026-10-06
An infinite game of perfect information with an open set of winning plays for I in the product topology on a discrete move set has a winning strategy in an infinite game for one player. Construct a winning-position attractor in an infinite game by transfinite recursion; ranks give I a terminating descent strategy inside it, and its complement gives II a strategy avoiding every winning prefix. The move set need not be countable, in the usual set theory with axiom of choice.