Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Proper hypercovers compute constructible derived cohomology

Statement

Assume the Axiom of Choice as inherited from the supplied six-functor resolutions. Let X∙→X be an augmented simplicial finite-type complex algebraic variety (Simplicial objects, simplicial commutative rings and homotopy groups, Analytic topology and finite smooth algebraic stratifications of complex varieties). Assume X0→X is proper surjective and, for each p>0, Xp→(cosk⁡p−1sk⁡p−1X∙)p is proper surjective over X, where sk⁡p−1 restricts to levels through p−1, cosk⁡p−1 is its right Kan extension formed by finite matching limits, and the target is the matching object. Such an object is a proper hypercover; no smoothness or fiber acyclicity is assumed. For F∈Dcb(X;k) over a field, and ap:Xp→X, the augmentation gives F→∼Tot⁡p≥0Rap∗ap∗F,RΓ(X,F)→∼Tot⁡p≥0RΓ(Xp,ap∗F). There is a natural strongly convergent spectral sequence E1p,q=Hq(Xp,ap∗F)⇒Hp+q(X,F). If F has cochain lower bound a, every diagonal p+q=m is finite; degree m and its differential are determined by levels through p=m−a+1. All proper-hypercover refinements induce the same comparison via the base object; any two such hypercovers have a proper common refinement. For F=kX, a=0, this is the first-quadrant spectral sequence required for smooth-projective hyperresolutions.

Facts & Assumptions

Given: the augmented simplicial finite-type complex algebraic variety X∙→X satisfying the proper-hypercover conditions of the Statement, the field k, and F∈Dcb(X;k) in the sense of Algebraically constructible complexes of analytic field sheaves. Skeleton and coskeleton are taken in augmented simplicial objects over X, with augmentation object X in degree −1, so that (cosk⁡psk⁡pX∙)m=lim⁡[k]→[m], k≤pXk and the target (cosk⁡p−1sk⁡p−1X∙)p is the p-th matching object; a bounded proper hypercover of height n is one satisfying U=cosk⁡nU. The Axiom of Choice The Axiom of Choice is assumed as inherited from the supplied six-functor resolutions.

[F1]

Proper surjections have cohomological descent for constructible field sheaves proves actual proper Cech descent for a proper surjection: the augmented derived Cech map is a quasi-isomorphism, with arbitrary base change, finite diagonals and no fiber acyclicity.

[F2]

Bicosimplicial total complexes agree with diagonal totalization supplies the natural alternating-face chain-homotopy equivalence between a bicosimplicial total and its diagonal total, with the stated sign conventions and the internal lower bound.

[F3]

Coherent six operations on analytic constructible field sheaves and Actual analytic constructible sheaves admit coherent six operations supply the coherent ordinary operations, composition of derived right adjoints and restriction to bounded algebraically constructible complexes over an arbitrary field, each pulled coefficient again bounded below.

[F4]

Locally split Cech nerves give actual derived Cartesian sheaf descent supplies functorial simplicial-derived diagrams, their strict resolutions, right-derived composition and uniformly bounded-below total models with finite-degree truncations; its local-section descent conclusion is not substituted for proper descent.

[F5]

Bounded filtered complex spectral sequence abuts to filtered homology gives convergence for a filtration that is finite in each degree.

[A1]

The Axiom of Choice is inherited only through the resolution inputs and [F1]; the finite coskeleton, product and retract constructions below make no new arbitrary selections.

Proof

technique · direct
1.1F1givenconstruct

Height zero and the induction setup. Let U→X be a bounded proper hypercover of height zero, that is U=cosk⁡0U0. By the convention of the Given, U is the Cech nerve of the proper surjection U0→X, so [F1] proves both the sheaf and the global augmentation statements for U. Suppose inductively that they are proved for all bounded proper hypercovers of height at most n, and let U=cosk⁡n+1U have height n+1. Put V:=cosk⁡nU. Its matching maps through degree n are those of U, and in degrees j>n its matching map is an isomorphism because V=cosk⁡nV; hence V is a proper hypercover of height at most n and the induction hypothesis applies to V.

1.2givenconstructalgebra

Levelwise proper surjectivity of U→V. For every j the map Uj→Vj is proper surjective. For j≤n it is the identity. For j>n it reads Hom⁡(sk⁡n+1Δ[j],U)→Hom⁡(sk⁡nΔ[j],U): the domain is obtained from the codomain by adjoining the finitely many nondegenerate (n+1)-faces of Δ[j], whose boundaries already lie in the n-skeleton, so this map is a Cartesian pullback of the finite product of the matching map Un+1→(cosk⁡nU)n+1=Vn+1; a finite product over X of proper surjections, and any base change of it, is proper surjective. No local sections are required, and all limits are the finite matching limits of the Given.

2.1F1F2F3F4step 1.1step 1.2

The bisimplicial Cech model and the double total. Form the bisimplicial object Wr,j=Uj×Vj⋯×VjUj with r+1 factors, horizontally the Cech nerve of Uj→Vj, and pull coefficients from X throughout. By [F1] and step 1.2, for each fixed j the horizontally augmented derived row computes the coefficient complex on Vj, before and after pushing forward to X: with Bj:=(Vj→X)∗F and ar,j:Wr,j→X one has Rbj∗Bj≃Tot⁡rRar,j∗ar,j∗F, where bj:Vj→X, the identifications being compatible with composition and finite sums by [F3] and [F4]. The induction hypothesis for V gives F≃Tot⁡jRbj∗Bj; substituting the row identifications and using that every total diagonal is finite (the internal degrees are bounded below by the same a, by [F3]) identifies the iterated total with the full total, so F≃Tot⁡r,jRar,j∗ar,j∗F and the analogous global statement hold. By [F2] this double total is naturally chain-homotopy equivalent to the total on the diagonal Dj:=Wj,j.

3.1F2F4step 1.1step 2.1construct

The retract over X. The bounded hypercover U is a retract over X of D. The map i:U→D repeats the same Uj-point in all j+1 horizontal factors, the horizontal degeneracy; through degree n the map Uj→Vj is the identity, so Dj=Uj there, and in degree n+1 let rn+1:Dn+1→Un+1 be the projection to the first horizontal factor. Its faces and degeneracies agree with the degree-≤n identity identifications, because every horizontal factor of W has the same image in V and the lower-degree maps are identities; this defines a map of (n+1)-truncated simplicial objects over X, and the universal property U=cosk⁡n+1U extends it uniquely to r:D→U. The composite ri is the identity through degree n+1: in lower degrees because i is the diagonal and r the factor projection on Dj=Uj, and in degree n+1 because repeating a point and projecting a factor returns it; hence ri=id in every degree by the same universal property. Coefficient pullback reverses these maps, and since r∘i=id the augmented total of U is a retract of the augmented total of D; by step 2.1 the cone of the augmentation of D is acyclic, and a retract of an acyclic cone is acyclic, so the augmentation of U is a quasi-isomorphism. This completes the bounded-height induction.

4.1F4step 3.1construct

Arbitrary height by truncation. For an arbitrary proper hypercover U, put U(N):=cosk⁡Nsk⁡NU; it is a bounded proper hypercover, so step 3.1 applies to it, and the canonical map U→U(N) is the identity through simplicial degree N. In the strict derived total model every internal degree is at least a; hence total degrees m−1, m and m+1 involve only simplicial levels p≤m−a+1, because a term of total degree m+1 has p+q=m+1 with q≥a. Choose N≥max⁡(0,m−a+1); then the totals for U and U(N) have the same objects and the same differentials in these three degrees, so the same degree-m cohomology and the same augmentation maps. Since m was arbitrary, the augmentation for U is a quasi-isomorphism, and degree m with its differential is determined by levels through p=m−a+1. This is a finite-degree truncation argument, not an interchange of stalks or cohomology with an unjustified infinite product.

5.1F3F5step 4.1

The spectral sequence and convergence. Filter the global total of step 4.1 by simplicial degree. Its first page is E1p,q=Hq(Xp,ap∗F), with first differential the alternating sum of face pullbacks by the naturality of [F3]; in degree m the filtration has only the finitely many pieces 0≤p≤m−a. By [F5] the stationary page is identified, naturally, with the finite associated graded of Hm(X,F); this proves strong convergence and requires no finite-dimensionality of the individual groups Hq(Xp,ap∗F).

6.1F3A1step 4.1step 5.1construct∎

Refinements and constant coefficients. For two proper hypercovers U,V of X, the levelwise product Rj:=Uj×XVj is a proper hypercover: finite matching limits commute with products, so each matching map of R is the product over X of the matching maps of U and V, hence proper surjective, and the levelwise projections give maps of simplicial objects R→U and R→V over X. By step 4.1 the augmentations of U, V and R all identify their totals with the same coefficient complex on X, and the refinement maps are compatible with those identifications by naturality of the augmentation, so all proper-hypercover refinements induce the same comparison via the base object. A smooth-projective refinement requires a separate supplied construction: a fiber product of smooth varieties over X need not be a smooth variety, so no smoothness is asserted here. For F=kX the lower bound is a=0 and the page of step 5.1 is exactly the stated first-quadrant spectral sequence. The Axiom of Choice is inherited precisely through [A1].

Depends on

Used by

Dependency tree · two levels

85 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