Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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.

Rank and determinant on the second piece

PDF p. 11: Opening paragraphs of Lemma 5.3 proof

Statement

Assume the Axiom of Choice and the fixed site and universe bounds required by the low-weight and perfect K-theory constructions. Let k be an algebraically closed field and let X be a normal quasi-compact quasi-separated k-scheme. For every α∈Fmot2K0(X), the composites Fmot2K0(X)⟶K0(X)→p0Hmot0,0(X,Z),Fmot2K0(X)⟶Fmot1K0(X)→p1Hmot2,1(X,Z) vanish. Consequently α has rank zero and c1perf(α)=0. If in addition α=[V]−[W] for vector bundles V,W on X, then V and W have equal rank at every point and their determinant line bundles are isomorphic. In particular these assertions hold on normal finite-type k-schemes.

Here K0(X) is the zeroth homotopy group of nonconnective K-theory of perfect complexes, and FmotjK0(X) is the image of the jth motivic filtration stage in it. A perfect complex is locally quasi-isomorphic to a bounded complex of finite-rank vector bundles; its rank is the locally constant Euler characteristic of its derived fibers. A vector bundle is a finite locally free sheaf, and its determinant is its top exterior power on each constant-rank locus. Normal means that all local rings are integrally closed domains. Quasi-compact means every open cover has a finite subcover; quasi-separated means intersections of quasi-compact open subsets are quasi-compact. Finite type over k means a finite affine cover by spectra of finitely generated k-algebras.

The map p0 is the actual zeroth stage-to-graded projection, using Fmot0K(X)=K(X). The first-stage augmentation identifies π0Fmot1K(X) injectively with Fmot1K0(X) on every qcqs field-scheme. The map p1 here is the actual first stage-to-graded projection transported through this identification. Thus its construction applies throughout the stated qcqs scope and agrees with the existing finite-type projection convention. The first Chern class is the actual rank-reduced first-layer class, equivalently the perfect determinant followed by the actual weight-one Picard isomorphism. Choice means every family of nonempty sets has a choice function; the size bounds specify the sites and ambient universes of the cited constructions.

Facts & Assumptions

Given: The field k, scheme X, Choice, site and universe bounds, and α∈Fmot2K0(X) as stated.

Goal: Prove both projection composites vanish, then deduce rank zero and vanishing first Chern class, with the stated consequences for any bundle-difference representation.

[F1]

The decreasing motivic filtration has compatible stage maps to K(X), with stage zero identified with K(X), and nested image groups. For each stage, exactness makes the kernel of its stage-to-graded map on π0 the image of the next stage. Motivic filtration and image groups Stage projections, kernels and image groups

[F2]

On every qcqs scheme over a field, the actual weight-zero map is the locally constant Euler rank on perfect K0. The first-stage augmentation is injective on π0 and identifies its image with the rank-zero subgroup of K0. The actual first EM stage is the rank-zero K space on all qcqs schemes

[F3]

On the qcqs Nisnevich site over a field, the actual map from the rank-zero K-space to the weight-one Picard stack is the perfect-complex determinant map. On components it retains global determinant line classes, including on nonaffine schemes. The globally normalized first-layer Picard map is determinant

[F4]

Under Choice and the stated bounds, on every qcqs field-scheme one has c1perf=γXdet⁡X, with γX:Pic⁡(X)→∼Hmot2,1(X,Z) the actual weight-one orientation. This class agrees with the actual bundle and virtual-bundle first Chern classes. In particular, on a bundle difference its determinant is the Picard class of det⁡V⊗(det⁡W)−1. The Picard group consists of isomorphism classes of line bundles under tensor product. First Chern class factors through determinant

[F5]

The assumed Choice and size bounds are used when invoking the filtration and perfect rank/Picard constructions; choosing a single lift of a given image element below does not itself require arbitrary-index choice. The Axiom of Choice

Proof technique: Transport only the first-stage map through the full-qcqs rank-fiber identification, apply consecutive stage exactness, and then use the actual determinant comparison.

Proof

1.1F1F2F3F5given

Invoke the filtration and rank/Picard constructions under [F5]. By [F2], the first-stage augmentation is an isomorphism onto its image group, so composing its inverse with the actual first stage-to-graded map defines p1 on Fmot1K0(X). This uses the injective first-stage augmentation on the stated qcqs scheme, without applying a finite-type comparison outside its hypotheses. Whenever the finite-type projection convention applies, both definitions use the inverse of the same augmentation and the same stage map, so they agree.

2.1F1F2step 1.1given

Choose a lift a∈π0Fmot2K(X) of α, which exists by the image-group definition. Let b be its image in π0Fmot1K(X) and let c be the image of b in π0Fmot0K(X)=K0(X). Compatible augmentations give c=α. The element b is the unique first-stage representative of α by [F2].

3.1F1step 1.1step 2.1

The first stage-to-graded map sends b to zero because it comes from stage two. The zeroth stage-to-graded map sends c to zero because it comes from stage one. These are exactly the adjacent-stage kernels in [F1]. By the transport in step 1.1 and the augmentation compatibility in step 2.1, this proves p1(α)=0 and p0(α)=0, hence both displayed composites vanish.

4.1F2F3F4step 2.1step 3.1

By [F2], p0(α)=0 says that α has pointwise Euler rank zero. By [F3] the value of the actual first-layer map on its unique first-stage representative b is γX(det⁡Xα), which is c1perf(α) by [F4]. Step 3.1 makes that value zero. Thus the rank and first-Chern conclusions hold for arbitrary perfect classes in the second image group.

5.1F4step 4.1given∎

If α=[V]−[W], additivity of Euler rank and step 4.1 give equal ranks of V and W at every point. By [F4], γX([det⁡V⊗(det⁡W)−1])=c1perf(α)=0. Injectivity of γX makes this Picard class zero, equivalently det⁡V≅det⁡W. Normal finite-type schemes over k are qcqs, so the original finite-type special case is included. This proves every assertion.

The article's original normal qcqs scope is retained, including nonseparated schemes. No global bundle-difference representation or resolution property is assumed. The final assertion applies only when a representation is supplied. The original article's blanket representation premise remains a source proof defect; the rank and determinant conclusions do not require it. This proof uses the actual full-qcqs rank and Picard interfaces instead of extending the finite-type smooth-locus comparison by assertion. Their underlying constructions are used as supplier premises, without new acceptance or audit claims.

Scope and reading limits

The article's original normal qcqs scope is retained, including nonseparated schemes. No global bundle-difference representation or resolution property is assumed. The final assertion applies only when a representation is supplied. The original article's blanket representation premise remains a source proof defect; the rank and determinant conclusions do not require it. This proof uses the actual full-qcqs rank and Picard interfaces instead of extending the finite-type smooth-locus comparison by assertion. Their underlying constructions are used as supplier premises, without new acceptance or audit claims.

Depends on

Used by · 4

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.

Sources