Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-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.

Two admissible continuation chains along one path admit a common refinement

Statement

Let γ:[0,1]Ω be a path and let ξ0 be a holomorphic germ at γ(0). If

  • (f0,U0),,(fm1,Um1) over 0=t0<<tm=1, and
  • (g0,V0),,(gn1,Vn1) over 0=s0<<sn=1

are admissible continuation chains for ξ0 along γ, then there is a subdivision

0=u0<u1<<ur=1

such that for each k<r the subpath γ([uk,uk+1]) lies in some Ui and in some Vj. In particular the two chains admit a common refinement by restricting representatives to these smaller subintervals.

Facts & Assumptions

Given: A path γ:[0,1]Ω and two admissible continuation chains for the same initial germ along γ.

[L1]

An admissible continuation chain is given by a finite subdivision of [0,1] and function elements covering the corresponding subpath images (Analytic continuation along a path by admissible chains).

Proof

technique · direct
1.1

By [L1], each set γ1(Ui) is open in [0,1], and the containment γ([ti,ti+1])Ui gives [ti,ti+1]γ1(Ui). Hence the finite family U:={γ1(Ui):0i<m} is an open cover of [0,1]. Likewise V:={γ1(Vj):0j<n} is an open cover of [0,1].

L1given
1.2

Apply [L2] to the compact interval [0,1] and the two open covers U and V. Let δU,δV>0 be corresponding Lebesgue numbers, put δ:=min{δU,δV}, and choose a subdivision 0=u0<u1<<ur=1 whose mesh is less than δ. Then every interval [uk,uk+1] has diameter less than both δU and δV.

L2choose
2.1

For each k<r, the interval [uk,uk+1] has diameter less than δU and less than δV, so the Lebesgue-number property gives indices i,j with [uk,uk+1]γ1(Ui) and [uk,uk+1]γ1(Vj). Equivalently, γ([uk,uk+1])UiVj. Restricting fi and gj to these smaller intervals produces the required common refinement.

step 1.1step 1.2algebra

Depends on

Used by

Dependency tree · two levels

19 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