Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedverified 2026-11-05 (gpt-6.1-sol)
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.

Deligne cup-product input data

Definition

Assume full AC and let M have the good cover and comparison input required for the Deligne exact-sequence lemma. For each r≥1, use the cone-model projections Ir:H^Delr(M;Z)⟶Hr(M;Z),Rr:H^Delr(M;Z)⟶Ωclr(M), where Ir is projection to integer-sheaf hypercohomology followed by the given integral comparison, and Rr is projection to the truncated de Rham component, identified with global closed forms. Define ar:Ωr−1(M)⟶H^Delr(M;Z),ar(η)=[(0,dη,−η)] in Cone⁡(Z⊕σ≥rΩ∙→Ω∙)[−1]. Its degree-r coordinates are respectively the integer component, the truncated-form component and the degree-(r−1) full-form component. The cone differential on these global coordinates is (z,α,b)↦(dz,dα,−db+z−α); hence this is a cocycle, Irar=0, and Rrar=d.

A Deligne cup-product input is a family of bilinear maps ⌣Del:H^Delp(M;Z)×H^Delq(M;Z)→H^Delp+q(M;Z) for all p,q≥1 satisfying the following conditions: it is natural under smooth pullback, associative and graded-commutative; Ip+q(x⌣Dely)=Ip(x)⌣Iq(y) for the integral singular cup product and Rp+q(x⌣Dely)=Rp(x)∧Rq(y); and ap(η)⌣Delx=ap+q(η∧Rq(x)) for η∈Ωp−1(M) and x∈H^Delq(M;Z). This definition names conditional data and does not assert that such a family exists.

Remarks

Bunke states existence and uniqueness of this structure and gives a truncated-complex product formula. In v6, Problems 3.96–3.97 are followed by chain-map, associativity and homotopy-commutativity verifications; compatibility with a and the factorization used for uniqueness are posed in Problems 3.98–3.99. This item defines conditional product data and does not reconstruct that existence-and-uniqueness argument locally.

Depends on

Dependency tree · 2 levels

Sources