Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

An isomorphism on e infinity automatically gives an isomorphism of unfiltered targets

Statement

False: An isomorphism on E∞ automatically makes a compatible unfiltered target map an isomorphism, without finite or complete separated filtration hypotheses.

Facts & Assumptions

[F1]

Countable sequence groups and tail filtrations constructs the inclusion S⊂P of finite-support into all binary sequences, with separated tails, common completion P and finite quotient identifications.

[F2]

R page of the spectral sequence of a filtered complex gives the graded initial page; The filtered differential induces d r on the r page gives its differentials from the chain differential. Failure of separatedness or completeness can destroy the claimed abutment establishes the possible failure of recovery from these pages.

[F3]

Spectral sequence comparison theorem requires compatible target maps and finite or exhaustive separated complete target filtrations for its lifting conclusion.

Refutation

Given: The inclusion f:S[0]→P[0] of complexes concentrated in degree zero, filtered by F−m=Tm for m≥0 and the whole group for positive indices.

1.1F1F2

The induced graded map at p=−m is the identity on k=Z/2 via the coordinate m identification Tm/Tm+1≅k. All positive graded pieces are zero. Since both chain differentials vanish, every page differential is zero and these identifications persist on every page, including E∞ at positions (−m,m). The homology targets are S and P themselves, with the same tails, and the induced target map is the inclusion. Its graded maps are precisely the page maps, so compatibility is satisfied.

2.1F1F3step 1.1∎

The constant-one sequence in P is not in S, so this compatible target map is not surjective. Both filtrations are exhaustive (F0 is full) and separated, but the source completion map is this same proper inclusion S→P, hence is not an isomorphism. Thus the finite or complete-target lifting premise of [F3] fails on the source, while the limiting-page isomorphism holds. The index m=0 and zero positive levels were included in step 1.1, and the counterexample is choice-free.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

20 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