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.
External evaluation detects tensor-square operations
Statement
Assume AC. For every d,e≥0, let X_d=(RP^L)^(d+1), X_e=(RP^L)^(e+1), with L≥max(d,e)+1 and P_d=∏x_i, P_e=∏y_j. The map A^d⊗A^e→H*(X_d;F₂)⊗H*(X_e;F₂), a⊗b↦a(P_d)⊗b(P_e), is injective; under Künneth, external products jointly detect every homogeneous tensor of square operations.
Facts & Assumptions
Given: AC; the mod-two square algebra with its admissible basis in each degree ; the space with and the class ; and the external action of on external products .
The admissible composites of a fixed degree have distinct leading monomials on with coefficient one, their excess is at most , and the evaluation is therefore injective on (Admissible square actions have distinct leading monomials, Admissible composites present the mod-two square algebra).
The cohomological Künneth cross product identifies the graded tensor product of the factors with and preserves the factor bidegrees (Cohomological Kunneth cross product is a ring isomorphism); squares are natural and act componentwise through the Cartan formula.
Under AC, independent vectors extend to a basis; the tensor universal property makes the tensor of linear left inverses a left inverse of the tensor map (Zorn's lemma gives a basis between any linearly independent set and any spanning set containing it: if with independent and , there is a basis of with , Universal property of the tensor product for balanced maps into abelian groups).
Proof
Let A^d be the degree-d part of the square algebra. By the admissible-basis theorem, its basis consists of Sq^I with |I|=d. Set X_d=(RP^L)^{d+1}, P_d=x₁⋯x_{d+1}, with L≥d+1. Every admissible I of degree d has e(I)≤d<d+1. The leading-monomial lemma therefore applies and gives distinct largest monomials for the classes Sq^I(P_d). Those classes are linearly independent: in a nonzero finite linear combination, the largest of the distinct leading monomials cannot cancel. Thus evaluation j_d:A^d→H*(X_d;F₂), a↦a(P_d), is injective. For d=0, X_0=RP^L and P_0=x₁; the identity operation sends x₁ to the nonzero class x₁.
The map is injective for an explicit linear-algebra reason. Extend bases of im(j_d) and im(j_e) to bases of the two target vector spaces. Projection to im(j_d), followed by j_d⁻¹, gives a left inverse r_d of j_d; similarly obtain r_e. Then r_d⊗r_e is a left inverse of j_d⊗j_e by the tensor universal property, so j_d⊗j_e is injective. The cohomological Künneth theorem identifies the target with the corresponding external-product subspace in H*(X_d×X_e;F₂). Distinct bidegrees remain distinct under this Künneth decomposition. Since every tensor is a finite sum of homogeneous bidegrees, an element of A⊗A acting as zero on every external product of classes must be zero. This proves tensor faithfulness.
Depends on
- Zorn's lemma gives a basis between any linearly independent set and any spanning set containing it: if $L \subseteq S \subseteq V$ with $L$ independent and $\operatorname{span}(S) = V$, there is a basis $B$ of $V$ with $L \subseteq B \subseteq S$
- Admissible square actions have distinct leading monomials
- Admissible composites present the mod-two square algebra
- Cohomological Kunneth cross product is a ring isomorphism
- Every vector space has a basis
- The Axiom of Choice
- Universal property of the tensor product for balanced maps into abelian groups
Used by
Dependency tree · two levels
48 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
- Allen Hatcher, Algebraic Topology (standard reference, not scraped)