Alphabeta Math

Personal research

Scheme sites and cycle theories

Define the Nisnevich, cdh and étale interfaces and distinguish derived sections from localization. Build the higher-cycle and curve-divisor chains, with precise Levine–Weibel, Milnor-K and Euler terminology for the article's comparisons and questions.

1 · Prerequisites
2 · Logical flowchart

Arrows show item dependencies. A grouped prerequisite node points to items that use one or more of its members; their exact links are listed above.

3 · Items

Lemma

Maps to finite disjoint unions of the base

Definition

Levine–Weibel zero cycles

Definition

Euler class group presentation

Definition

Small sites and the plus construction

Lemma

Restriction of finite-support divisors

Lemma

Quotienting a compatible surjection

Lemma

Transporting an exact sequence through isomorphisms

Lemma

Degree-zero representatives modulo a boundary class

Lemma

Completion, divisors and degree on smooth curves

Lemma

Coordinate faces of the algebraic simplex

Lemma

Length multiplicity for one proper Cartier face

Lemma

Cycle coefficients and face intersections are open local

Theorem

External input for simplicial Bloch cycle groups

Theorem

External geometric inputs for affine reduction

Lemma

Kernel models the homotopy fiber when the cokernel is acyclic

Lemma

Uniqueness from squares and cubes

Lemma

The square-cube condition implies reducedness

Lemma

Uniqueness of an initial object

Lemma

Intermediate rings in finite algebras

Theorem

Seminormalization and the finite-type interface

Lemma

Length orders on an integral curve

Theorem

External norm-divisor identity for integral curves

Lemma

External inputs for flat descent of line bundles

Theorem

Proper norm and graph formulas for principal divisors

Theorem

Regularity and dimensions for finite-type cycle arguments