Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Orientation local system and orientation cover

Definition

Let M be a boundaryless n-manifold. Its orientation local system has fiber Ox=Hn(M,M{x};Z) at x. Each fiber is infinite cyclic by Local homology detects manifold dimension, interior, and boundary. We specify its topology and transport, rather than treating the pointwise groups alone as a local system.

For a closed coordinate ball K lying in a larger chart ball, put GK=Hn(M,MK;Z) and write rKx:GKOx for restriction, xintK. These maps are isomorphisms by Coordinate-ball classes identify local homology stalks. For every cGK, form the section sK,c(x)=rKx(c) over intK. On the disjoint union O=xMOx, use the images of these sections, restricted to open subsets of their domains, as basic open sets.

Here is the basis and compatibility verification. Every fiber element belongs to such a section because rKx is onto. If sK,c and sL,d agree at x, choose a smaller closed coordinate ball J with xintJ and JintKintL. Such a ball exists by restricting any chart at x to a sufficiently small ball in this open intersection. The two classes restrict to equal classes in GJ: their images in Ox agree and rJx is injective. For every yintJ, functoriality of relative restriction, Functoriality of relative homology, then gives rKy(c)=rJy(cJ)=rJy(dJ)=rLy(d). Thus two sections meeting at a point agree on a neighborhood, which is exactly the basis-intersection property.

It follows also that over intK the map intK×GKdiscOintK,(x,c)rKx(c) is a homeomorphism. It is bijective fiberwise; each sheet is open by the basis construction, and intersection with any other basic section is open by the compatibility just proved. These observations prove continuity in both directions. Fiber addition and negation become the usual operations on the discrete group GK in these coordinates. This locally trivial family of discrete groups, with these group-compatible charts, is the orientation local system.

The orientation cover M~O is the subset of generators of the fibers, with the subspace topology and projection π:M~M. Each GK has exactly two generators c,c, which are distinct in an infinite cyclic group. Thus π1(intK) is the disjoint union of their two open sheets, each mapped homeomorphically to intK. This proves directly that π is a two-sheeted covering map. No global selection of one of its sheets is part of the construction.

Transport along a path γ:[0,1]M is defined as follows. The inverse images of all ball interiors form an open cover of [0,1]. Compactness of the interval and of the square follows from Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line, and Every open cover of a compact metric space has a Lebesgue number: a δ>0 such that every nonempty subset of diameter less than δ lies inside a single member of the cover gives a finite subdivision such that each closed subinterval maps into one ball interior. For a segment with endpoints a,b in that ball, use rKbrKa1. Compose these finitely many isomorphisms in the order of the path.

To verify independence, insertion of a subdivision point in the same ball changes nothing: rKcrKb1rKbrKa1=rKcrKa1. For two different ball assignments on a segment, cover its image by interiors of smaller closed balls inside the intersection of the assigned ball interiors. Pull this cover back to the segment and subdivide again by the Lebesgue number lemma. On each smaller piece the nested-ball identity above identifies both transport rules with that of the smaller ball. After common refinement this proves agreement of any two finite constructions. A constant path gives the identity, reversing a path inverts its transport, and concatenation composes the two transports, by the same refinement rule.

For a homotopy of paths fixing both endpoints, pull the ball cover back to [0,1]2. Choose a square grid with each cell's diameter smaller than a Lebesgue number. The image of each cell lies in one ball interior, so transport along its bottom then right edges equals transport along its left then top edges: both equal the ball's endpoint identification. Successive exchanges across the finitely many cells compare the lower and upper boundary paths, with the outside vertical edges contributing identities because endpoints are fixed. Transport therefore depends only on the endpoint-fixed homotopy class. It preserves generators, so restricts to transport in the orientation cover; in a ball chart the transported element is constant in the discrete coordinate, giving the corresponding continuous lifted path.

For n=0, singleton chart balls give discrete fibers Z and two generator points over each point of M; the same construction applies. Empty M gives the empty local system and empty cover. Disconnected manifolds are handled by the identical local construction on every component. Zero in a stalk is included in O but is never in M~. Every selection needed for a specified path or homotopy is finite; the system itself uses all balls and all their classes. No AC is required.

Depends on

Used by

Dependency tree · two levels

49 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources