Alphabeta Math
TheoremStatement: 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.

The sheaf axiom is the equalizer condition on a cover

Statement

Let F be a presheaf of sets on a topological space X. Then F is a sheaf if and only if, for every open set U⊆X and every open cover U=⋃i∈IUi, the restriction map e:F(U)⟶∏i∈IF(Ui),e(s)=(s∣Ui)i∈I, is an equalizer of the two maps d0,d1:∏i∈IF(Ui)⇉∏(i,j)∈I×IF(Ui∩Uj), defined by d0((si))=(si∣Ui∩Uj)i,j,d1((si))=(sj∣Ui∩Uj)i,j.

Facts & Assumptions

Given: A presheaf F, an open set U, and an open cover U=⋃i∈IUi.

[L1]

A sheaf is exactly a presheaf satisfying locality and unique gluing for every open cover (A sheaf on a topological space).

[F1]

The notation s∣Ui and si∣Ui∩Uj is the presheaf restriction notation (Sections, restrictions, and global sections of a presheaf).

[L2]

An equalizer of parallel maps f,g:A⇉B is a morphism e:E→A with fe=ge such that any h:T→A with fh=gh factors uniquely through e (Equalizers and coequalizers as limits and colimits of a parallel pair).

Proof

technique · direct
1.1L1F1

Assume F is a sheaf. For any s∈F(U), the two families d0(e(s)) and d1(e(s)) are equal because both entries on Ui∩Uj are the common restriction s∣Ui∩Uj by [F1]. Thus d0e=d1e.

1.2L1L2F1

Let (si)i∈I∈∏iF(Ui) satisfy d0((si))=d1((si)). Unwinding the definitions, this says exactly that si∣Ui∩Uj=sj∣Ui∩Uj for all i,j. By the gluing clause of [L1], there exists a unique s∈F(U) with s∣Ui=si for all i. Hence every equalizing family factors uniquely through e, so [L2] shows that e is an equalizer.

2.1L1L2F1∎

Conversely, assume e is an equalizer for every open set and cover. If s,t∈F(U) satisfy s∣Ui=t∣Ui for all i, then e(s)=e(t). Let ∗ be a singleton and define h:{∗}→∏iF(Ui) by h(∗)=e(s)=e(t). Then d0h=d1h, so [L2] gives a unique u:{∗}→F(U) with eu=h. The two maps sending ∗ to s and to t both satisfy this condition, hence are equal and therefore s=t. So locality holds. If (si) is a compatible family on the cover, then d0((si))=d1((si)), so [L2] yields a unique s∈F(U) with e(s)=(si). That is exactly unique gluing. Therefore [L1] implies that F is a sheaf.

Depends on

Used by

Dependency tree · two levels

5 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