Alphabeta Math
PropositionStatement: 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.

Perfect K theory localization and open excision

PDF p. 7: Zariski locality; PDF p. 15: Localization diagram

Statement

Assume the Axiom of Choice and fix the suitable universes of the supplied derived and K-theory constructions. Let X be a quasi-compact quasi-separated scheme and U⊆X a quasi-compact open with closed complement T. For the specified nonconnective perfect-complex K-theory there is a natural fiber sequence KT(X)⟶K(X)⟶K(U). For every cover X=U∪V by quasi-compact opens, the restriction square is homotopy cartesian, equivalently K(X)→∼K(U)×K(U∩V)K(V). Thus K-theory has open-cover Mayer–Vietoris (and the corresponding finite quasi-compact-open covering form by iteration). If T is closed with quasi-compact complement and T⊆W⊆X with W quasi-compact open, restriction gives the natural support excision equivalence KT(X)≃KT(W), compatible with the support-to-global and restriction maps. All these assertions use the nonconnective spectra and their groups in every integer degree, without a regularity, field or resolution-property assumption.

Facts & Assumptions

[A1]

Choice and the universe bounds are used to invoke the enhanced perfect-category and K-theory suppliers. The Axiom of Choice

Given: The schemes, opens and closed supports in the Statement, with the supplied essentially small sheaf-derived perfect categories and nonconnective functor.

Goal: Deduce localization, Mayer–Vietoris and open excision in exactly that model.

[F2]

Supported perfect complexes are invariant under an open neighbourhood gives the actual support restriction equivalence and compatibility with global restriction.

[F3]

Stable spectra and exact triangles supplies coherent pullbacks and stable fiber/cofiber sequences. Nonconnective K theory of perfect complexes identifies the K functor and all integer groups.

Proof

1.1F1F3

The localization sequence is [F1] applied to j:U↪X and its full kernel PerfT(X). This identifies the category-defined KT(X) with the actual fiber, without assuming that identification in its definition or comparing with a different K-theory model.

2.1F1F2F3step 1.1

For a two-open cover X=U∪V, quasi-separatedness makes U∩V quasi-compact, so [F1] applies both to U⊆X and U∩V⊆V. Put T=X∖U, a closed subset of X contained in V. Their fiber terms are KT(X) and KT(V), and [F2] identifies the induced map between these fibers with an equivalence. The coherent restriction square therefore has equivalent horizontal fibers. To check it is cartesian, put P=K(U)×K(U∩V)K(V). The induced map K(X)→P lies over K(U); its fiber map over that base is exactly KT(X)→KT(V) because pullbacks commute. Thus its map on fibers is an equivalence and its map on bases is the identity. The long exact sequences of spectrum homotopy groups give isomorphisms πiK(X)→πiP for all integers i, hence an equivalence of spectra. This proves Mayer–Vietoris. Repeated binary covering decompositions give the finite covering form.

3.1F1F2F3step 1.1step 2.1∎

For the stated support excision take W in [F2]. Its support equivalence is induced by actual restriction and is compatible with inclusions. Because X∖T is quasi-compact, so is W∖T=W∩(X∖T) by quasi-separatedness; hence both support terms are also the fibers in step 1.1 with their natural maps. This proves the entire interface, with every original qcqs, closed-support and quasi-compact-open condition retained.

Depends on

Used by · 11

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.