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.

Stage bounds imply completeness and finite multiplicative convergence

PDF p. 4: Motivic graded spectral sequence; PDF p. 9: Eventual filtration vanishing

Statement

Assume the Axiom of Choice. If X has finite valuative dimension, the actual motivic filtration is complete and the preceding multiplicative spectral sequence converges with E∞a,b≃Fmot−bK−a−b(X)/Fmot−b+1K−a−b(X). Each Kn(X) has its finite image filtration in this assertion; no splitting of that filtration is claimed.

Facts & Assumptions

[A1]

The Axiom of Choice and the fixed size conventions of the cited constructions are inherited through Identifying all spectral-sequence pages with the source multiplicative pages. They discharge that supplier’s local-realization premise at its first application below. The Axiom of Choice

Given: The Axiom of Choice and the fixed size conventions of the cited constructions, together with a qcqs scheme X over the standing field with finite valuative dimension, and the actual tower.

Goal: Check the stagewise hypotheses for convergence and the zero-limit assertion.

[F1]

External actual motivic stagewise boundedness supplies B≥0 with FrK(X)∈Sp≥r−B. Motivic filtration and image groups identifies every stage r≤0 and its augmentation with K.

[F2]

Spectral sequence of a tower gives finite convergence from actual high-stage vanishing and low-stage isomorphisms. Stable spectra and exact triangles supplies stable limits; Identifying all spectral-sequence pages with the source multiplicative pages identifies the source products and their abutment maps.

Proof

1.1A1F1F2construct

Use the supplied realization under [A1]. Regard X as a scheme over the prime field of its standing field, so the stage-bound supplier in [F1] applies to this actual restricted tower. Choose its integer B=B(X)≥0. Its contract covers every qcqs scheme of finite valuative dimension, including the empty scheme. Use that bound uniformly: for any fixed integer n, set Un=max⁡(1,B+n+1) and Ln=0. If r≥Un then n<r−B, so πnFr=0. If r≤Ln, the map to K is an equivalence by [F1]. These are precisely the high/low hypotheses of [F2], including actual vanishing of stage groups rather than only their images. The resulting additive convergence and displayed associated-graded identification are therefore those of [F2].

2.1F1F2step 1.1

Completeness also follows from the stage bound. The sequential limit of spectra is the fiber of 1−shift:∏r≥0Fr→∏r≥0Fr. For any fixed degree n, the groups πnFr and πn+1Fr are zero for sufficiently large r by step 1.1. On their finite-support products 1−shift is an isomorphism, with inverse the finite geometric sum of the nilpotent shift. The fiber long exact sequence thus gives πnlim⁡rFr=0 for every n, hence the limit spectrum is zero. Restricting to stages r≥0 is cofinal for this tower limit.

3.1F1F2step 1.1step 2.1∎

The image filtration on each Kn is full for r≤0 and zero for r≥Un, so it is finite. The product identification in [F2] makes the convergence in step 1.1 multiplicative with exactly this finite filtered abutment. This proves all claims.

Depends on

Used by · 1

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.