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.
Dualizing real vector-space sequences and the choice boundary
Statement
Write for the algebraic real dual. Two separate axiom branches clarify the exactness issue.
- Under AC, every short exact sequence of real vector spaces dualizes to the short exact sequence . * Under ZF + DC and the additional hypothesis that every subset of has the Baire property in its product topology, let be the finitely supported sequences. The functional given by does not extend linearly to . Consequently does not remain exact at after real dualization.
These are conditional assertions, not a consistency or nonprovability theorem for ZF. AC is not assumed in the second branch. The canonical extension of values on a supplied simplex basis is a different, choice-free construction.
Facts & Assumptions
Given: The objects and separate axiom branches of the statement.
Under AC, a linearly independent subset of a real vector space extends to a basis; taking the empty subset also produces a basis (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 , The Axiom of Choice).
Under DC, a nonempty complete metric space has dense intersection of every sequence of open dense sets (Under Dependent Choice, a nonempty complete metric space is not a countable union of closed sets with empty interior, The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain).
DC supplies a sequence starting at a specified element of a nonempty set whenever the successor relation is entire (The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain).
Extending a cochain by its prescribed values on the subspace-simplex basis and by zero on the remaining supplied simplices requires no choice (Canonical extension by zero of a singular cochain on a simplex basis).
Here a set is nowhere dense if its closure has empty interior, meager if it is contained in a countable union of nowhere dense sets, and has the Baire property if its symmetric difference with some open set is meager. The additional Baire-property hypothesis concerns itself; no theorem transferring such a hypothesis from another space is used.
Proof
Assume AC. For a subspace , apply [F1] to the empty independent set in to obtain a basis , and then to to obtain a basis of containing . If , assign value at and value zero at . A vector of has a unique finite expression in , so the corresponding finite sum defines a real-linear functional on . For a vector in , its expression in is also its expression in , and hence . These two basis constructions are the exact AC use. If , take the zero extension directly; if , take .
For an arbitrary short exact sequence as stated, transport a functional on to the subspace using the inverse of the injective map , and apply step 1.1. Thus is surjective. Since is surjective, implies , so is injective. The composite is zero since . Conversely, if , define for any with . Such an exists; two choices differ by an element of on which vanishes. This uniquely specifies without selecting lifts. It is linear by applying to sums and scalar multiples of any lifts, and . Hence . Only the surjectivity argument used AC. This also covers and the endpoint cases or .
In contrast to the AC conclusion of step 2.1, for the second branch assume only ZF + DC and the stated Baire-property hypothesis. On use the metric The triangle inequality follows termwise from that of ; positivity and symmetry are immediate. This metric induces the product topology. Indeed a sufficiently small metric ball forces any prescribed finite set of coordinate inequalities, by the individual positive weights. Conversely a small restriction on finitely many initial coordinates makes the corresponding partial sum small, while the geometric tail is arbitrarily small. A metric Cauchy sequence is Cauchy in each real coordinate, so let be its unique coordinate limit. These unique limits define . For any , bound the geometric tail by and use convergence in the finitely many initial coordinates for the remaining . This proves convergence to in , so is complete. It is nonempty, containing the zero sequence. By [F2], no nonempty open subset of is meager: replace the nowhere dense sets by their closed closures and intersect their open dense complements with that open subset.
We will use the fact that a countable union of meager sets is meager under DC, and spell out its selection cost. If is meager, let be the nonempty set of sequences of nowhere dense subsets covering . The set of finite tuples with contains the empty tuple, and extension by one more coordinate is an entire relation: for that one index a witness exists. DC starting at the empty tuple produces a chain of such extensions. Its union gives one for every . A fixed enumeration of now gives a single sequence of nowhere dense sets covering . This is the only countable family of meagerness witnesses selected below.
Let be any algebraic linear functional. The sets for integers cover . By steps 3.1 and 4.1, some is nonmeager. By the Baire-property hypothesis there are an open set and a meager set with . The set is nonempty, since otherwise is meager. Take and a symmetric open neighborhood of zero with ; such a is obtained by shrinking the finitely many coordinate intervals of a basic neighborhood at . For , the nonempty open set lies in both and . Translations preserve nowhere density and meagerness since they are homeomorphisms. Hence is meager and cannot cover . There is therefore . Then , giving . This proves that is bounded on . For each , choose an integer ; on the open neighborhood its absolute value is less than . Thus is continuous. No is chosen simultaneously for all ; the argument proves the bound separately for each .
Continuity supplies a basic product neighborhood of zero on which . Let be the finite set of coordinates restricted by . If vanishes on , then for every real , so for every , which forces . In particular, if is the sequence with its only nonzero coordinate equal to one at , then for all . But the well-defined finite-sum functional satisfies for every . The least integer outside supplies a contradiction to . Thus restriction is not surjective. The inclusion and quotient give an exact sequence in ZF, so this is the claimed failure of exactness after dualization.
In this witness is nonzero because is nonzero, and is nonzero because the constant-one sequence has infinite support. No quotient representatives are chosen to define the sequence. The zero functional always extends, but the explicitly given does not in this branch. The functional is well-defined on vectors with any finite support, including empty support, and no sign or order of summation is ambiguous because each sum is finite. The supplied-simplex construction in [F3] instead already has a containing basis, so its zero extension does not call on step 1.1 or on either additional axiom of this second branch.
Depends on
- The Axiom of Choice
- 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$
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
- Under Dependent Choice, a nonempty complete metric space is not a countable union of closed sets with empty interior
- Canonical extension by zero of a singular cochain on a simplex basis
Used by
Dependency tree · two levels
26 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
- DG-16 design; Hatcher/Park control (standard reference, not scraped)