Alphabeta Math
DefinitionDefinition: AI-adaptedProof: 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.

Graded filtration projections

PDF p. 10: Section 5 opening; PDF p. 12: Section 6 projection p3

Definition

Assume the Axiom of Choice and fix compatible site and universe size bounds for the specified motivic and weight-one constructions. Let k be a field, X a quasi-compact quasi-separated k-scheme, and i≥0. Write FmotiK(X) for stage i of the specified motivic filtration of the nonconnective K-theory spectrum of perfect complexes. The stage projection pi:π0FmotiK(X)⟶Hmot2i,i(X,Z) is induced by the map from that stage to its graded cofiber Z(i)mot(X)[2i]. Here Hmota,i(X,Z) is degree-a cohomology of the specified weight-i motivic complex. Both the filtration and the complex are restricted from the prime field of k.

The image filtration group FmotiK0(X) is the image of the stage-to-K(X) homomorphism on π0; write qi:π0FmotiK(X)→FmotiK0(X) for its canonical corestriction. If k is algebraically closed and X is normal, then for 0≤i≤2 the map qi is an isomorphism. For these indices the same symbol pi also denotes the transported homomorphism FmotiK0(X)→ qi−1 π0FmotiK(X)→ pi Hmot2i,i(X,Z). This convention covers every normal qcqs k-scheme, including the normal finite-type case. It requires no finite-type, Noetherian or dimension bound. At stage zero, the equivalence Fmot0K(X)=K(X) already identifies the stage and image for every X above. Normal means that every local ring is an integrally closed domain. Finite type means that X has a finite affine cover by spectra of finitely generated k-algebras. Choice means that every family of nonempty sets has a choice function; the size bounds fix the small sites and ambient universes of the specified constructions.

For i=3 the stage projection has domain π0Fmot3K(X). The low-stage identification above does not itself identify this domain with Fmot3K0(X); image-domain notation at stage three requires a separate justification.

Facts & Assumptions

Given: A field k, a qcqs k-scheme X, Choice, compatible site and universe size bounds, and i≥0. For the image-domain convention in stages one and two, also assume that k is algebraically closed and X is normal.

Goal: Define the actual stage projections and justify their low-stage image-domain convention throughout the original normal qcqs scope.

[F1]

Motivic filtration and image groups supplies the actual tower, compatible augmentations, the stage-zero equivalence with K(X) and the image groups. It and Motivic complexes and cohomology specify restriction from the prime field. The Axiom of Choice supplies the assumed Choice premise for the perfect-complex realization and site constructions.

[F2]

External actual graded algebra and multiplicative tower spectral sequence supplies the natural equivalence gr⁡iFmotK≃Z(i)mot[2i] on qcqs prime-field schemes under the given Choice and size assumptions. The complexes and graded cofibers are those of the same actual tower; no convergence hypothesis is needed. Motivic complexes and cohomology specifies their cohomology notation.

[F3]

The actual determinant fiber is a natural retract of the rank-zero K-space applies to all qcqs schemes over a field under Choice and the existing size bounds. For S=Ω∞Fmot1K, B=Ω∞gr⁡1FmotK and T=Ω∞Fmot2K, it supplies the actual pointed section κ:B→S of d:S→B and injections π0T(X)→π0S(X)→K0(X). The section is a map of spaces and need not be additive. The second injection uses the actual rank fiber over a discrete target.

[F4]

Stage projections, kernels and image groups gives homotopy exactness and the criterion for a stage projection to descend to its image: the kernel of the augmentation must lie in the kernel of the projection. In particular an injective augmentation suffices.

Justification

1.1 Let F be the prime field of k. Forgetting to F preserves the underlying qcqs scheme and takes each k-morphism to an F-morphism. Under the Choice and size assumptions in [F1], restrict the natural graded equivalence in [F2] along this forgetful functor. By the definitions in [F1], its source and target are exactly the specified tower's graded cofiber and the specified shifted motivic complex on X. This applies over every field k without a finite-type or convergence hypothesis. [F1, F2, given]

1.2 Apply [F3] to the given qcqs X. Evaluating dκ≃id at X makes π1S(X)→π1B(X) surjective. The actual fiber sequence therefore has zero boundary into π0T(X), and its transition π0Fmot2K(X)→π0Fmot1K(X) is injective. The first-stage augmentation is injective by the rank-fiber assertion in [F3]. Their composite is the second-stage augmentation by [F1], so it too is injective. Stage zero has its augmentation equivalence. Thus every qi for 0≤i≤2 is injective and is surjective onto its image by definition; in particular this applies on the stated normal qcqs schemes. [F1, F3, F4, given]

2.1 The cofiber sequence Fmoti+1K(X)→FmotiK(X)→gr⁡iFmotK(X) and step 1.1 give the stage-to-complex map. Applying π0 identifies its target with H0(Z(i)mot(X)[2i])=Hmot2i,i(X,Z). This defines the displayed homomorphism for every i≥0, naturally under pullback. [F1, F2, F4, step 1.1]

3.1 Each qi in step 1.2 is an isomorphism of abelian groups. Compose its inverse with the projection in step 2.1 to obtain the displayed image-domain homomorphism. It is the unique map whose composite with qi is the stage projection, since qi is surjective. Equivalently, [F4]'s kernel criterion holds because the augmentation is injective. The construction is natural and agrees with the same transport in the finite-type special case. [F1, F4, step 2.1, step 1.2]

4.1 Step 1.2 identifies only the augmentations in stages zero, one and two. It gives no third-stage injectivity, so p3 retains the stage domain of step 2.1 until a separate result supplies image-domain identification or descent. This establishes all stated conventions. [step 2.1, step 1.2, step 3.1] ∎

The supplied article PDF text was read at its conventions on p. 3, Lemma 4.1 and proof on pp. 8–9, Section 5 opening on p. 10, and Section 6 opening on pp. 12–13. The version-specific Elmanto–Morrow reading is recorded in the reference above. The current definitions, graded source input, stage-exactness argument, determinant-fiber proof and its rank-zero and global-Picard suppliers were inspected for these applications. Their underlying motivic, determinant and descent constructions are used through those contracts, not reconstructed here. The exact outside-resolution packet, its low-filtration proposal and the relevant genuine rejected response were consulted as proposals and historical evidence; they confer no acceptance. The separate finite-type low-homotopy lemma remains unchanged.

Reading limits

The supplied article PDF text was read at its conventions on p. 3, Lemma 4.1 and proof on pp. 8–9, Section 5 opening on p. 10, and Section 6 opening on pp. 12–13. The version-specific Elmanto–Morrow reading is recorded in the reference above. The current definitions, graded source input, stage-exactness argument, determinant-fiber proof and its rank-zero and global-Picard suppliers were inspected for these applications. Their underlying motivic, determinant and descent constructions are used through those contracts, not reconstructed here. The exact outside-resolution packet, its low-filtration proposal and the relevant genuine rejected response were consulted as proposals and historical evidence; they confer no acceptance. The separate finite-type low-homotopy lemma remains unchanged.

Depends on

Used by · 6

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