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 be a field. Take , , , , all other terms zero, and every differential zero. In the direct-sum tensor total complex the homology bases are All other homology groups vanish. Every Tor correction is zero. More generally, over , 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.
Nonnegative free PID complexes have the natural Kunneth short exact sequence under AC: The natural PID Kunneth sequence is exact.
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.
Balanced Tor is computed using either supplied projective resolution: The balanced Tor bifunctor.
A self-map of a set can be iterated from any prescribed initial element: The recursion theorem.
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 -indexed chain.
Verification
A field is a PID: a nonzero ideal contains , hence also and so is the whole field; the remaining ideal is . 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 . The only tensor terms are exactly those displayed in degrees .
First derive the DC hypothesis of [F3] from the assumed AC. Given an entire relation on a nonempty set and , AC chooses for each an element of the nonempty successor set . By [F4], iterate from to obtain and , so for every ; this is [F5]. Now for any -modules , [F2] makes both projective under AC. Supply the resolutions having , respectively , only in degree zero and identity augmentation. The tensor resolution then has no positive-degree terms, so its homology in every degree is zero. Hence [F3] gives , including zero or . In particular every summand in the Kunneth Tor term vanishes for any complexes under discussion.
These tensors are bases: for example and are inverse linear maps , since balancing identifies with . 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.
Exactness in [F1] now makes the cross product injective and surjective for every . In this instance it sends , , , 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 ; in higher degrees the same vanishing argument applies, including where every term is zero.
For arbitrary maps of such complexes write for the induced map on tensor-complex homology and for the induced map on the tensor of homologies. Naturality in [F1] gives . Multiplying by the inverses just proved gives . 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
23 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
- tom Dieck, Algebraic Topology, Theorem 11.10.1, printed pp.298–299; field specialization (standard reference, not scraped)