Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17
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.

Goursat bisection selects nested triangles retaining one quarter of the boundary-integral magnitude, with halving diameters and a one-point intersection

Statement

Let U⊆C be open, let f:U→C be continuous, and let T0=Δ[a,b,c]⊆U. There is a sequence (Tn)n∈N of filled triangles such that Tn+1 is one of the four midpoint subtriangles of Tn and, for every n∈N,

Tn+1⊆Tn,∣If(Tn)∣≥4−n∣If(T0)∣,

P(Tn)=2−nP(T0),diam⁡(Tn)=2−ndiam⁡(T0).

Every Tn is nonempty, compact, closed, and bounded, and there is a unique z∗∈C with

⋂n∈NTn={z∗}.

Here If(T) denotes the integral over the oriented boundary prescribed by Filled complex triangles, their oriented three-edge boundary contours, diameter, and perimeter.

Facts & Assumptions

Given: An open set U, a continuous f:U→C, and a filled triangle T0⊆U.

[L1]

The four midpoint subtriangle boundary integrals sum to the parent boundary integral (Midpoint subdivision of a triangle cancels every interior edge and preserves its outer boundary integral).

[L5]

Recursion constructs a sequence from an initial value and a self-map; every nonempty set of natural numbers has a least element; induction proves a statement for all natural indices (The recursion theorem, The well-ordering principle, The principle of mathematical induction).

[L7]

The complex modulus satisfies the triangle inequality ∣z+w∣≤∣z∣+∣w∣ (Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive).

Proof

technique · direct
1.1L1L5L7

For any parent triangle, [L1] and [L7] imply that at least one of its four indexed midpoint children has integral modulus at least one quarter of the parent's: otherwise the modulus of their sum would be strictly smaller than the parent modulus. Choose the least qualifying index, which also works when the parent integral is zero.

1.2L4algebra

If Tn=Δ[u,v,w], the continuous map Φ(s,t)=u+s((1−t)(v−u)+t(w−u)) takes the compact square [0,1]2 onto Tn: its coefficients are nonnegative and sum to one, and conversely a barycentric point with coefficients (α,β,γ) is obtained by s=β+γ and, when s>0, t=γ/s, while s=0 gives u. Thus [L4] makes Tn compact, closed, and bounded; it is nonempty because it contains u.

2.1step 1.1L5algebra

The least-index rule is a function of the ordered parent triangle, so recursion gives (Tn); direct midpoint geometry shows every child is contained in its parent and is the image of it under a similarity of ratio 1/2, hence its perimeter and diameter are half those of the parent.

3.1step 1.1step 2.1L5

Induction applied to step 2.1 and the retained one-quarter estimate gives, including at n=0, ∣If(Tn)∣≥4−n∣If(T0)∣, P(Tn)=2−nP(T0), and diam⁡(Tn)=2−ndiam⁡(T0).

4.1step 2.1step 3.1step 1.2L2L3L6∎

By [L6] and step 3.1, the diameters tend to zero, even when the initial diameter is zero. Write vn for the first listed vertex of the ordered triangle Tn; this is determined by the recursive construction and makes no choice. If m,n≥N, then vm,vn∈TN by nestedness, so ∣vm−vn∣≤diam⁡(TN). Thus (vn) is Cauchy and [L3] gives a limit z∗∈C. For fixed N, the tail (vn)n≥N lies in the closed set TN. If z∗∉TN, its open complement would contain a ball about z∗, contradicting convergence of that tail; hence z∗∈TN. Therefore z∗ lies in every TN. If w is another common point, then w,z∗∈TN gives ∣w−z∗∣≤diam⁡(TN) for every N; since these diameters tend to zero, ∣w−z∗∣=0 and w=z∗. Hence the intersection is exactly {z∗}.

Depends on

Used by

Dependency tree · two levels

87 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