Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-generatedprecheck 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.

A set-valued skyscraper sheaf and its stalks

Example

Fix a point x0∈X and a set A. Define a presheaf Sx0,A by Sx0,A(U)={A,x0∈U,{∗},x0∉U, with identity restrictions between opens containing x0 and the unique map to {∗} when the target does not contain x0. Then Sx0,A is a sheaf. Its stalk at x0 is canonically A, and its stalk at any y∈X with an open neighbourhood V satisfying x0∉V is the singleton {∗}. In particular, this holds for every y≠x0 in a T1 space.

Facts & Assumptions

Given: A point x0∈X, a set A, and a point y∈X. For the second stalk computation, also assume y has an open neighbourhood V with x0∉V.

[L1]

The sheaf condition is locality and unique gluing on open covers (A sheaf on a topological space).

[F1]

Stalks are colimits over neighbourhoods, and germs are represented by local sections (The stalk of a presheaf at a point, Germs of sections).

Verification

technique · direct
1.1L1given

If an open set U does not contain x0, then every section of Sx0,A(U) is the unique element ∗, so locality and gluing are trivial. If x0∈U and U=⋃iUi, then at least one Ui contains x0. Compatibility forces all sections on such Ui to be the same element of A, and every Uj not containing x0 contributes only the unique section ∗. Thus there is a unique glued section on U. Therefore [L1] holds and Sx0,A is a sheaf.

1.2F1given

For the stalk at x0, every neighbourhood of x0 has section set A and every transition map is the identity on A. Hence the colimit in [F1] is canonically A.

2.1F1given∎

If y has an open neighbourhood V with x0∉V, then every smaller neighbourhood of y inside V also has section set {∗}. Hence the stalk diagram is eventually constant at {∗}, so [F1] gives (Sx0,A)y≅{∗}.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

7 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