Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Relative Kronecker evaluation is well defined, biadditive and natural

Statement

Let (X,A) be a topological pair, let G be an abelian group and let k be an integer. Relative Kronecker evaluation ⟨−,−⟩:Hk(X,A;G)×Hk(X,A;Z)→G is well defined, biadditive and compatible with coefficient homomorphisms u:G→G′, and it is natural for maps of pairs f:(X,A)→(Y,B): ⟨f∗α,z⟩=⟨α,f∗z⟩. If instead R is a commutative unital ring, R-linear relative cochains and chains over R give an R-bilinear pairing Hk(X,A;R)×Hk(X,A;R)→R with the same naturality. No multiplication on an arbitrary abelian group G is assumed.

Facts & Assumptions

Given: A topological pair (X,A), an abelian group G and an integer k.

[L1]

Relative singular cochains are Ck(X,A;G)=Hom⁡Z(Ck(X,A;Z),G) with δφ=φ∂ˉ, identified with the cochains on X vanishing on simplices in A; relative cohomology is the cohomology of this complex, and Ck(X,A;G)=0 for k<0 (Relative singular cochain complex).

[L2]

Relative singular homology is the homology of C∙(X,A;Z)=C∙(X;Z)/C∙(A;Z); a relative k-cycle is an integral chain z with ∂z∈Ck−1(A;Z), modulo chains in A and boundaries (Relative singular homology).

[L3]

Absolute Kronecker evaluation is ⟨[φ],[c]⟩=φ(c) for an integral cycle c and a cocycle φ (Kronecker evaluation pairing).

[L4]

The absolute Kronecker pairing descends through both quotients, is biadditive, is compatible with coefficient homomorphisms and is natural (The kronecker pairing is independent of cocycle and cycle representatives).

[L5]

A continuous map f:X→Y induces chain maps f#:C∙(X;Z)→C∙(Y;Z) and f∗ on cohomology with coefficients, with f∗[φ]=[φf#] (Singular chains and singular homology are covariantly functorial, Singular cohomology is contravariantly functorial).

Proof

technique · direct
1.1L1L2given

For a relative cocycle α∈Zk(X,A;G) and a relative k-cycle z define E(α,z)=α(z)∈G; this is a G-valued function of the pair of representatives, and the relative chain condition ∂z∈Ck−1(A;Z) together with the vanishing of α on A-simplices is available by [L1] and [L2].

2.1step 1.1L1L2

If z′=z+∂b+c with b∈Ck+1(X;Z) and c∈Ck(A;Z) is another representative of the same relative class, then E(α,z′)=α(z)+α(∂b)+α(c)=α(z)+δα(b)+0=α(z) because δα=0 and α vanishes on A-simplices, so E is independent of the relative cycle representative.

3.1step 2.1L1L2

If α′=α+δβ is another relative cocycle representative, then E(α′,z)=α(z)+β(∂z)=α(z) because ∂z∈Ck−1(A;Z) and β vanishes on A-simplices, so E is independent of the relative cocycle representative.

4.1step 3.1L1L2L4

Steps 2.1 and 3.1 descend E to a well-defined map ⟨−,−⟩:Hk(X,A;G)×Hk(X,A;Z)→G, the relative form of the absolute descent in [L4]; for k<0 both groups are zero by [L1] and [L2] and the pairing is the zero map.

5.1step 4.1L1

The descended pairing is biadditive: for relative cocycles α,α′ and relative cycles z,z′ one has E(α+α′,z)=E(α,z)+E(α′,z) and E(α,z+z′)=E(α,z)+E(α,z′) because Ck(X,A;G) consists of additive homomorphisms and evaluation is additive in the chain variable, and these identities pass to the quotients.

6.1step 5.1L1

The pairing is coefficient-compatible: for a coefficient homomorphism u:G→G′ the composite u∘α again vanishes on A-simplices and satisfies δ(u∘α)=u∘δα=0, and E(u∘α,z)=u(E(α,z)); hence on classes ⟨u∗[α],[z]⟩=u⟨[α],[z]⟩.

7.1step 6.1L1L2L5

It is natural: a map of pairs f:(X,A)→(Y,B) has f#(C∙(A;Z))⊆C∙(B;Z) by [L5], so f# descends to relative chains and f# carries cochains vanishing on B-simplices to cochains vanishing on A-simplices; on representatives (f#φ)(z)=φ(f#z), which descends to ⟨f∗[φ],[z]⟩=⟨[φ],f∗[z]⟩ by step 4.1.

8.1step 7.1L1L2

If R is a commutative unital ring and the cochains and chains are the R-linear ones, the same formulae with R-linear maps show that E(rα,z)=rE(α,z)=E(α,rz), so the descended pairing is R-bilinear and the computation of steps 2.1, 3.1, 5.1 and 7.1 applies verbatim, giving the pairing Hk(X,A;R)×Hk(X,A;R)→R with the same naturality; the abelian-group statement keeps integral chains on the homology side.

9.1step 8.1L1L2L3∎

The special cases are consistent with the statement: A=∅ recovers the absolute pairing of [L3] and [L4]; A=X or X=∅ or G=0 gives the zero pairing; and for k<0 both sides are zero.

Depends on

Used by

Dependency tree · two levels

14 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