Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Naturality of the Chow ring and the projection formula

Statement

Assume the Axiom of Choice (The Axiom of Choice) inherited from the smooth-immersion and homological suppliers. For every morphism f:X→Y of smooth equidimensional finite type schemes over k, f∗:A∗(Y)→A∗(X) is the graph Gysin pullback, preserves codimension and the unit, is a ring homomorphism, and obeys (gf)∗=f∗g∗. If f is flat it is precisely the previously defined flat pullback. For proper f, proper pushforward shifts codimension by dim⁡Y−dim⁡X, obeys (gf)∗=g∗f∗ for proper composites, and f∗(f∗α⋅β)=α⋅f∗β. Flat/proper composition laws are asserted under their respective hypotheses, not by identifying the two kinds of operation.

Facts & Assumptions

Given: the Axiom of Choice; smooth equidimensional finite type k-schemes X,Y and a morphism f:X→Y; for the last assertions a composable morphism g:Y→Z.

[L1]

The Chow ring structure: Ap(X)=Adim⁡X−p(X) is a commutative graded ring with product ΔX!(α×β), unit [X], graph pullback f∗=Γf!pr⁡Y∗, and for proper f the projection formula f∗(f∗α β)=αf∗β (The intersection product and Chow ring of a smooth scheme).

[L2]

Graph Gysin pullback is a regular-section Gysin, hence commutes with flat pullback and composes; the graph is a regular immersion and a section of the smooth projection to the source. When f is flat, the regular-immersion-followed-by-smooth-projection identity applied to Γf:X↪X×kY and pr⁡Y gives Γf!pr⁡Y∗=f∗ for the flat pullback (Refined Gysin operations commute and compose).

[L3]

Proper pushforward of cycles is functorial under composition and shifts degrees by the dimension difference; flat pullback is functorial and preserves codimension (Proper pushforward of cycles and the norm formula, Flat pullback of cycles and of rational equivalence).

Proof

technique · direct; translate each statement into the operational description of the pullback and apply the composition and commutation theorems for refined Gysin
1.1L1L2givenalgebra

Pullback is a unital ring homomorphism. By [L1] the graph pullback f∗=Γf!pr⁡Y∗ is a composite of refined Gysin operations, which preserve codimension by [L2]; it is unital because Γf!pr⁡Y∗[Y]=[Γf]=[X] up to the canonical identification of the graph with X, and the smooth-section identity gives Γf!pr⁡X∗=1. To see that f∗ is multiplicative, write α=c[Y] and β=d[Y] in the operational description of [L1]: restriction of operational classes is a ring map by [L2], so f∗(αβ)=f∗(cd[Y])=cd[X]=f∗α f∗β. Composition (gf)∗=f∗g∗ follows from the composition theorem for refined Gysin applied to the composable graphs, with the projection identity of [L2].

2.1L2L3step 1.1algebra

Agreement with flat pullback. If f is flat, apply the regular-immersion/smooth-projection identity of [L2] to Γf:X↪X×kY followed by pr⁡Y:X×kY→Y. Its composite is f, flat of relative dimension dim⁡X−dim⁡Y, so the identity gives Γf!pr⁡Y∗=f∗ for the flat pullback; hence f∗ agrees with the flat pullback of [L3] on classes of the stated dimensions.

3.1L1L3step 1.1algebra∎

Proper pushforward. If f is proper, [L3] gives functoriality (gf)∗=g∗f∗ and the codimension shift dim⁡Y−dim⁡X on nonzero cycle classes, since a proper pushforward of a p-dimensional class is supported on images of dimension at most p and the norm-degree formula is multiplicative in towers. The projection formula is the corresponding statement of [L1], with the identification Ap=Adim⁡−p: writing α=c[Y] in operational form, f∗(cβ)=c f∗β is the proper axiom of bivariant classes, which is exactly f∗(f∗α β)=α f∗β.

Depends on

Used by

Dependency tree · two levels

44 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources