Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-sol)audited 2026-09-27
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.

Locally constant functions form a sheaf with constant stalks

Statement

Let X be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison) and let A be a set. A function f:U→A on an open subset U⊆X is locally constant when every x∈U has an open neighbourhood V⊆U with x∈V on which f is constant. Then:

  1. the assignment A‾loc(U):={f:U→A locally constant}, with the usual restriction maps, is a sheaf of sets on X;
  2. for every x∈X, evaluation at x induces a canonical bijection A‾loc,x→ ∼ A,[f]x⟼f(x);
  3. if A is an abelian group, then with pointwise addition A‾loc is a sheaf of abelian groups, the restriction maps are group homomorphisms, and for every open U⊆X the assignment a↦(x↦a) is a group homomorphism A→A‾loc(U) (the zero homomorphism when U=∅).

Facts & Assumptions

[F1]

A presheaf of sets on X is a section set F(U) for every open U and a restriction map ρVU:F(U)→F(V) for every inclusion V⊆U, with ρUU=id⁡ and ρWU=ρWV∘ρVU for W⊆V⊆U (A presheaf on a topological space).

[F2]

A sheaf is a presheaf in which, for every open cover U=⋃i∈IUi, sections agreeing on all members are equal (locality) and compatible local sections glue to a section of F(U) (gluing), the glued section being unique by locality (A sheaf on a topological space).

[F3]

The stalk Fx is described by equivalence classes of pairs (U,s) with U an open neighbourhood of x and s∈F(U), where (U,s)∼(V,t) when s and t agree on some smaller open neighbourhood of x (The stalk of a presheaf at a point).

[F5]

A presheaf of groups on X is a presheaf such that every F(U) is a group and every restriction map is a group homomorphism; a sheaf of groups is such a presheaf whose underlying set-valued presheaf is a sheaf (Presheaves and sheaves of groups, rings, and modules).

[F6]

The category of sheaves of abelian groups on X is an abelian category (Sheaves of abelian groups, and likewise sheaves of modules on a ringed space, form abelian categories).

Proof

Given: A topological space X, a set A, the assignment A‾loc of locally constant A-valued functions, an open cover U=⋃i∈IUi with compatible sections of A‾loc, and a point x∈X.

1.1

A‾loc with the usual restriction maps is a presheaf of sets: the restriction f∣V of a locally constant f:U→A to an open V⊆U is locally constant, since a neighbourhood of y∈V on which f is constant is again a neighbourhood of y in V on which f∣V is constant; and ρUU=id⁡ and ρWU=ρWV∘ρVU hold because both sides are the same function W→A [F1].

F1
1.2

Locality holds: if f,g∈A‾loc(U) satisfy f∣Ui=g∣Ui for every i, then given x∈U the cover provides an index i with x∈Ui, and f(x)=f∣Ui(x)=g∣Ui(x)=g(x); hence f=g as functions.

F2
1.3

For x∈X define evx:A‾loc,x→A by evx[(U,f)]:=f(x), where [(U,f)] denotes the class of a pair. This is well defined: if (U,f)∼(V,g) then f and g agree on a smaller open neighbourhood W of x [F3], so f(x)=g(x); and it is additive in the sense of respecting the group operations when A is an abelian group, since sums are formed pointwise.

F3
2.1

Gluing holds: let fi∈A‾loc(Ui) satisfy fi∣Ui∩Uj=fj∣Ui∩Uj for all i,j. The union of graphs f:=⋃i∈I{(x,fi(x)):x∈Ui}⊆U×A is a function U→A: it is total because the Ui cover U, and it is single-valued because for (x,a),(x,b) in it, say from i and j, compatibility gives a=fi(x)=fj(x)=b. Then f∣Ui=fi, and f is locally constant: for x∈U pick i with x∈Ui and an open V⊆Ui with x∈V on which fi is constant, so that f∣V=fi∣V is constant. No index is selected in the definition of f, the graph being described by a formula. By [F2] with [step 1.2] the presheaf A‾loc is a sheaf of sets, which is clause 1.

F2step 1.2
2.2

evx is surjective: for a∈A the constant function X→A with value a is locally constant, so it is an element of A‾loc(X) whose class maps to a; this uses no selection, the function being given by the formula y↦a.

F3step 1.3
2.3

evx is injective: suppose evx[(U,f)]=a=evx[(V,g)]. By local constancy there are open neighbourhoods U′⊆U and V′⊆V of x with f∣U′ and g∣V′ constant, necessarily with value a because f(x)=g(x)=a; on the open neighbourhood W:=U′∩V′ of x the two functions agree, so (U,f)∼(V,g) by [F3] and the two classes coincide. Hence evx is a bijection for every x∈X, which is clause 2.

F3step 1.3
3.1

Suppose now that A is an abelian group. Pointwise addition makes every A‾loc(U) an abelian group, with the empty function as the zero element over U=∅ and the constant function with value 0 as the zero element over U≠∅; the sum and the negative of locally constant functions are locally constant, because on the intersection of neighbourhoods on which the two functions are constant the sum is constant, and the negative is constant wherever the function is; and each restriction map ρVU is a group homomorphism because (f+g)∣V=f∣V+g∣V and (−f)∣V=−(f∣V) hold pointwise. By [step 2.1] the underlying set-valued presheaf is a sheaf, so by [F5] A‾loc is a sheaf of groups, abelian since addition is pointwise abelian, that is a sheaf of abelian groups, and the category of these is abelian by [F6]. Finally the assignment a↦(x↦a) is a group homomorphism A→A‾loc(U) for every open U, since (x↦a)+(x↦b)=(x↦a+b) pointwise and over U=∅ it is the zero homomorphism to the trivial group. This is clause 3, and the proof is complete. ∎

F5F6step 2.1

Depends on

Used by

Dependency tree · two levels

22 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