Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

H0 of the cotangent complex and the polynomial case

Statement

Assume the Axiom of Choice for the resolution-comparison supplier (The Axiom of Choice). (1) For every homomorphism A→B of commutative unital rings (Commutative ring) one has H0(LB/A)≅ΩB/A (The cotangent complex of a ring map, Universal Kähler differential module, Existence and generators of Kähler differentials, Homology object of a chain complex). (2) If B is a polynomial A-algebra, then LB/A is quasi-isomorphic to ΩB/A placed in degree 0 (Quasi-isomorphism).

Facts & Assumptions

Given: A map A→B of commutative unital rings; the standard resolution P∙→B with P0=A[B], P1=A[P0], and the cotangent complex LB/A with L−n=ΩPn/A⊗PnB.

[F1]

H0 of a complex concentrated in degrees ≤0 is the cokernel of the differential out of degree −1; the cotangent complex is concentrated in degrees ≤0 with L−1=ΩP1/A⊗P1B and L0=ΩP0/A⊗P0B (The cotangent complex of a ring map, Homology object of a chain complex).

[F2]

The module of Kähler differentials represents A-derivations: ΩB/A receives the universal derivation d ⁣:B→ΩB/A, and Der⁡A(B,−)≅Hom⁡B(ΩB/A,−) (Universal Kähler differential module, Derivation of an algebra, Existence and generators of Kähler differentials).

[F3]

Two admissible polynomial resolutions give canonically isomorphic cotangent complexes in the derived category, the standard resolution is admissible, and for polynomial B/A the constant identity augmentation is admissible (Independence of the cotangent complex from the chosen simplicial resolution, The standard simplicial resolution of a ring map).

[F4]

AC is inherited from the resolution-comparison supplier of [F3] and used nowhere else (The Axiom of Choice).

Proof

1.1F1F2

The cokernel presents derivations. Write P0=A[B] with symbols [b] and P1=A[P0]; the two face maps d0,d1 ⁣:P1→P0 send the outer variable [p] to p and to the variable [ϵ(p)], where ϵ ⁣:P0→B is the augmentation. The cokernel of the two face maps on differentials is therefore the free B-module on the symbols d[b] modulo the relations d(p)−d[ϵ(p)] as p ranges over P0. Taking p=a∈A, p=[b]+[c] and p=[b][c] forces d[a]=0, additivity and the Leibniz rule; conversely these derivation relations give d(p)=d[ϵ(p)] for every polynomial p by induction on sums and products. Hence the cokernel represents A-derivations B→− and is ΩB/A by [F2], and by [F1] it is H0(LB/A); this proves clause (1).

2.1F3step 1.1

The polynomial case. If B is a polynomial A-algebra, the constant simplicial A-algebra B with the identity augmentation is a polynomial resolution and its augmentation is a trivial Kan fibration; by [F3] it may be used to compute LB/A. Its associated differential complex is the constant simplicial module ΩB/A, whose alternating differential is the identity in positive even chain degrees and zero in odd degrees; pairing consecutive positive degrees contracts them, leaving ΩB/A in degree zero. Hence LB/A is quasi-isomorphic to ΩB/A placed in degree 0, proving clause (2).

3.1F3F4∎

Choice accounting. The only construction depending on AC is the comparison of resolutions in [F3], used in step 2.1; the computation of step 1.1 uses only the universal property of Kähler differentials.

Depends on

Used by

Dependency tree · two levels

35 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