Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
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 k=Z/2, P=kN, and let SP consist of the sequences with finite support, with N={0,1,}. Coordinate addition makes P the product and S the coproduct of countably many copies of k in abelian groups. The inclusion SP is injective but not surjective; S is countably infinite and P is uncountable.

For A=S or P, put TmA={xA:xj=0 for j<m}, m0. Then mTmA=0 and A/TmAkm, compatibly with truncation. Define its tail completion to be A^=limmA/TmA with these truncation maps. Both completions identify with P. Under these identifications SS^ is the displayed proper inclusion, while PP^ is the identity. Thus P is complete and both filtrations are separated. These assertions require no AC.

Facts & Assumptions

[F1]

Abelian-group model for spectral-sequence computations supplies abelian groups as an abelian category, coset quotients, and k=Z/2 with residues 0,1 and 1+1=0.

[F2]

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.

Proof

Given: k,P,S,TmA as in the statement. Residues 0,1 are identified with those digits when used in integer expressions.

1.1

The abelian group identities for coordinate addition on P hold at each index by the identities in k. 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 S is a subgroup. For maps fj:Gk, the unique map GP is g(fj(g))j. For maps gj:kG, define SG by xjsupp(x)gj(xj). This sum is finite; extending the summation set by zero terms proves additivity, and the identity x=jιj(xj) proves uniqueness. These are precisely the product and coproduct properties.

F1F2given
1.2

The inclusion is injective. The constant-one sequence belongs to P but has infinite support, so does not belong to S. Each unit sequence belongs to S, and different indices give different unit sequences.

F1given
2.1

Encode xS by b(x)=j2jxjN. If xy, their finite union of supports has a largest differing index r. The magnitude of the contribution there is 2r, while the sum of the magnitudes at lower indices is at most j<r2j=2r1; the latter identity follows by starting with 0=11 and adding 2r at the next index. Hence b(x)b(y). Conversely, successive unique divisions of any nonnegative integer by 2 give its binary digits; the nonzero quotients strictly decrease, so after finitely many divisions the quotient is zero. Substituting the equations aj=2aj+1+rj back gives a0=j2jrj. Thus b is a bijection SN.

F4step 1.2algebra
2.2

The first-m-coordinates map Akm is onto by extension by zero, for either A=S or P, and has kernel TmA. It therefore induces a bijective homomorphism A/TmAkm: equality of images means the difference lies in TmA, and every tuple is represented by its zero extension. For m=0 the quotient and empty tuple group are zero. If xmTmA, take m=j+1 to conclude xj=0 at each index, so x=0.

F1step 1.1given
3.1

For any map e:NP, the sequence yj=1e(j)j lies in P and differs from e(j) at coordinate j. Thus e is not onto. If an injection PN existed, inversion on its image and the zero sequence as value off that image would define a surjection NP, which has just been excluded. Hence P is uncountable and cannot be bijective with S.

F1step 2.1given
3.2

Let L be the subgroup of m0km consisting of tuples (z(m))m for which truncating z(m+1) gives z(m). For any compatible cone of homomorphisms into km, the map sending an element to its tuple of cone images is the unique homomorphism into L inducing that cone. Thus L is the inverse limit. The homomorphism PL sends a sequence to its initial segments. Its inverse sends a compatible tuple to xj=zj(j+1); compatibility proves that all its first-m coordinates equal z(m). These formulas are mutually inverse and select no representatives.

F1F3step 2.2
4.1

The quotient identifications in step 2.2 commute with truncation, so they identify both S^ and P^ with LP. The completion map sends x to its initial segments, hence becomes the original inclusion for S and the identity for P. 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.

step 1.2step 2.2step 3.2

Depends on

Used by

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