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.

The actual EM first Chern class is additive and natural

PDF p. 2: Motivic projective bundle property; PDF p. 8: Orientation for the splitting principle

Statement

For every qcqs scheme X over a field, define c1 to be the degree-two map of EM Definition5.2. Then c1:Pic⁡(X)→H2,1(X) is a natural group homomorphism. In particular c1(L⊗M)=c1(L)+c1(M), c1(OX)=0, and c1(L∨)=−c1(L).

Facts & Assumptions

[F1]

External EM multiplicative motivic complexes and actual Chern map supplies the actual natural map RΓNis(X,Gm)[−1]→C1(X), and its source degree two identifies with Pic⁡(X) under tensor product.

[F2]

Picard group of a scheme defines this group and identifies its inverse with duality.

Proof

Given: X,L,M as stated.

Goal: Justify this definition, additivity and naturality.

1.1F1F2construct

Apply H2 to the map in [F1]. A map in the derived category induces an abelian-group homomorphism on cohomology, so its Picard map is additive for the tensor-product group law. It is well-defined on line-bundle isomorphism classes. This defines precisely the EM class, without replacing it by a K-zero line-class map.

2.1F1F2step 1.1∎

A group homomorphism sends the identity to zero and inverses to negatives. Thus the three identities hold by [F2]. The square of complexes for any pullback commutes by [F1]; its degree-two square gives f∗c1(L)=c1(f∗L).

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.