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.

Rigidification and effective descent of line bundles

Statement

Assume AC and DC as inherited from the supplied scheme and cohomology results. Let A be an abelian variety over a field k with identity e (Abelian varieties over a field) and let T be a k-scheme, with AT=A×kT, unit section eT, and projection pT:AT→T. Then the rigidified line-bundle functor of The rigidified relative Picard functor and the dual abelian variety is an fppf sheaf on all k-schemes, rigidified line bundles have no nontrivial automorphisms, and the normalization L↦L⊗pT∗eT∗L−1 identifies the rigidified classes over T with Pic⁡(AT)/pT∗Pic⁡(T).

Facts & Assumptions

Given: AC and DC, an abelian variety A/k with identity e, a k-scheme T, and the base-changed abelian scheme AT→T.

[F1]

For every T the unit map OT→pT,∗OAT is an isomorphism with inverse evaluation along eT; in particular every global function comes from the test base (Universal structure-sheaf sections of an abelian scheme, assuming AC and DC).

[F2]

Global sections are compatible with flat field base change, so the computation of H0 may be done after extending the base field (Global sections commute with extension of scalars over a field); faithfully flat descent of modules and algebras is effective (Faithfully flat descent of modules and algebras is effective).

Proof

technique · direct: normalize to remove constants, observe automorphism-freeness, and descend along an fppf cover
1.1F1F2givenalgebra

For an affine test T=Spec⁡R the universal-sections statement [F1] gives Γ(AT,O)=R compatibly with base change; on a finite affine Cech cover of AT the cohomology complex computing H0 is obtained by tensoring the field cohomology complex, whose H0 is k, and hence has H0=R. It follows that the normalization L↦L⊗pT∗eT∗L−1 is well defined on isomorphism classes and identifies rigidified classes with Pic⁡(AT)/pT∗Pic⁡(T): tensoring by constants is exactly the ambiguity removed by the trivialisation along eT.

2.1F1step 1.1algebra

A rigidified line bundle has no nontrivial automorphism: an automorphism of (L,α) is a unit of OT acting on L, and compatibility with the rigidification forces it to restrict to 1 along eT; since eT is a section, the unit is 1. Consequently isomorphism data on overlaps of an fppf cover are unique and therefore automatically satisfy the cocycle condition.

3.1F2step 2.1algebra

Let T′→T be an fppf cover and suppose a rigidified line bundle is given on AT′ together with an isomorphism of its two pullbacks to AT′×TT′; by step 2.1 this isomorphism is unique and satisfies the cocycle condition, so the usual effective descent for invertible modules [F2] produces an invertible sheaf on AT; the rigidification descends because it is a morphism whose pullbacks agree. Hence the rigidified functor is already an fppf sheaf, without invoking representability, and the identification of step 1.1 is compatible with the sheaf structure.

4.1F2step 3.1algebra∎

For general k one first verifies the assertions over an algebraic closure using the field-compatibility of global sections in [F2] and then descends the resulting identifications along the faithfully flat field extension; the rigidification data are defined over k and descend by [F2]. No representability of the Picard functor is used anywhere.

Depends on

Used by

Dependency tree · two levels

37 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