Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04 rests on unproved material (inherited)
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.

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

A morphism of sheaves is an isomorphism exactly when it is an isomorphism on every stalk

Statement

Let φ:FG be a morphism of sheaves of sets on a topological space X. Then φ is an isomorphism if and only if, for every xX, the induced map on stalks φx:FxGx is a bijection.

Facts & Assumptions

Given: A morphism of sheaves φ:FG.

[F1]

A morphism of presheaves is an isomorphism when it has a two-sided inverse whose components commute with restriction (Morphisms of presheaves).

[F2]

The stalk construction sends morphisms of presheaves to induced stalk maps, and for every sF(U) and xU 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).

[L2]

A sheaf is glued from local sections that agree on overlaps (A sheaf on a topological space).

Proof

technique · direct
1.1

If φ is an isomorphism with inverse ψ, then for every x the induced maps φx and ψx are inverse because taking stalks preserves composition and identities by [F2]. Hence each φx is a bijection.

F1F2
1.2

Assume now that every φx is a bijection. Fix an open set UX and a section tG(U). For each xU, choose axFx with φx(ax)=tx. Pick a representative sxF(Vx) of ax on some open neighbourhood VxU of x. Then (φVx(sx))x=tx, so [F3] lets us shrink Vx and assume φVx(sx)=tVx.

F2F3givenchoose
1.3

If s,sF(U) satisfy φU(s)=φU(s), then for every xU one has φx(sx)=φx(sx) by [F2]. Injectivity of φx gives sx=sx. By [F3], for each x there exists an open neighbourhood WxU with sWx=sWx. The sets Wx cover U, so [L2] gives s=s. Thus each φU is injective.

F2F3L2
2.1

Let x,yU. For any zVxVy, the two sections sxVxVy and syVxVy have images under φ whose germs at z both equal tz. Since φz is injective, the germs of sx and sy at z are equal. By [F3], there is a neighbourhood WzVxVy of z on which sxWz=syWz. The sets Wz cover VxVy, so [L2] gives sxVxVy=syVxVy. Therefore the family (sx) is compatible on the cover {Vx}xU of U.

F2F3L2step 1.2
3.1

By [L2], the compatible family of step 2.1 glues to a unique section ψU(t)F(U) satisfying φU(ψU(t))=t. Thus φU is surjective for every U.

L2step 2.1construct
4.1

Let VU and tG(U). Then φV(ψU(t)V)=φU(ψU(t))V=tV=φV(ψV(tV)). Step 1.3 gives injectivity of φV, so ψU(t)V=ψV(tV). Hence the maps ψU commute with restriction and define a morphism of sheaves ψ:GF. By steps 3.1 and 1.3, ψ is a two-sided inverse to φ, so [F1] shows that φ is an isomorphism. Together with step 1.1 this proves both directions.

F1step 3.1step 1.3

Depends on

Used by

Nothing in the library uses this result yet.

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