Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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.

Cap product on the oriented circle

Example

Let σ:Δ1S1 be σ(t0,t1)=(cos(2πt1),sin(2πt1)), and put z=σ. If αH1(S1;Z) evaluates to 1 on z, then α[z] is the positive generator of H0(S1;Z), with cohomology written first.

Facts & Assumptions

[F1]

Cap product with cohomology written first evaluates a degree-one cochain on a one-simplex and retains its last vertex.

[F2]

Cap product boundary identity makes this operation well-defined on a cocycle and a cycle modulo boundaries.

[F3]

Zero-th singular homology is free on path components identifies the class of a point with the basis vector of its path component. Homology of spheres also gives H0(S1;Z)Z.

Verification

Given: The specified loop z and a class α satisfying the stated normalization. Let a be any cocycle representing α.

1.1

The two endpoints of σ equal x=(1,0), so z=xx=0. The normalization says a(z)=1. This does not depend on the representative: replacing a by a+δu changes the evaluation by u(z)=0.

givenalgebra
2.1

The front face for degree one is all of σ, and its back face is its last vertex x. Hence az=a(σ)x=x. By [F2] this identity passes to α[z]=[x].

F1F2step 1.1
3.1

Every point of S1 can be joined to x by an arc t(cos(tθ),sin(tθ)), using any angle θ for that particular point. Thus there is one path component, and [F3] sends [x] to 1, not 1. This is the asserted positive generator. The coincident endpoints cause no cancellation of the retained vertex: only the boundary subtracts them. The input and coefficient ring are fixed and nonzero; neither an empty space nor a constant loop can satisfy this evaluation normalization. No simultaneous choice of angles or representatives is required, and no AC is used.

F3step 2.1given

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

14 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