Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21
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.

A path homotopy over a two-set open cover admits a finite subordinate grid

Statement

Let X=UV with U and V open, and let H:I×IX be a path homotopy. Suppose finite subdivisions of the bottom and top edges are prescribed. Then there are finite partitions

0=s0<s1<<sm=1,0=t0<t1<<tr=1

such that the horizontal partition contains every prescribed bottom and top cut, and every closed grid rectangle [si1,si]×[tk1,tk] is mapped by H wholly into U or wholly into V.

Facts & Assumptions

Proof

technique · constructive
1.1

By [F4], H1(U) and H1(V) form an open cover of the compact metric square I2. By [F1] and [F2], choose a Lebesgue number δ>0 for this cover in d.

F1F2F3F4
2.1

Take q1 with 1/q<δ, using [F5]. Start with the uniform cuts k/q in each coordinate, adjoin the finitely many prescribed bottom and top cuts to the horizontal list, and sort each resulting finite set after removing repetitions. Every gap in either partition is at most 1/q<δ, and both lists contain 0 and 1.

step 1.1F5construct
3.1

Each closed grid rectangle is nonempty and has d-diameter at most 1/q<δ, so [F2] places it inside H1(U) or H1(V). Its image therefore lies in the corresponding cover member, and the constructed horizontal partition refines both prescribed boundary subdivisions.

step 1.1step 2.1F2discharge-construct

Depends on

Used by

Dependency tree · two levels

64 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