Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 2026-09-06
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.

Barycenter and affine cone

Definition

Let G be an abelian group and n≥0. The barycenter of the ordered standard n-simplex is bn=(1/(n+1),…,1/(n+1)). An affine singular m-simplex in Δn is determined by its ordered vertices w0,…,wm∈Δn; write it as [w0,…,wm]. Define its affine cone by bn[w0,…,wm]=[bn,w0,…,wm], and extend by tensoring with id⁡G to finite affine chains. The apex is the first vertex. Repeated vertices are allowed and remain singular simplices; no quotient by degenerate simplices is being taken.

For a singular simplex σ:Δn→X and a supplied affine chain z~ in Δn, define the affine cone along σ by bσz~:=σ#(bnz~). Here σ# means composition of each affine simplex with σ, with its coefficient unchanged. The lift z~, not just its image chain in X, is part of the input. It may lie anywhere in the convex simplex, including its boundary. In the recursive notation bσS(∂σ), the supplied lift is the chain S(∂ιn) in ∂Δn, where ιn is the identity simplex.

With the ordinary boundary of The singular boundary operator, the orientation formulas are, for m≥1, ∂(bσz~)=σ#z~−bσ(∂z~), and for m=0, ∂(bσz~)=σ#z~−[σ(bn)]⊗ε(z~), where ε(∑j[wj]⊗gj)=∑jgj. The first formula follows by deleting the first cone vertex and then the successive base vertices with alternating signs; the second follows from ∂[bn,w]=[w]−[bn]. Thus in degree zero the formula without the extra term holds only when the total coefficient is zero. In particular it applies to the subdivided boundary of a 1-simplex, whose endpoint coefficients sum to zero. These formulas do not change the library's ordinary degree-zero boundary or its reduced-homology convention.

Depends on

Used by

Dependency tree · two levels

5 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