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

Two-affine Mayer–Vietoris on the projective line

Example

Assume the Axiom of Choice (The Axiom of Choice). Let k be a field, let Pk1 be the two-affine projective line with charts U0≅Spec⁡k[t], U∞≅Spec⁡k[u] and overlap W=U0∩U∞≅Spec⁡k[t,t−1] carrying the mutually inverse coordinates t,u with tu=1, and let O(n) be the twisting sheaf with frames e0 on U0 and e∞ on U∞ related by e∞=tne0 (Two-affine projective line and its twists). Then:

  1. the chart modules of O(n) are Γ(U0,O(n))=k[t]e0,Γ(U∞,O(n))=k[u]e∞,Γ(W,O(n))=k[t,t−1]e0, the last with the identification e∞=tne0;
  2. the Mayer–Vietoris sequence of the two-open cover {U0,U∞} (Mayer–Vietoris sequence for sheaf cohomology) for O(n) reads 0→H0(Pk1,O(n))→k[t]⊕k[u]→ β k[t,t−1]→ ∂ H1(Pk1,O(n))→H1(U0,O(n)∣U0)⊕H1(U∞,O(n)∣U∞)→H1(W,O(n)∣W)→H2(Pk1,O(n))→⋯ , where β(a,b)=tnb(t−1)−a(t) for a∈k[t], b∈k[u];
  3. consequently H0(Pk1,O(n))≅ker⁡β and coker⁡β≅ker⁡(H1(Pk1,O(n))→H1(U0,O(n)∣U0)⊕H1(U∞,O(n)∣U∞));
  4. ker⁡β≅kn+1 for n≥0 and ker⁡β=0 for n<0, while β is surjective for n≥−1 and coker⁡β≅k−n−1 for n≤−2; in particular H0(Pk1,O(0))≅k is the constants, H0(Pk1,O(1))≅k2 is generated by the sections (t,1) and (1,u), and for n≤−2 the group k−n−1 embeds in H1(Pk1,O(n)).

The groups Hi(U0,O(n)∣U0), Hi(U∞,O(n)∣U∞) and Hi(W,O(n)∣W) for i≥1 are kept as terms of the sequence; no vanishing of them is asserted here.

Facts & Assumptions

[F1]

For a sheaf of abelian groups F on X=U∪V with U,V open, there is a natural long exact Mayer–Vietoris sequence ⋯→Hq(X,F)→Hq(U,F∣U)⊕Hq(V,F∣V)→Hq(U∩V,F∣U∩V)→∂Hq+1(X,F)→⋯, whose degree zero map is the difference of restrictions (Mayer–Vietoris sequence for sheaf cohomology).

[F2]

O(n) is glued from the structure sheaves of the two charts with frames e0=1 on U0 and e∞=1 on U∞ related on W by e∞=tne0, equivalently e0=t−ne∞, and it is free of rank one on each chart with the displayed frame (Two-affine projective line and its twists).

[F3]

On the overlap the sections of O(n) are k[t,t−1]e0 with a(t)e0=t−na(t)e∞=una(u−1)e∞ (Two-affine projective line and its twists).

[F4]

For a ring A with structure sheaf O and f∈A one has Γ(D(f),O)=Af; in particular for A=k[t] and f=1 the global sections of the chart U0 are k[t] (Sections and restrictions on distinguished opens of an affine scheme).

[F5]

H0(X,F) is canonically isomorphic to Γ(X,F), naturally in F (Degree-zero sheaf cohomology is global sections).

[F6]

The Axiom of Choice is the statement that every family of nonempty sets has a choice function (The Axiom of Choice).

Verification

Given: The field k, the two-affine projective line Pk1 with charts U0≅Spec⁡k[t], U∞≅Spec⁡k[u], overlap W=U0∩U∞ with coordinates t,u, tu=1, and the twisting sheaves O(n), n∈Z, with frames e0,e∞ satisfying e∞=tne0 on W.

Proof technique: direct.

1.1

The two charts U0,U∞ are nonempty open subschemes of Pk1 covering it, their overlap W=U0∩U∞ is nonempty and identified with Spec⁡k[t,t−1], and on W the two coordinate functions are mutually inverse units t,u with tu=1 [F2, F3]. The restriction O(n)∣U0 is the structure sheaf of U0 with global frame e0, and likewise O(n)∣U∞ is the structure sheaf of U∞ with global frame e∞ [F2].

F2F3
2.1

By [F4] applied to the chart U0≅Spec⁡k[t] and the element f=1, whose basic open is the whole chart, the global sections of the structure sheaf of U0 are k[t]; the frame e0 is a global generator, so Γ(U0,O(n))=k[t]e0. The same argument on U∞≅Spec⁡k[u] gives Γ(U∞,O(n))=k[u]e∞, and by [F3] the sections over the overlap are Γ(W,O(n))=k[t,t−1]e0 with e∞=tne0 there. Consequently every section of O(n) over the overlap has the form c(t)e0 for a unique Laurent polynomial c∈k[t,t−1].

F3F4step 1.1
3.1

The underlying topological space of Pk1 is the union of the two open subsets U0, U∞, and O(n) is in particular a sheaf of abelian groups on it, its module structure being forgotten; the Axiom of Choice [F6] is available, as required by the Mayer–Vietoris theorem [F1]. Applying [F1] to this cover and substituting the three modules of [step 2.1] gives the long exact sequence of the statement, in which the second map is the difference of the two restrictions: for a∈k[t] and b∈k[u] the pair (ae0,be∞) is sent to be∞∣W−ae0∣W=(tnb(t−1)−a(t))e0, using e∞=tne0 and u=t−1 on W [F2, F3]. The first term is Γ(Pk1,O(n)) read as H0 through the canonical identification of [F5], so the sequence begins 0→H0(Pk1,O(n))→k[t]⊕k[u]→ β k[t,t−1] with β(a,b)=tnb(t−1)−a(t).

F1F2F3F5F6step 2.1
3.2

An element (a,b) lies in ker⁡β exactly when a(t)=tnb(t−1). Writing b=∑m≥0bmum, the right-hand side is ∑m≥0bmtn−m, which is a polynomial in t exactly when bm=0 for all m>n; this forces b=0 and a=0 when n<0, and for n≥0 leaves the n+1 free coefficients b0,…,bn with a(t)=∑m=0nbmtn−m and b(u)=∑m=0nbmum. Hence ker⁡β≅kn+1 for n≥0 and ker⁡β=0 for n<0.

F2F3step 2.1
4.1

Exactness of the sequence of [step 3.1] at the terms k[t]⊕k[u] and k[t,t−1] says ker⁡β≅H0(Pk1,O(n)) (the map out of H0 being injective), and exactness at H1(Pk1,O(n)) says that the image of ∂ is the kernel of the restriction map to the two charts; since ∂ induces an isomorphism from k[t,t−1]/im⁡β onto that image, coker⁡β≅ker⁡(H1(Pk1,O(n))→H1(U0,O(n)∣U0)⊕H1(U∞,O(n)∣U∞)).

F1step 3.1
4.2

Under the identification of k[t,t−1] with the Laurent polynomials, im⁡β=k[t]+tnk[t−1] is the span of the monomials tj with j≥0 or j≤n, since tnk[t−1] is spanned by tn−m, m≥0 [step 2.1]. Hence β is surjective exactly when every integer j satisfies j≥0 or j≤n, that is exactly when n≥−1; for n≤−2 the monomials tn+1,…,t−1 are not in the image and their classes form a basis of coker⁡β, so coker⁡β≅k−n−1.

F3step 2.1step 3.1
5.1

Specialising [step 4.2] and [step 3.2]: for n=0 the differential is β(a,b)=b(t−1)−a(t), it is surjective, and its kernel consists of the pairs with a=b constant, so H0(Pk1,OPk1)≅k is the constants; for n=1 the differential is β(a,b)=tb(t−1)−a(t), it is surjective, and its kernel is {(c0t+c1, c0+c1u):c0,c1∈k}≅k2 with the two generators (t,1) and (1,u); for n=−1 the differential is surjective with zero kernel; and for n=−2 the image misses exactly the multiples of t−1, so coker⁡β≅k and β is not surjective. In all cases the orientation of the transition enters through e∞=tne0, which converts a section b(u)e∞ over U∞ into tnb(t−1)e0 over the overlap.

F2step 4.2step 3.2
6.1

The three chart modules of [step 2.1] and the sequence of [step 3.1], whose second map is β of [step 4.2], prove assertions 1 and 2 of the statement; [step 4.1] gives assertion 3, and [step 3.2], [step 4.2] and [step 5.1] give assertion 4 with the two checks n=0 and n=1 of the transition orientation. The higher chart groups Hi(U0,O(n)∣U0), Hi(U∞,O(n)∣U∞) and Hi(W,O(n)∣W) for i≥1 appear in the sequence as themselves and are not claimed to vanish; only the degree zero row k[t]⊕k[u]→k[t,t−1] and its immediate exactness consequences are computed. The Axiom of Choice of [F6] enters exactly through [F1], whose proof produces a functorial injective resolution, and through the cited construction of the structure sheaves of the affine charts in Two-affine projective line and its twists; no further choice is made, the modules and the map β being given by explicit polynomials. ∎

F1F6step 5.1step 4.1step 4.2step 3.2step 2.1step 3.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

40 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