Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04
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.

The realization of a simplicial map is continuous and functorial

Statement

If f:K→L is a simplicial map, then ∣f∣:∣K∣→∣L∣ is continuous. In addition, ∣id⁡K∣=id⁡∣K∣ and ∣g∘f∣=∣g∣∘∣f∣ for composable simplicial maps.

Proof

Given: A simplicial map f:K→L and, for functoriality, a second simplicial map g:L→M.

1.1given

If σ={v0,…,vn} is a simplex of K and x∈∣σ∣ has barycentric coordinates x=∑i=0nλivi, then ∣f∣(x)=∑i=0nλif(vi). Thus the restriction ∣f∣∣∣σ∣:∣σ∣→∣f(σ)∣ is the affine map determined by the vertex map f, so it is continuous.

1.2given

For every barycentric function α, the identity vertex map leaves every coefficient unchanged, so ∣id⁡K∣(α)=α. Likewise ∣g∘f∣(α)(u)=∑w∈g−1(u)∑v∈f−1(w)α(v)=∣g∣(∣f∣(α))(u), so realizations preserve composition.

2.1step 1.1

If σ and τ meet, then they meet along ∣σ∩τ∣, and the affine formulas from step 1.1 agree there because they are both determined by the same vertex map f. Since ∣K∣ carries the weak topology with respect to its simplices, these simplexwise affine maps patch to a continuous map ∣f∣:∣K∣→∣L∣.

3.1step 2.1step 1.2∎

Steps 2.1 and 1.2 give continuity and the identity/composition laws.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

5 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