Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (deepseek-v4-pro + gpt-5.6-terra)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.

Null-homologous cycles and homologous cycles in an open set

Definition

Let ΩC be open and let Γ be a complex chain which is a cycle and whose trace lies in Ω (Complex chains, their traces, and cycles).

Γ is null-homologous in Ω when

n(Γ,p)=0for every pCΩ,

the index being that of Integration over a complex chain and the index of a chain; the values are defined because ΓΩ, so every pΩ lies off the trace, and they are integers by The index of a cycle about a point off its trace is an integer.

Two cycles Γ1,Γ2 with traces in Ω are homologous in Ω when Γ1Γ2 is null-homologous in Ω. By Chain integration and the index are additive in the chain, and reverse with it the chain Γ1Γ2 is again a cycle with trace inside Γ1Γ2Ω, and its index at a point p off that union is n(Γ1,p)n(Γ2,p); so the condition says exactly that

n(Γ1,p)=n(Γ2,p)for every pCΩ.

Remarks

Both notions depend on Ω, not on the cycle alone. The same cycle can be null-homologous in one open set and not in another: enlarging Ω removes points from CΩ and so weakens the requirement. Every statement below that uses these words names the open set it uses them in, and Ω is not omitted anywhere.

Null-homologous does not mean equal to the empty chain. It is a condition on the numbers n(Γ,p) for p outside Ω, and a cycle with a large trace can satisfy it. In particular, being homologous is a relation between two cycles and never an assertion that the two lists coincide; chains here are lists and equality of chains is equality of lists.

Taking Ω=C makes the condition vacuous, since CC is empty, so every cycle is null-homologous in the plane. The content of the notion appears when Ω omits points, and it is those omitted points that the index has to ignore. When a nonempty connected Ω is wanted it is called a complex domain (A complex domain is a nonempty connected open subset of C).

Depends on

Used by

Dependency tree · two levels

32 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