Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04
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.

Morphisms of sheaves are determined by their maps on stalks

Statement

Let φ,ψ:F→G be morphisms of sheaves of sets on a topological space X. If the induced maps on stalks φx,ψx:Fx⟶Gx are equal for every x∈X, then φ=ψ.

Facts & Assumptions

Given: Two morphisms of sheaves φ,ψ:F→G.

[F1]

A morphism of presheaves is given by component maps compatible with restriction (Morphisms of presheaves).

[F2]

The stalk construction sends a morphism of presheaves to induced maps on stalks, and for every s∈F(U) and x∈U one has (φU(s))x=φx(sx) (Morphisms of presheaves, The stalk of a presheaf at a point, Germs of sections).

[F3]

Two germs at x are equal exactly when their representing sections agree on some smaller neighbourhood of x (The stalk of a presheaf at a point).

[L1]

Sections of a sheaf are equal once they agree on an open cover (A sheaf on a topological space).

Proof

technique · direct
1.1F2given

Fix an open set U⊆X and a section s∈F(U). For every x∈U, the hypothesis φx=ψx and [F2] give (φU(s))x=φx(sx)=ψx(sx)=(ψU(s))x.

2.1F3step 1.1

By [F3], equality of the germs in step 1.1 means that for each x∈U there exists an open neighbourhood Vx⊆U such that φU(s)∣Vx=ψU(s)∣Vx. The sets Vx cover U.

3.1F1L1step 2.1∎

By [L1], the two sections φU(s) and ψU(s) are equal on U. Since U and s were arbitrary, the component maps φU and ψU agree for every open U. Therefore φ=ψ by [F1].

Depends on

Used by

Dependency tree · two levels

9 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