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.

Sheafification preserves stalks

Statement

Let F be a presheaf on a topological space X. For every x∈X, the sheafification map induces a bijection ηF,x:Fx→ ≅ (aF)x.

Facts & Assumptions

Given: A presheaf F on X and a point x∈X.

[F1]

Sheafification is aF=(F+)+ with unit ηF:F→aF (Sheafification of a presheaf).

[L1]

For any presheaf, the first plus construction preserves stalks (The first plus construction is separated and preserves stalks).

[F2]

Equality in a filtered-colimit stalk is eventual on a smaller neighbourhood (Two representatives in a filtered colimit of sets are equal exactly when they become equal at one common later stage).

Proof

technique · direct
1.1L1given

Apply [L1] to the presheaf F. This gives a bijection Fx→ ≅ (F+)x.

2.1L1F2step 1.1

Apply [L1] again, now to the presheaf F+. Since [L1] holds for every presheaf, it yields a bijection (F+)x→ ≅ ((F+)+)x=(aF)x. The reference to [F2] is the same eventual-equality argument used inside [L1] to prove injectivity on stalks.

3.1F1step 1.1step 2.1∎

Composing the bijections of steps 1.1 and 2.1 gives the required isomorphism Fx→ ≅ (aF)x. By [F1], this composite is exactly the map induced by ηF.

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