Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
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 singular boundary of a simplex is the unsigned sum of its faces

Statement refuted

The real singular boundary is the unsigned sum of all faces.

Facts & Assumptions

Given: Work in R2 with distinct vertices a=(0,0),b=(1,0),c=(0,1).

[F1]

The real boundary has alternating signs (Real singular chain complex).

Proof

1.1

Let σ:Δ2R2 be the affine simplex with ordered vertices (a,b,c). Its ordered edge faces are [b,c],[a,c],[a,b]. The operator u defined by unsigned faces has u[a,b]=[b]+[a], so u2σ=2[a]+2[b]+2[c]0 in the free real vertex space. The coefficient at a is two.

givenF1algebra
2.1

In contrast, σ=[b,c][a,c]+[a,b] and 2σ=([c][b])([c][a])+([b][a])=0. Already on [a,b], the proposed value [b]+[a] differs from [b][a] by 2[a]0. Thus the refuted formula disagrees with the definition and fails the differential identity.

F1step 1.1algebra
3.1

Vertices have zero boundary, not a putative negative-dimensional face. Degeneracy does not rescue the formula: on a point the unsigned boundary of the constant edge is twice its vertex, whereas the signed boundary is zero. The empty target has no simplices and is not the witness. These finite calculations require no choice and use real coefficients, where two is nonzero.

F1step 1.1step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

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