Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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.

Over a field the cross product itself is a natural isomorphism

Example

Assume AC and let k be a field. Take C0=ka, C1=kb, D0=ku, D1=kv, all other terms zero, and every differential zero. In the direct-sum tensor total complex the homology bases are H0:k(a⊗u),H1:k(b⊗u)⊕k(a⊗v),H2:k(b⊗v). All other homology groups vanish. Every Tor correction is zero. More generally, over k, the cross product is a natural isomorphism for any nonnegative free complexes as in the AC-qualified PID Kunneth theorem; its inverse is determined by the cross product itself.

Facts & Assumptions

Given: The field, complexes, and The Axiom of Choice in the example.

[F1]

Nonnegative free PID complexes have the natural Kunneth short exact sequence under AC: The natural PID Kunneth sequence is exact.

[F2]

Under AC, every module over a field is free and projective: Modules over a field are projective, flat, and injective. Only those clauses are used.

[F3]

Balanced Tor is computed using either supplied projective resolution: The balanced Tor bifunctor.

[F4]

A self-map of a set can be iterated from any prescribed initial element: The recursion theorem.

[F5]

DC is the assertion that every entire relation on a nonempty set has such a sequence from a prescribed initial point: The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain.

Verification

1.1F1given

A field is a PID: a nonzero ideal contains c≠0, hence also c−1c=1 and so is the whole field; the remaining ideal is (0). The displayed complexes are nonnegative and have free terms with their stated bases, so [F1] applies. Each factor has zero differential, and the Koszul formula gives d(a⊗u)=d(b⊗u)=d(a⊗v)=d(b⊗v)=0. The only tensor terms are exactly those displayed in degrees 0,1,2.

1.2givenF2F3F4F5

First derive the DC hypothesis of [F3] from the assumed AC. Given an entire relation E on a nonempty set S and a∈S, AC chooses for each x∈S an element f(x) of the nonempty successor set Ex={y:xEy}. By [F4], iterate f from a to obtain x0=a and xm+1=f(xm), so xmExm+1 for every m; this is [F5]. Now for any k-modules U,V, [F2] makes both projective under AC. Supply the resolutions having U, respectively V, only in degree zero and identity augmentation. The tensor resolution then has no positive-degree terms, so its homology in every degree i>0 is zero. Hence [F3] gives Tor⁡1k(U,V)=0, including zero U or V. In particular every summand in the Kunneth Tor term vanishes for any complexes under discussion.

2.1step 1.1

These tensors are bases: for example (λb)⊗(μu)↦λμ and ν↦ν(b⊗u) are inverse linear maps kb⊗ku↔k, since balancing identifies (λb)⊗(μu) with (λμ)(b⊗u). The same formulas apply to the other three one-dimensional factors. In degree one the two bidegrees form a direct sum. As all differentials vanish, every element is a cycle and the only boundary is zero; this proves the listed homology bases and vanishing elsewhere.

3.1F1step 2.1step 1.2

Exactness in [F1] now makes the cross product αn injective and surjective for every n. In this instance it sends [a]⊗[u], [b]⊗[u], [a]⊗[v], [b]⊗[v] to the four homology basis elements in that order. Its inverse sends those four elements back to the four tensors of classes, extended linearly. Both composites fix a basis and therefore every element. Degree zero has an empty Tor sum; degree one has the single zero group Tor⁡1(k,k); in higher degrees the same vanishing argument applies, including where every term is zero.

4.1F1step 3.1∎

For arbitrary maps of such complexes write h for the induced map on tensor-complex homology and k∗ for the induced map on the tensor of homologies. Naturality in [F1] gives hαn=αn′k∗. Multiplying by the inverses just proved gives αn′−1h=k∗αn−1. Hence the inverse is natural as well. There is no selected complement in this inverse: it is the unique inverse of the canonical cross product after the Tor term vanishes.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

28 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