Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passaudited 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 constant presheaf need not be a sheaf on a disconnected open set

Statement refuted

Fix a set A with distinct elements a≠b. The constant presheaf A‾pre on a space X, defined by A‾pre(U)={A,U≠∅,{∗},U=∅. with identity restrictions between nonempty opens and the unique restriction to the empty open, is always a sheaf.

Facts & Assumptions

Given: A space X containing a disconnected open set U=U1⊔U2 with U1,U2≠∅, and a set A with a≠b.

[F1]

Identity restriction maps define a presheaf on X (A presheaf on a topological space).

[F2]

The sheafification aF of a presheaf is defined by the double plus construction (Sheafification of a presheaf).

[F3]

The plus construction identifies germ-compatible local presentations when their germs agree at every point (The plus construction for a presheaf).

[L1]

Locally constant A-valued functions form a sheaf (Locally constant functions form a sheaf and have constant stalks).

Counterexample

technique · direct
1.1F1givenconstruct

By [F1], A‾pre is a presheaf. On the disjoint cover U=U1∪U2, choose the local sections s1:=a∈A‾pre(U1) and s2:=b∈A‾pre(U2). Both restrict to the unique element of A‾pre(∅), so the pair is compatible on U1∩U2=∅.

2.1step 1.1given

A glued section over U would have to be an element s∈A whose restrictions to the two nonempty opens are a and b. Those restriction maps are identities, so this would force s=a=b, contradicting the choice a≠b. Therefore A‾pre is not a sheaf.

3.1F3givenstep 2.1construct

Write P=A‾pre. At any point x, two constant sections on neighbourhoods of x have equal germs exactly when their values in A agree: restriction to a smaller neighbourhood is the identity. Thus a germ-compatible presentation for P+(V) assigns a constant value on each nonempty chart, with equal values wherever two charts meet. These values define a locally constant function on V. Equivalent presentations define the same function, and presentations defining the same function are equivalent pointwise. Every locally constant function has such a presentation by constant neighbourhoods. For V=∅, all presentations are equivalent and correspond to the unique empty function. These bijections commute with restriction, so P+≅A‾loc.

4.1F2F3L1step 3.1∎

For any sheaf G, germ-compatible local sections agree on each overlap: equality of germs gives equality on a neighbourhood of each point, and sheaf locality gives equality on the whole overlap. They therefore glue uniquely to a section of G(V). This gluing identifies G+(V) with G(V), including the empty open, naturally in V. Apply this to the sheaf G=A‾loc from [L1]. Step 3.1 then gives aP=P++≅(A‾loc)+≅A‾loc; the single-chart unit sends a constant section to its constant function.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

11 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