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.

Homotopy invariance for vector bundles

Statement

Assume the Axiom of Choice (The Axiom of Choice) inherited from the proper/quasi-finite and scheme base-change suppliers. Fix a field k and let T be locally of finite type over k. For any rank-r vector bundle p:E→T, flat pullback p∗:Am(T)→Am+r(E) is bijective, including after every k-base change T′→T with T′ locally of finite type over k. Its inverse is denoted sE!.

Facts & Assumptions

Given: the Axiom of Choice; a field k; a scheme T locally of finite type over k and a rank-r vector bundle p:E→T.

[L1]

The projective bundle q:P(E∨⊕1)→T in the quotient convention has tautological quotient O(1) with ξ=c1(O(1)); the complement of the infinity divisor j:P(E∨)↪P(E∨⊕1), cut out by the section of O(1) coming from the trivial summand, is canonically E, and q∣E=p (The projective bundle formula for Chow groups, Intersection with an invertible sheaf and the first Chern class).

[L2]

Localization sequence and affine-space homotopy invariance (Localization sequence for Chow groups and homotopy invariance of affine space).

[L3]

Projective bundle formula on P(E∨) and P(E∨⊕1): the classes 1,ξ,… form a basis over the corresponding Chow groups, and caps by ξ commute with proper pushforward (The projective bundle formula for Chow groups, Intersection with an invertible sheaf and the first Chern class).

Proof

technique · direct; compactify the bundle by the projective completion, identify the image of the infinity pushforward inside the projective bundle basis by means of the trivial-summand section, and read off the quotient
1.1L1L2givenalgebra

Compactification and localization. If r=0, E=T and p=id⁡, so pullback and its inverse are the identity after every base change. Assume r≥1 for the compactification argument. Let q:P(E∨⊕1)→T be the projective completion with O(1) and ξ=c1(O(1)), and let j:P(E∨)↪P(E∨⊕1) be the infinity divisor, the zero scheme of the section of O(1) induced by the direct-summand 1⊆E∨⊕1. Its complement is E, and the restriction of q to E is p; hence the localization sequence of [L2] gives the exact sequence Am(P(E∨))→j∗Am(P(E∨⊕1))→Am(E)→0.

2.1L3step 1.1algebra

The image of the infinity pushforward. Write π=q∘j. For an integral cycle [V] on T, the trivial-summand section cuts the relative hyperplane P(E∨∣V) in the projective completion, with multiplicity one. The Cartier formula therefore gives j∗π∗[V]=ξ∩q∗[V], and linearity gives this identity for all classes β on T. Compatibility of the first Chern cap with proper pushforward then yields j∗(ξa∩π∗β)=ξa+1∩q∗β. Consequently, on the basis 1,ξ,…,ξr−1 over A∗(T) of the source and 1,ξ,…,ξr of the target supplied by [L3], the image of j∗ is exactly the span of the positive powers ξ1,…,ξr.

3.1L1L3step 1.1step 2.1algebra∎

Conclusion. By step 2.1 the quotient of A∗(P(E∨⊕1)) by the image of j∗ is the direct summand q∗A∗(T) spanned by 1, and by step 1.1 this quotient is exactly A∗(E); since q∣E=p, the induced map is the flat pullback p∗, which is therefore an isomorphism onto the summand spanned by the classes q∗α with m shifted by r. Both bundles and both bases pull back along any k-base change T′→T with T′ locally of finite type over k, so the same computation applies verbatim after base change; the inverse of p∗ is by definition sE!.

Depends on

Used by

Dependency tree · two levels

26 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