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

Connector compatibility for a two-arc cover of the circle

Example

Assume ACω. Let U=S1{[0]} and V=S1{[1/2]}, ordered as written, and write UV=W0W1 with W0=p((0,1/2)) and W1=p((1/2,1)). The overlap zero-cocycle c equal to 1 on W0 and 0 on W1 maps under both Mayer–Vietoris connector routes to the same positive generator, evaluated as 1 on the increasing circle cycle.

Facts & Assumptions

Given: The ordered cover and overlap cocycle in the example.

[F1]

The de Rham map commutes with Mayer–Vietoris connectors uses the second-minus-first difference, the form lift (ρVc,ρUc), and the singular lift (EUc,0), and proves that integration identifies their positive lift-differential connectors.

[F2]

The Axiom of Countable Choice (ACω) is assumed exactly to obtain a smooth partition ρU+ρV=1 subordinate to this cover. With such a partition supplied, the calculation below is choice-free.

Verification

1.1

Choose aW0 and bW1. Let u be the increasing arc in U from a to b, and v the increasing arc in V from b through the quotient seam to a; z=u+v is the positively oriented circle cycle. For the de Rham lift set α=ρVc on U and β=ρUc on V. Their difference on the overlap is βα=(ρU+ρV)c=c, and their derivatives glue to the connecting one-form ζ.

F1F2given
2.1

Since ζ=dα on U and ζ=dβ on V, endpoint evaluation gives zζ=α(b)α(a)+β(a)β(b). At bW1, c(b)=0, hence α(b)=β(b)=0; at aW0, β(a)α(a)=c(a)=1. Therefore zζ=1.

step 1.1algebra
3.1

On the singular side use the lift e0=(EUc,0) from [F1]. Its differential glues to the connector cocycle z0. On u:ab, z0(u)=δ(EUc)(u)=(c(b))(c(a))=1, while z0(v)=0 on the V lift. Thus z0(z)=1, exactly the value in step 2.1, and [F1] identifies the two connector classes.

F1step 1.1step 2.1
4.1

Replacing c by c or reversing z reverses both answers. The zero cocycle gives zero on both sides; if an overlap component were absent, this particular nonzero witness would not exist. Both endpoints of each arc occur in the displayed coboundary differences, and degenerate simplices contribute zero. Apart from [F2]'s partition existence, every lift, path, sign and evaluation is finite and explicit.

F1F2step 1.1step 2.1step 3.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

15 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