Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02
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.

Euler class of a two-term mapping cone

Example

Let f:P→Q be a homomorphism of finitely generated projective left A-modules over a unital associative ring A, regarded as degree-zero cochain complexes. Then Cone⁡(f) has P in degree −1 and Q in degree 0. Hence [Cone⁡(f)]=[Q[0]]−[P[0]] in K0tri(Dperf(A)) and χ(Cone⁡(f))=[Q]−[P] in K0split(Proj⁡fg(A)). In particular the cone of right multiplication ra:A→A, x↦xa, on the left regular module has Euler class zero for every a∈A, regardless of its kernel or cokernel.

Facts & Assumptions

Given: A unital associative ring A; a homomorphism f:P→Q of finitely generated projective left A-modules, viewed as cochain complexes concentrated in degree 0; and an element a∈A.

[F1]

The mapping cone of a chain map f:C∙→D∙ has Cone⁡(f)n=Dn⊕Cn−1 with differential dn(y,x)=(dnDy+fn−1x,−dn−1Cx) (The mapping cone of a chain map).

[F2]

In the cochain convention of the derived category, Cone⁡(f)n=Yn⊕Xn+1 with d(y,x)=(dYy+fx,−dXx) for a chain map f:X→Y of cochain complexes, the cone triangle ends in X[1], and the degree-zero stalk complex S0(M) has M in degree 0 and zero elsewhere (Derived category of an abelian category, Zero complex and stalk complex).

[F3]

In K0tri, [X[n]]=(−1)n[X] (Shift signs and exact-functor maps on triangulated K0).

[F4]

For a bounded complex P of finitely generated projective left modules, χ(P)=∑n(−1)n[Pn] defines a class depending only on the represented perfect object (Euler class of a bounded projective complex is derived invariant and triangle additive).

[F5]

Degree-zero inclusion gives the isomorphism K0split(Proj⁡fg(A))→K0tri(Dperf(A)) with [P]↦[P[0]] (Triangle K0 of perfect complexes equals split K0 of finite projectives).

Verification

technique · direct
1.1F1F2algebra

Under cochain reindexing Xi=X−i, the chain-cone terms Dn⊕Cn−1 of [F1] become Qi⊕Pi+1, agreeing with the cochain formula of [F2]. For degree-zero stalk complexes, the only nonzero terms are Q in degree 0 and P in degree −1, with differential f:P→Q. Thus Cone⁡(f) is bounded with finitely generated projective terms.

2.1F2F3F4F5step 1.1algebra

The cone triangle P[0]→Q[0]→Cone⁡(f)→P[1] of [F2] is a distinguished triangle of Dperf(A), since all three terms are bounded complexes of finitely generated projectives; its relation and the shift sign [F3] give [Cone⁡(f)]=[Q[0]]+[P[1]]=[Q[0]]−[P[0]] in K0tri(Dperf(A)). Independently, the Euler class formula of [F4] on the two-term complex of step 1.1 gives χ(Cone⁡(f))=(−1)−1[P]+(−1)0[Q]=[Q]−[P] in K0split(Proj⁡fg(A)), and the comparison isomorphism of [F5] carries this class to [Q[0]]−[P[0]], so the two computations agree as promised.

3.1F4F5step 2.1algebra∎

Right multiplication ra(x):=xa is left A-linear: ra(bx)=(bx)a=b(xa)=b ra(x) for all b,x∈A. Taking P=Q=A and f=ra in step 2.1 gives [Cone⁡(ra)]=[A[0]]−[A[0]]=0 and χ(Cone⁡(ra))=[A]−[A]=0 for every a∈A, whatever the kernel {x:xa=0} and cokernel A/Aa may be: the two projective terms cancel even when the cone is not acyclic, and no assertion that its cohomology modules are projective is used.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

43 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