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.
Kunneth Exactness and Splittings over Principal Ideal Domains — Examples
1 · Prerequisites
- Abelian Categories
- Binary Operations, Monoids, Groups and Subgroups
- Cardinal Arithmetic, Cofinality and the Alephs
- Categories, Functors and Natural Transformations
- Chain Complexes and Homology
- Chain Homotopy and the Homotopy Category
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Exactness and the Member Calculus
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Kunneth Exactness and Splittings over Principal Ideal Domains
- Limits and Colimits
- Linear Independence, Bases and Dimension
- Long Exact Sequences in Homology
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordinal Arithmetic and the First Uncountable Ordinal
- Ordinals, Cardinals, and Transfinite Recursion
- Polynomial Rings, the Division Algorithm and Roots
- Preadditive and Additive Categories and Biproducts
- Projective and Injective Resolutions
- Reflective Subcategories and the Adjoint Functor Theorems
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Subobject Lattices Generators and the Grothendieck Axioms
- Suprema and Infima
- Tensor Products of Modules
- The Diagram Lemmas in an Abelian Category
- The ZFC Axioms and the Basic Set Constructions
- Tor Flatness and Global Dimension
- Universal Coefficients and Kunneth Theorems
- Universal Properties, Representables and the Yoneda Lemma
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
Two calculations use the direct-sum tensor complex with its Koszul sign. Over , two multiplication-by- complexes give a nonzero degree-one Tor class whose image under the canonical quotient is computed explicitly. Over a field, four displayed tensor generators account for all homology and the Tor correction vanishes. The latter yields a natural inverse to the cross product. Both examples retain the Axiom of Choice for their use of the balanced Tor interface.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A polynomial PID has a nonzero Kunneth Tor class
Example
Assume AC and let be a field. Over the PID , take in degrees , with respective bases and . With the direct-sum total complex and Koszul differential, The class maps to the generator of . Thus the tensor cross product alone does not exhaust degree-one homology, although the Kunneth sequence has a section.
Facts & Assumptions
Given: A field , the two displayed complexes, and The Axiom of Choice.
Products of nonzero polynomials over a domain are nonzero and degrees add: Over an integral domain, degrees add under multiplication of nonzero polynomials.
Polynomial division over a field gives a zero remainder or one of degree smaller than the nonzero divisor: Division algorithm for polynomials over a field.
Every Euclidean domain is a PID: Every Euclidean domain is a principal ideal domain.
The AC-qualified natural Kunneth sequence uses the cycle tensor cross product: The natural PID Kunneth sequence is exact.
Under the same hypotheses its quotient has a linear section: The PID Kunneth sequence admits a section after choices.
Balanced Tor is computed from either supplied projective resolution under DC: The balanced Tor bifunctor.
The cycle-boundary kernel calculation identifies the Kunneth quotient as the corestricted with positive sign: The cycle-boundary tensor sequence has the Kunneth kernel and cokernel.
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
Since is a field, it is a domain. By [F1], is a domain, , and is not a unit: for nonzero would give . By [F2], degree on the nonzero polynomials satisfies the Euclidean division condition (the convention requires no multiplicative monotonicity). Thus [F3] applies and is a commutative PID. Multiplication by on is injective, so and all other homology groups of the two input complexes vanish.
Write , , , and . The tensor total complex has terms , , in degrees . Its Koszul formula gives , , and . Thus in the ordered basis , and ; .
The image of is , so . Since is not a zero divisor, exactly when . Hence and , giving via . Also forces and hence , so . There are no chain terms in the other degrees.
First derive the DC hypothesis of [F6] from the assumed AC. Given an entire relation on a nonempty set and , AC chooses a successor function with for every . By [F8], iterate from ; the resulting sequence satisfies [F9]. The length-one free resolution of the first module, tensored with , has differential zero and no degree-two term. Thus [F6] gives , represented by . In the cycle-boundary presentation , identify its degree-one free module by . This is an isomorphism because is nonzero in a domain.
The map sends to , while is zero. Therefore sends the degree-one cycle to , whose homology image is . Under the resolution identification of step 2.2, this is exactly , the positive generator. Since , the image and the original class are nonzero. This calculation works also in characteristic two, where minus equals plus but still means .
In degree one the tensor term of [F4] is zero because only degree-zero input homology is nonzero. Hence the quotient is an isomorphism, with section explicitly , well defined by step 2.1 and inverse by step 3.1. It is a section of the kind guaranteed by [F5]. In degree zero, multiplication gives with inverse : balancing gives . The cross product carries this tensor generator to . These computations verify the zero and one degree endpoints and all higher vanishing.
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.