Alphabeta Math
DefinitionDefinition: AI-adaptedProof: 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.

Homologically simply connected complex domains

Definition

A complex domain Ω (A complex domain is a nonempty connected open subset of C) is homologically simply connected when every complex chain which is a cycle and whose trace lies in Ω (Complex chains, their traces, and cycles) is null-homologous in Ω (Null-homologous cycles and homologous cycles in an open set); equivalently, when

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

with the index of Integration over a complex chain and the index of a chain.

Remarks

The qualifier is part of the name and is kept in every use. The condition above is about indices, and it is the only notion of simple connectivity defined or used on this page: no notion involving loops, homotopies or a fundamental group is introduced here, and none is invoked in any proof below. Writing "homologically simply connected" everywhere is what keeps that scope visible to a reader who knows the other notions from elsewhere.

C itself is homologically simply connected, because CC is empty and the condition is then vacuous. More generally the condition constrains a domain only through the points it omits.

Connectedness is part of the definition, since a complex domain is nonempty, open and connected. That is a convenience rather than a necessity for the index condition itself, and every result below that assumes homological simple connectivity therefore has a connected domain available.

Depends on

Used by

Dependency tree · two levels

23 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