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.
Countable sequence groups and tail filtrations
Statement
Let , , and let consist of the sequences with finite support, with . Coordinate addition makes the product and the coproduct of countably many copies of in abelian groups. The inclusion is injective but not surjective; is countably infinite and is uncountable.
For or , put , . Then and , compatibly with truncation. Define its tail completion to be with these truncation maps. Both completions identify with . Under these identifications is the displayed proper inclusion, while is the identity. Thus is complete and both filtrations are separated. These assertions require no AC.
Facts & Assumptions
Abelian-group model for spectral-sequence computations supplies abelian groups as an abelian category, coset quotients, and with residues and .
Products and coproducts as limits and colimits of discrete diagrams, including their existence-and-uniqueness equations characterizes products by coordinate maps and coproducts by maps from their summands.
Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties characterizes a limit by unique factorization of compatible cones.
Division with remainder in : for and there are unique with and gives unique division by with remainder or .
Proof
Given: as in the statement. Residues are identified with those digits when used in integer expressions.
The abelian group identities for coordinate addition on hold at each index by the identities in . The zero sequence has empty support; negatives preserve support and the support of a sum is contained in the union of the two supports, so is a subgroup. For maps , the unique map is . For maps , define by . This sum is finite; extending the summation set by zero terms proves additivity, and the identity proves uniqueness. These are precisely the product and coproduct properties.
The inclusion is injective. The constant-one sequence belongs to but has infinite support, so does not belong to . Each unit sequence belongs to , and different indices give different unit sequences.
Encode by . If , their finite union of supports has a largest differing index . The magnitude of the contribution there is , while the sum of the magnitudes at lower indices is at most ; the latter identity follows by starting with and adding at the next index. Hence . Conversely, successive unique divisions of any nonnegative integer by give its binary digits; the nonzero quotients strictly decrease, so after finitely many divisions the quotient is zero. Substituting the equations back gives . Thus is a bijection .
The first--coordinates map is onto by extension by zero, for either or , and has kernel . It therefore induces a bijective homomorphism : equality of images means the difference lies in , and every tuple is represented by its zero extension. For the quotient and empty tuple group are zero. If , take to conclude at each index, so .
For any map , the sequence lies in and differs from at coordinate . Thus is not onto. If an injection existed, inversion on its image and the zero sequence as value off that image would define a surjection , which has just been excluded. Hence is uncountable and cannot be bijective with .
Let be the subgroup of consisting of tuples for which truncating gives . For any compatible cone of homomorphisms into , the map sending an element to its tuple of cone images is the unique homomorphism into inducing that cone. Thus is the inverse limit. The homomorphism sends a sequence to its initial segments. Its inverse sends a compatible tuple to ; compatibility proves that all its first- coordinates equal . These formulas are mutually inverse and select no representatives.
The quotient identifications in step 2.2 commute with truncation, so they identify both and with . The completion map sends to its initial segments, hence becomes the original inclusion for and the identity for . Step 2.2 proves separatedness for both, and step 1.2 proves the first inclusion is proper. All constructions use explicit coordinates, finite sums, or uniquely specified digits; AC has not been used.
Depends on
- Products and coproducts as limits and colimits of discrete diagrams, including their existence-and-uniqueness equations
- Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties
- Division with remainder in $\mathbb{Z}$: for $a \in \mathbb{Z}$ and $b > 0$ there are unique $q, r \in \mathbb{Z}$ with $a = qb + r$ and $0 \le r < b$
Used by
- An exhaustive nonseparated filtration with the wrong naive abutment Counterexample
- Sum and product totalisations can differ on infinite diagonals Counterexample
- Sum and product totalisations on an infinite diagonal Counterexample
- An isomorphism on e infinity automatically gives an isomorphism of unfiltered targets False statement
- Direct sum and product totalisations are always isomorphic False statement
- Exhaustive filtration implies separated and complete filtration False statement
- Failure of separatedness or completeness can destroy the claimed abutment Proposition
Dependency tree · two levels
18 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
- Weibel, Chapter 5, completion examples; explicit binary model supplied locally (standard reference, not scraped)