Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)audited 2026-08-26
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.

Complex chains, their traces, and cycles

Definition

Let ΩC be open. A complex chain in Ω is a finite list

Γ=((m0,γ0),,(mr1,γr1)),rN,

each mk an integer (The integers as equivalence classes of pairs of naturals) and each γk:[ak,bk]C a complex contour (Rectifiable complex contours, reversal, concatenation, closedness, and orientation) whose trace lies in Ω. It is written k<rmkγk. The list of length r=0 is the empty chain.

Its trace is the set

Γ:={γk : k<r and mk0},

a subset of Ω; a term with mk=0 contributes nothing to it.

Its boundary is the function Γ:CZ given by

Γ(q):=k<rγk(bk)=qmk  k<rγk(ak)=qmk,

each sum being a finite sum over a subset of {k:k<r} (A finite sum in a commutative monoid indexed by an arbitrary finite set, The cardinality A of a finite set), and the subtraction is that of the commutative ring Z (The integers form a commutative ring). The chain Γ is a cycle when Γ(q)=0 for every qC.

Sum and negation. For chains Γ1 and Γ2 in Ω, the sum Γ1+Γ2 is the concatenated list, and Γ is the list with every coefficient replaced by mk and every contour unchanged. Write Γ1Γ2:=Γ1+(Γ2). The reversal Γ is the list with every coefficient unchanged and every contour replaced by its reversal; the additive inverse mk is taken in Z (The integers form a commutative ring).

Remarks

A chain is a list, and equality of chains is equality of lists. No free abelian group on the set of contours is introduced here, and no result on this page asserts that two differently presented chains are equal: every statement below is about a given list, and the operations above produce lists. This is a deliberate departure from the presentations that define a chain as a group element, and it is what removes the obligation to say when two chains coincide.

Which lists are cycles. The empty chain is a cycle, both boundary sums being empty and hence 0 (A finite sum in a commutative monoid indexed by an arbitrary finite set). A list all of whose contours are closed is a cycle: for such a γk the two endpoint values coincide, so mk enters the sum at q=γk(ak) once positively and once negatively and cancels there, and enters neither sum at any other point. In particular a single closed contour, taken as the list of length 1 with m0=1, is a cycle. Terms with mk=0 add 0 to both sums and so never affect Γ.

Cycles are more general than lists of closed contours. The condition is that the endpoints cancel after the coefficients are counted, not that each piece closes up: two contours with the same initial point and the same terminal point, carried with coefficients +1 and 1, form a cycle although neither is closed. The distinction is what the integral results below actually use: the vanishing of the boundary function is exactly the hypothesis under which the integral of a continuous derivative over Γ is zero.

Ambient set. A chain is a chain in Ω; the same list is a chain in every open set containing all the γk, and in particular in C. When a nonempty connected Ω is wanted it is called a complex domain (A complex domain is a nonempty connected open subset of C). Finite sums of integers and of complex numbers are finite sums in their additive commutative monoids, as in A finite sum in a commutative monoid indexed by an arbitrary finite set.

Depends on

Used by

Dependency tree · two levels

47 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