Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-sol)audited 2026-09-27
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.

Refinement map of ordered open covers

Definition

Let X be a topological space, let F be a sheaf of abelian groups on X (A sheaf on a topological space), and let U=(Ui)i∈I and V=(Vj)j∈J be open covers of X indexed by linearly ordered sets, with ordered Čech cochains C∙(U,F) and C∙(V,F) (Ordered Čech cochain complex of a cover) and with the alternating models C~∙ of both complexes (Ordered and alternating Čech complexes agree).

A refinement function from V to U is a map c:J→I of the index sets such that Vj⊆Uc(j)for every j∈J. When such a map exists one says that V refines U via c, or that V is a refinement of U. A refinement function need not be injective, surjective or order preserving; only the containments Vj⊆Uc(j) are required, so the members of V may be assigned to members of U in any order. A refinement function with V=U and c=id⁡I always exists, so every cover refines itself.

Given a refinement function c, its Čech cochain map is the cochain map c♯:C∙(U,F)⟶C∙(V,F) defined in the alternating model: for s∈Cp(U,F) and a tuple (j0,…,jp) of indices in J one puts (c♯s)j0⋯jp:=sc(j0)⋯c(jp)∣Vj0∩⋯∩Vjp, that is, one evaluates the alternating family of s at the tuple of U-indices c(j0),…,c(jp) and restricts along Vj0∩⋯∩Vjp⊆Uc(j0)∩⋯∩Uc(jp), an inclusion holding because Vj⊆Uc(j) for every j (Sections, restrictions, and global sections of a presheaf).

The displayed families are again alternating cochains, now over V: deleting or permuting entries of (j0,…,jp) deletes or permutes the entries of (c(j0),…,c(jp)), so a repeated index makes the value 0 by the first alternating condition, while a permutation σ of the positions multiplies the value by sgn⁡(σ) by the second condition (Ordered and alternating Čech complexes agree). Hence c♯ is a well-defined homomorphism of abelian groups Cp(U,F)→Cp(V,F) for every p, and it commutes with the Čech differentials, c♯∘δU=δV∘c♯, so that c♯ is a map of cochain complexes. Indeed, deleting the b-th entry from the tuple c(j0),…,c(jp) gives the tuple c(j0),…,c(jb)^,…,c(jp) obtained by applying c to the tuple with the b-th entry deleted, and the two sides of the identity are the corresponding alternating sums of the sections sc(j0)⋯c(jb)^⋯c(jp) restricted to Vj0∩⋯∩Vjp, which agree by the compatibility of restrictions (Sections, restrictions, and global sections of a presheaf).

Depends on

Used by

Dependency tree · two levels

10 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