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.
Local application interface for a critical-rank cancellation theorem
Statement
Assume AC and the suitable universes used for the article's perfect K-theory construction. Let be noetherian affine and . Suppose every constant-rank- finite projective -module is cancellative in the free-stabilization sense. Then two rank- bundles on are isomorphic exactly when in the article's spectral .
Facts & Assumptions
Given: The data and hypotheses in the statement.
Goal: Establish the stated conclusion.
Rank and isomorphism classes pass through the affine equivalence. Affine bundle classes are actual projective-module classes
Under AC and the stated universes, spectral K-zero equality for vector bundles on a noetherian affine scheme is equivalent to a common finite free module stabilization. Spectral K-zero equality gives an actual projective stabilization
The meaning of cancellative is fixed by Common projective complements and cancellation by free modules.
Proof
If the K-zero classes agree, let be the modules of sections. They have constant rank , and [F2] gives . By the assumed cancellativity, . By [F1], .
If , the spectral object-class map assigns the same element to both; equivalently [F2] applies with . Hence the converse holds too.
Depends on
Dependency tree · 3 levels
Arrows run from prerequisites to the items that use them. External source nodes link directly to the cited text. The view shows up to three dependency steps; open a prerequisite to continue.