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.
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.
Depends on
- The Axiom of Choice
- The natural PID Kunneth sequence is exact
- The PID Kunneth sequence admits a section after choices
- The balanced Tor bifunctor
- Over an integral domain, degrees add under multiplication of nonzero polynomials
- Division algorithm for polynomials over a field
- Every Euclidean domain is a principal ideal domain
- The cycle-boundary tensor sequence has the Kunneth kernel and cokernel
- The recursion theorem
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
40 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
- Friedman, Singular Intersection Homology, §6.4.5, Lemma 6.4.19, printed pp.318–320; specialized two-term representative (standard reference, not scraped)
- tom Dieck, Algebraic Topology, Theorem 11.10.1, printed pp.298–299 (standard reference, not scraped)