Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck 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 UC be open, let f:UC be continuous, and let T0=Δ[a,b,c]U. There is a sequence (Tn)nN of filled triangles such that Tn+1 is one of the four midpoint subtriangles of Tn and, for every nN,

Tn+1Tn,If(Tn)4nIf(T0),

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

Every Tn is nonempty, compact, closed, and bounded, and there is a unique zC with

nNTn={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:UC, and a filled triangle T0U.

[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).

[L2]

A nested sequence of nonempty closed bounded subsets of a complete metric space whose diameters tend to zero has intersection consisting of exactly one point (In a complete metric space nested nonempty closed sets whose diameters tend to 0 meet in exactly one point, and this property characterises completeness).

[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+wz+w (Conjugation is an involutive real-field automorphism, zz=z2, and modulus is definite, multiplicative, and subadditive).

Proof

technique · direct
1.1

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.

L1L5L7
1.2

If Tn=Δ[u,v,w], the continuous map Φ(s,t)=u+s((1t)(vu)+t(wu)) 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.

L4algebra
2.1

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.

step 1.1L5algebra
3.1

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

step 1.1step 2.1L5
4.1

By [L6] and step 3.1, the diameters tend to zero, even when the initial diameter is zero. Steps 2.1 and 1.2 give a nested sequence of nonempty closed bounded subsets of the complete complex plane, so [L2] and [L3] give a unique common point z.

step 2.1step 3.1step 1.2L2L3L6

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 172 results over 34 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources