Alphabeta Math
Pipeline-generated
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.

✓ 1 result · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Constructible Incidence And Cochain Models Examples

1 · Prerequisites

2 · Summary

Objective. This companion page works the smallest non-trivial incidence computation of its A page. The closed interval is stratified by its two endpoints and its open edge, and a finite constructible sheaf is recorded by three vector spaces V0,V1,Ve with generization maps u0:V0→Ve and u1:V1→Ve. The incidence cochains of the face poset reduce, after an invertible change of coordinates that strips off a contractible summand, to the two-term complex [V0⊕V1→u0−u1Ve] in degrees zero and one, so the actual derived global sections are not merely modelled but computed. The two boundary computations are then read off: the constant sheaf has cohomology k in degree zero and nothing above, while the extension by zero of k on the open edge has one copy of k in degree one and vanishes in degree zero. The example depends only on the incidence lemma of constructible-incidence-and-cochain-models and finite linear algebra.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

Incidence cochains of a closed interval

Example

Assume AC (The Axiom of Choice). Stratify the closed interval by its endpoints and open edge. A finite constructible sheaf has vector spaces V0,V1,Ve with generization maps u0:V0→Ve and u1:V1→Ve. Its actual derived global sections are computed by [V0⊕V1→u0−u1Ve], in degrees zero and one. Thus a constant sheaf k has cohomology k in degree zero and zero otherwise. Extension by zero of k on the open edge has one copy of k in degree one and zero otherwise.

Facts & Assumptions

Given: The Axiom of Choice The Axiom of Choice, a field k, the full 1-simplex K with nonempty faces v0,v1,e with D=∅ and realization the closed interval X=∣K∣ (The geometric realization of an abstract simplicial complex), and a sheaf F on X which is finite-rank locally constant on every open simplex, so that by the incidence model it corresponds to the finite-dimensional diagram with V0:=Fv0, V1:=Fv1, Ve:=Fbe, where be is the midpoint of the open edge and generization maps u0:V0→Ve, u1:V1→Ve. Cohomology is derived global sections (Sheaf cohomology as right derived global sections) and the constant sheaf is the sheaf of locally constant functions (The constant sheaf is the sheaf of locally constant functions); extension by zero is that of Extension by zero for abelian sheaves on an open subspace.

[F1]

Actual derived incidence model (Finite simplicial constructible sheaves have an actual derived incidence model): the exact realization of finite-dimensional diagrams realizes F as q−1V, and ordinary cohomology of q−1V has a bounded finite cochain model computed from the diagram, agreeing with the derived global sections; the model is the finite incidence cochain complex of the diagram on the face poset.

[F2]

Constant sheaf (The constant sheaf is the sheaf of locally constant functions): the constant sheaf kX has sections the locally constant k-valued functions, its stalks are k, and its restriction to every open simplex is constant with value k and identity generization maps.

[F3]

Extension by zero (Extension by zero for abelian sheaves on an open subspace): for the open edge inclusion j:(0,1)↪X, the sheaf j!k(0,1) has stalk k at points of the open edge and stalk 0 at the two endpoints, and it is constant on each open simplex; hence its diagram has V0=V1=0, Ve=k and zero generization maps.

[F4]

Choice (The Axiom of Choice): AC is assumed; the computation below is finite linear algebra and uses no further selection.

Verification

1.1F1F4givenconstruct

The face poset is P={v0,v1,e} with v0≤e and v1≤e, and every strict chain has length at most one. The incidence cochain model for the derived inverse limit of the diagram (V0,V1,Ve,u0,u1) is the two-term complex with C0=V0⊕V1⊕Ve, C1=Ve⊕Ve and differential d(v0,v1,w)=(w−u0v0, w−u1v1); by [F1] the cohomology of this complex is the actual derived global sections of F, so RiΓ(X,F) vanishes outside degrees 0 and 1.

2.1step 1.1algebra

Change coordinates invertibly in the source by t:=w−u1v1 and in the target by (u,v):=(first output−second output, second output). In the new coordinates the differential is d(t,v0,v1)=(u1v1−u0v0, t), which is the direct sum of the identity map Ve→idVe and the two-term complex [V0⊕V1→u0−u1Ve] after multiplying the first target coordinate by −1. The identity summand is contractible, so RiΓ(X,F)≅Hi[V0⊕V1→u0−u1Ve] in degrees 0 and 1 and is zero in all other degrees.

3.1step 2.1F2F3algebra∎

For the constant sheaf F=kX we have V0=V1=Ve=k with both generization maps the identity by [F2], so the difference map k⊕k→k is surjective with kernel the diagonal copy of k; hence H0=k and H1=0, and all higher cohomology vanishes by step 2.1. For F=j!k(0,1) the diagram is V0=V1=0, Ve=k with zero maps by [F3], so the two-term complex reduces to a single copy of k in degree 1; hence H1=k, H0=0 and all other cohomology vanishes. This proves both stated computations, and no step selects from a family, so no choice beyond the inherited AC is used by the computation.

Sources