Alphabeta Math
LemmaStatement: AI-generatedProof: AI-generated
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.

Open excision for a descent theory

PDF p. 7: Excision at a smooth point; PDF p. 13: Excision to the smooth locus

Statement

Let X be a scheme, T⊆X a closed subset, W⊆X an open subset containing T, U=X∖T, and V=W∩U=W∖T. Suppose a contravariant spectrum-valued theory E is defined on these four opens, with coherent restriction maps, and that its restriction square E(X)⟶E(W)↓↓E(U)⟶E(V) is homotopy cartesian: the induced map E(X)→E(W)×E(V)E(U) is an equivalence, where the product is a homotopy pullback. Define ET(X)=fib⁡(E(X)→E(U)) and ET(W)=fib⁡(E(W)→E(V)). Restriction induces an equivalence ET(X)≃ET(W). It is natural for compatible maps of such coherent squares, and the square formed by the support-to-global maps and restriction to W commutes coherently.

The same conclusion holds for cochain complexes of abelian groups, with equivalence replaced by quasi-isomorphism, under the following explicit form of two-open descent. Write A=C(X), B=C(W), C=C(U), and D=C(V), and suppose the restriction square is strictly commutative. If u:B→D and v:C→D are its lower restriction maps, require the canonical map A⟶P:=fib⁡(B⊕C→u−vD),a⟼(a∣W,a∣U,0), to be a quasi-isomorphism, using the explicit fiber complex of Support fibers with explicit cohomological indexing. Then restriction induces a quasi-isomorphism CT(X)→CT(W), compatible with the support-to-global maps and natural for maps of such squares. In particular it induces isomorphisms on supported cohomology in every degree. A quasi-isomorphism is a cochain map inducing isomorphisms on all cohomology groups.

These are conditional excision statements: a particular theory must supply the indicated restriction data and descent hypothesis, as well as any quasi-compactness, size, or other conditions required for that hypothesis. No descent property is asserted merely from the existence of a support fiber.

Facts & Assumptions

Given: The opens and either a coherent spectrum square or a strictly commutative cochain-complex square as in the statement, satisfying the corresponding displayed descent hypothesis.

Goal: Prove the restriction equivalence or quasi-isomorphism of support fibers and its stated compatibility and naturality.

[F1]

In the stable spectra interface, fibers and products over a common object are coherent homotopy pullbacks, characterized by their universal properties. Stable spectra and exact triangles

[F2]

For a cochain map f:M→N, the support-fiber model has degree-n group Mn⊕Nn−1 and differential (m,n)↦(dMm,f(m)−dNn). A commutative square of cochain maps induces a map of these fibers, and if its two vertical maps are quasi-isomorphisms then so is the induced map on fibers. The support-to-global map is projection to the first factor. Support fibers with explicit cohomological indexing

Proof

technique · Paste homotopy pullbacks for spectra; for complexes, compare the explicit descent model with the fiber over the target complex
1.1F1given

In the spectrum case, the descent hypothesis identifies E(X) with E(W)×E(V)E(U), compatibly with its two projections. Taking the homotopy pullback of the projection to E(U) along 0→E(U) gives ET(X)≃(E(W)×E(V)E(U))×E(U)0≃E(W)×E(V)0=ET(W). The middle equivalence follows by the universal property of the homotopy pullback: a map into either side is a map into E(W) together with a coherent nullhomotopy of its composite to E(V). The displayed equivalence is the one induced by restriction.

2.1F1step 1.1

The same universal property makes this construction natural for compatible maps of the coherent squares. Its projection to E(W) is the composite of the projection ET(X)→E(X) with restriction E(X)→E(W), with the coherence inherited from the pullback diagram. This proves the support-to-global compatibility.

3.1F2givenstep 2.1

In the complex case, let q:A→P be the descent quasi-isomorphism and let p:P→C be projection. The equality pq=A→C gives a commutative square with vertical maps q and id⁡C. By [F2], it induces a quasi-isomorphism fib⁡(A→C)→fib⁡(P→C).

4.1F2givenconstructstep 3.1

Write an element of fib⁡(P→C)n as (b,c,d,t), with b∈Bn, c∈Cn, d∈Dn−1 and t∈Cn−1. Its differential is (db,dc,ub−vc−dd,c−dt), where each d on the right denotes the differential of the appropriate complex. The map (b,c,d,t)⟼(b,d+vt) to fib⁡(B→D) is a cochain map: the second component of the differential becomes ub−dD(d+vt). It is split surjective as a cochain map, with section (b,z)↦(b,0,z,0).

5.1step 4.1construct

Its kernel consists of (0,c,−vt,t) and is isomorphic to fib⁡(id⁡C), with differential (c,t)↦(dc,c−dt). This kernel is contractible: the degree-minus-one map (c,t)↦(t,0) satisfies dh+hd=id⁡. Hence the split surjective map in step 4.1 is a quasi-isomorphism.

6.1F2step 3.1step 5.1

The composite of the maps in steps 3.1 and 4.1 sends (a,t) to (a∣W,t∣V), exactly the restriction map between the two support-fiber models. It is therefore a quasi-isomorphism. The formula also shows that it commutes strictly with projection to A and B and is natural for maps of the given commutative squares. Taking cohomology gives the stated supported-cohomology isomorphisms.

7.1step 2.1step 6.1∎

Steps 1.1–2.1 and 3.1–6.1 establish both forms of open excision under their respective descent hypotheses.

Depends on

Used by · 9

Dependency tree · 3 levels

Arrows run from prerequisites to the items that use them. External source nodes link directly to the cited text. The view shows up to three dependency steps; open a prerequisite to continue.