Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-sol)audited 2026-09-27
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.

Flasque kernel lifts quotient sections

Statement

Assume the Axiom of Choice. Let X be a topological space and let 0→F→G→ φ H→0 be a short exact sequence of abelian sheaves on X (Exact sequences of sheaves) in which F is flasque (Flasque sheaf).

  1. For every open subset U⊆X the map φU:G(U)→H(U) is surjective.
  2. If moreover G is flasque, then H is flasque.

The Axiom of Choice is used exactly once, to apply Zorn's lemma in part 1 (Zorn's lemma, The Axiom of Choice and Zorn's lemma are equivalent).

Facts & Assumptions

[F1]

A sequence of sheaves is exact at a term when the image sheaf of the incoming morphism equals the kernel sheaf of the outgoing morphism; thus exactness of 0→F→G→φH→0 says in particular that the image sheaf of φ is the kernel of H→0, which is all of H (Exact sequences of sheaves).

[F2]

The kernel sheaf of a morphism is computed objectwise: ker⁡(φ)(W)=ker⁡(φW:G(W)→H(W)) (Kernel sheaves are objectwise, while cokernels and images are sheafified).

[F3]

F is flasque, so for open O⊆W the restriction F(W)→F(O) is surjective (Flasque sheaf); likewise for G in part 2.

[F4]

A sheaf satisfies the gluing axiom: if si∈F(Wi) on a cover W=⋃iWi satisfy si∣Wi∩Wj=sj∣Wi∩Wj for all i,j, then there is s∈F(W) with s∣Wi=si for all i, and by locality it is unique (A sheaf on a topological space).

[F5]

Assuming AC, Zorn's lemma holds: every nonempty poset in which every chain has an upper bound has a maximal element (Zorn's lemma), and over ZF the Axiom of Choice and Zorn's lemma are equivalent (The Axiom of Choice and Zorn's lemma are equivalent, The Axiom of Choice).

[F6]

A sequence of sheaves is exact if and only if all its stalk sequences are exact (A sequence of abelian sheaves is exact exactly when it is exact on every stalk), and a germ of a sheaf at x is represented by a section over a neighbourhood of x, two representatives being equal when they agree on a smaller neighbourhood (The stalk of a presheaf at a point).

[F7]

F(∅) is the one-element group (A set-valued sheaf has a unique section over the empty open set); hence 0∈G(∅) is a section over the empty open lifting the empty section of H.

Proof

Given: The Axiom of Choice, the displayed short exact sequence with F flasque, an open U⊆X and a section s∈H(U).

1.1

Let S be the set of pairs (W,t) with W⊆U open and t∈G(W) such that φW(t)=s∣W, ordered by (W,t)≤(W′,t′) when W⊆W′ and t′∣W=t. This is a partial order (reflexivity, antisymmetry by locality of restrictions, transitivity by the restriction identities). It is nonempty: the pair (∅,0) lies in S by [F7], since G(∅) and H(∅) are one-element groups and s∣∅=0.

F7construct
2.1

Every chain in S has an upper bound. Let {(Wi,ti)}i∈I be a chain, a set-indexed family of elements of S, and put W:=⋃iWi. For i,j∈I the chain contains an element (Wk,tk) with Wi∪Wj⊆Wk, so ti∣Wi∩Wj=tk∣Wi∩Wj=tj∣Wi∩Wj; the family is therefore compatible and [F4] glues it to a single t∈G(W) with t∣Wi=ti for all i. Then φW(t)∣Wi=φWi(ti)=s∣Wi for every i, so φW(t)=s∣W by the locality half of the sheaf condition [F4], and (W,t)∈S is an upper bound of the chain. [F3, F4, step 1.1]

F4step 1.1
3.1

By [F5] the Axiom of Choice gives Zorn's lemma, so the nonempty poset S of step 1.1, in which every chain has an upper bound by step 2.1, has a maximal element (W,t). Suppose W≠U and choose x∈U∖W. Since the given sequence is exact at H, the stalk map φx:Gx→Hx is surjective by [F1, F6]; the germ sx therefore has a preimage, which is represented by some t1∈G(W1) on an open neighbourhood W1⊆U of x with φW1(t1)=s∣W1 after shrinking W1 if necessary (equality of germs is equality on a smaller neighbourhood, [F6]). Let O:=W∩W1; then φO(t1∣O−t∣O)=s∣O−s∣O=0, so u:=t1∣O−t∣O lies in ker⁡(φO)=F(O) by [F2]. Since F is flasque, u extends to some u~∈F(W1)⊆G(W1) [F3]. Then t1−u~∈G(W1) still satisfies φW1(t1−u~)=s∣W1, and on O one has (t1−u~)∣O=t1∣O−u=t∣O. Hence t on W and t1−u~ on W1 are compatible and glue by [F4] to a section t′∈G(W∪W1) with t′∣W=t and t′∣W1=t1−u~; since W∪W1⊋W and φW∪W1(t′) agrees with s on the cover {W,W1}, we get (W∪W1,t′)>(W,t) in S, contradicting maximality. [F1, F2, F3, F4, F5, F6, step 2.1]

F1F2F3F4F5F6
4.1

Therefore W=U, and the maximal element provides t∈G(U) with φU(t)=s∣U=s. As s∈H(U) was arbitrary, φU is surjective; since U was an arbitrary open subset, part 1 holds. [step 3.1, construct]

F7
5.1

For part 2 assume in addition that G is flasque. Let U⊆V be open and let s∈H(U). By step 4.1 there is t∈G(U) with φU(t)=s; since G is flasque, t extends to some t′∈G(V) with t′∣U=t [F3]. Then φV(t′)∈H(V) restricts to φU(t′∣U)=φU(t)=s, because φ is a morphism of sheaves and hence commutes with restrictions. So every section over U extends to V and H is flasque [F3]. [F3, step 4.1, given] ∎

F3given∎

Depends on

Used by

Dependency tree · two levels

28 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