Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-07-31
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.

The incidence functions I(P,R) of a locally finite poset and their convolution

Definition

Let (P,≤) be a locally finite poset (Intervals in a poset; locally finite, lower-finite and upper-finite posets) and let R be a commutative ring (Commutative ring, Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides). Put

Int⁡(P):={(x,y)∈P×P:x≤y}.

An incidence function with coefficients in R is a function f:Int⁡(P)→R. The set of all incidence functions is denoted

I(P,R):=RInt⁡(P).

Addition, zero and additive inverses are pointwise, as in the function ring of The ring RX of all functions from a set X into a ring, with pointwise operations. For f,g∈I(P,R) their convolution is the incidence function

(f∗g)(x,y):=∑z∈[x,y]f(x,z)g(z,y)(x≤y),

where the sum is the finite commutative-monoid sum of A finite sum in a commutative monoid indexed by an arbitrary finite set in the additive monoid of R.

xzwyonesummand,forachosenz2[x;y]:f(x;z)g(z;y)f(x;z)g(z;y)

This operation is well defined precisely at the stated level of generality: local finiteness makes [x,y] finite for each comparable pair, so the displayed ring-valued sum has finitely many terms. The definition makes no claim about sums over an entire principal ideal or principal filter.

Depends on

Used by

Dependency tree · two levels

22 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