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.

Poincaré–Lefschetz duality for a disk

Statement

Assume AC. Give the closed unit disk Dn its standard orientation, for n0, and put A=Dn=Sn1, with S1= when n=0. Then z=[Dn,A] generates Hn(Dn,A;Z), and z=[A] for the outward-normal-first orientation. The two cap isomorphisms are H0(Dn;Z)=Z  aaz  Hn(Dn,A;Z)=Z, Hn(Dn,A;Z)=Z  uuz  H0(Dn;Z)=Z. The first sends 1 to z. The second sends the class evaluating as 1 on z to the origin's point class. For n=1, [A]=[+1][1] in H0(S0;Z)=Z2, not a generator of that whole group. AC is inherited only from the duality theorem.

Facts & Assumptions

[F1]

Relative fundamental class and boundary orientation gives the unique relative class and its connector as the induced outward-normal-first boundary class.

[F2]

Poincaré–Lefschetz duality gives both cap isomorphisms for a compact oriented manifold with boundary, including empty boundary, under AC.

[F3]

Long exact sequence of a pair gives the exact pair sequence.

[F4]

Homology of spheres computes all sphere homology groups, including the two summands of H0(S0) and its augmentation kernel.

[F5]

The Axiom of Choice is assumed for [F2]'s local UCT and exhaustion selections.

[F6]

Contractible nonempty spaces have the homology of a point applies to the disk's straight contraction.

[F7]

Singular cohomology with coefficients gives H0=kerδ0 with no coboundaries, and Singular cochain complex with coefficients gives the endpoint-difference formula for δ0.

[F8]

Relative cap products with quotient domains displayed gives the relative cohomology-first cap maps, with front evaluation and retained back face.

Proof

Given: The disk, the coefficient ring Z and its standard coordinate orientation. The zero-disk is the positively oriented point.

1.1

For n1 the disk is compact by [F9], Hausdorff and second countable with its Euclidean subspace topology. Interior points have Euclidean charts. At a boundary point, rotate that point to the last positive coordinate axis and write nearby points as (u,1u2t) with u small and 0t small. The inverse is (y,yn)(y,1y2yn); after restricting to a small open neighborhood the disk condition is exactly t0, since the opposite graph is bounded away. Thus these are half-space charts and its boundary is Sn1. The supplied standard orientation on the interior gives the orientation required by [F1] and [F2]. The map (x,s)(1s)x contracts Dn to 0. By [F6], Hk(Dn;Z) is Z in degree zero and zero in positive degrees: at a point the unique simplex in degree k>0 has boundary coefficient j=0k(1)j, alternately 1 and 0, giving this calculation. In particular augmentation identifies the class of any disk point with 1. The case n=0 has these same groups directly.

F1F2F6F9given
2.1

Straight segments join any two disk points. By [F7], a zero-cocycle has equal values at their endpoints and hence is constant; conversely constants are cocycles. Since there are no degree-zero coboundaries, H0(Dn;Z)=Z with generator the constant 1. Apply the first isomorphism of [F2] at p=0. The formula [F8] evaluates this constant on the initial vertex of each simplex and retains the entire simplex, so 1z=z. Consequently Hn(Dn,A;Z) is generated by z. This also proves its positive normalization by the supplied interior orientation of [F1].

F1F2F5F7F8step 1.1
3.1

For n2, the pair sequence [F3] and the disk calculation in step 1.1 identify the connector Hn(Dn,A)H~n1(A) as an isomorphism; both groups are Z by [F4] and step 2.1. For n=1, the exact sequence instead identifies H1(D1,S0) with the kernel of H0(S0)H0(D1). This map sends (a,b) to a+b, so its kernel is generated by [+1][1]. The oriented interval simplex s2s1 has exactly that boundary and represents the positive interior local generator. By [F1] it represents z. In every dimension [F1] identifies the connector with the outward-normal-first boundary orientation, so z=[A] with the stated signs. At n=0 its target is a negative homology group and the empty boundary class is zero.

F1F3F4step 1.1step 2.1
3.2

Apply the second isomorphism of [F2] with p=n, using H0(Dn)=Z from step 1.1. Thus Hn(Dn,A;Z) is infinite cyclic. Its generator with cap image the origin is characterized by evaluation 1 on z, not by an unspecified sign choice. Indeed, for a relative cocycle φ and a relative cycle c=jajσj representing z, [F8] gives the zero-chain φc=jajφ(σj)[σj(vn)]. Its augmentation is jajφ(σj)=φ(c). Therefore the cap isomorphism followed by augmentation is precisely evaluation on z, proving existence and uniqueness of the normalized class and its asserted image.

F2F5F8step 1.1step 2.1
4.1

When n=0 both cap maps are the identity of Z for the positive point orientation, so the formulas agree. The boundary is empty only in that case; no undefined sphere homology in degree 1 is invoked. The disconnected two-point boundary at n=1 was treated by the augmentation kernel in step 3.1. Zero cohomology classes map to zero by the displayed linear formulas, and degenerate singular simplices are included in the augmentation computation in step 3.2. The straight contraction has the required time endpoints, and the relative boundary signs are those of [F1], with the explicit interval calculation fixing the low-dimensional convention. AC in steps 2.1 and 3.2 is only [F2]'s local free-module/UCT selections and countable coordinate exhaustion; all disk charts, chains, signs and the normalized generator calculation require no further selection.

F1F2F5F8step 1.1step 2.1step 3.1step 3.2

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

63 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