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.

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

Statement

Let φ:F→G be a morphism of sheaves of sets on a topological space X. Then φ is an isomorphism if and only if, for every x∈X, the induced map on stalks φx:Fx⟶Gx is a bijection.

Facts & Assumptions

Given: A morphism of sheaves φ:F→G.

[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 s∈F(U) and x∈U 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.1F1F2

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.

1.2F2F3givenchoose

Assume now that every φx is a bijection. Fix an open set U⊆X and a section t∈G(U). For each x∈U, choose ax∈Fx with φx(ax)=tx. Pick a representative sx∈F(Vx) of ax on some open neighbourhood Vx⊆U of x. Then (φVx(sx))x=tx, so [F3] lets us shrink Vx and assume φVx(sx)=t∣Vx.

1.3F2F3L2

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

2.1F2F3L2step 1.2

Let x,y∈U. For any z∈Vx∩Vy, the two sections sx∣Vx∩Vy and sy∣Vx∩Vy 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 Wz⊆Vx∩Vy of z on which sx∣Wz=sy∣Wz. The sets Wz cover Vx∩Vy, so [L2] gives sx∣Vx∩Vy=sy∣Vx∩Vy. Therefore the family (sx) is compatible on the cover {Vx}x∈U of U.

3.1L2step 2.1construct

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.

4.1F1step 3.1step 1.3∎

Let V⊆U and t∈G(U). Then φV(ψU(t)∣V)=φU(ψU(t))∣V=t∣V=φV(ψV(t∣V)). Step 1.3 gives injectivity of φV, so ψU(t)∣V=ψV(t∣V). Hence the maps ψU commute with restriction and define a morphism of sheaves ψ:G→F. 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.

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