Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

Canonical zero extension of an overlap cochain

Example

Take U=(2,1) and V=(1,2) in X=(2,2), with overlap vertex p=0 and U-only vertex q=3/2. The overlap zero-cochain η with value two at p and zero at every other vertex has canonical extension EUη satisfying (EUη)(3[p][q])=6.

Facts & Assumptions

Given: The intervals, vertices and basis values above, extended linearly on finite overlap chains.

[F1]

Canonical zero extension retains overlap basis values and vanishes on every other simplex in U (Canonical extension by zero of a singular cochain on a simplex basis).

Proof

1.1

We have UV=(1,1), so p lies in the overlap and q lies in UV. By [F1], (EUη)([p])=2 and (EUη)([q])=0. Linearity therefore gives (EUη)(3[p][q])=320=6.

givenF1algebra
2.1

Restriction back to the overlap equals η on every vertex: it has value two at p and zero elsewhere, hence agrees on every finite chain. More generally, for any specified overlap cochain and finite chain as[s] in U, the value is exactly s in the overlapasη(s). An empty retained index set gives zero and one retained term gives its coefficient times its value. This is a degreewise extension, not an assertion that extension commutes with coboundary. No basis or representatives are chosen.

F1step 1.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

2 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