Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Equality in K⁰ is stable isomorphism over compact bases

Statement

Assume AC. For a compact Hausdorff space X,

[E]−[F]=[E′]−[F′] in K0(X)

if and only if there is a finite-rank bundle H such that

E⊕F′⊕H≅E′⊕F⊕H.

Equivalently, there is an N≥0 such that

E⊕F′⊕εN≅E′⊕F⊕εN.

In particular, [E]=[F] if and only if E⊕εN≅F⊕εN for some N.

Facts & Assumptions

Given: AC, a compact Hausdorff space X, and finite-rank complex bundles E,F,E′,F′ over X.

[F1]

Equality in the Grothendieck group is the common-summand relation (Complex topological K⁰ by Grothendieck completion).

[F2]

Under AC, every finite-rank bundle over a compact Hausdorff base has a finite-rank complement in a trivial bundle (Finite-rank complement theorem over compact Hausdorff bases).

[A1]

AC is used only through [F2] to obtain the complement.

Proof

technique · direct
1.1F1

By [F1], the first displayed equality holds exactly when some bundle H satisfies the first stable-isomorphism display. This proves both directions of the first equivalence, including H=0X when no added summand is needed.

2.1F2A1step 1.1algebra

Apply [F2] to H. There are a bundle H′ and N≥0 with H⊕H′≅εN. Adding H′ to both sides of the isomorphism in step 1.1 gives the trivial-stabilization display. Conversely, that display is the relation in step 1.1 with H=εN.

3.1step 2.1∎

Set F=F′=0X in the proved equivalence. Then [E]=[F] exactly when E⊕εN≅F⊕εN for some N, including N=0.

Depends on

Dependency tree · 2 levels

Sources