Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-09
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.

Relative derived subdivision makes the fixed subcomplex full

Statement

For finite AK, A is full in DArK for every r1: the vertices of any simplex that lie in A span a face of A, and its geometric intersection with A is exactly that face (possibly empty).

Source locators

2.5.10–2.5.12 pp.51–52.

Facts & Assumptions

[F1]

Relative derived simplices have a fixed-face plus outside-face-chain form. Relative derived subdivision of a finite simplicial pair.

Proof

Given: A finite pair AK and at least one relative derived subdivision.

1.1

A simplex of DAK consists of a face α of A and barycenters bσ1,,bσs of nested faces outside A, strictly containing α. The only vertices in A are those of α: a barycenter of σA has support σ, so cannot lie in the subcomplex A. Thus the vertices in A span precisely α.

F1
2.1

For a point in that simplex with a positive coefficient at some bσj, take the largest such face σj. All its vertex coordinates in the original simplex become positive, with no cancellation, so the original support contains σj. Such a point cannot belong to A, since that would put its support and every subface, including σj, in A. Conversely every point using only vertices of α lies in A. Therefore the intersection is exactly α. The same argument applies with K replaced by each DAr1K. If A is empty intersections are empty; if A=K, every simplex is already in A.

F1step 1.1

Depends on

Used by

Dependency tree · two levels

3 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