Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 2026-09-07
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.

Finite roof squares and composable pairs can be cleared

Statement

Let f:X→Y and f′:X′→Y′ be ordinary arrows, and let α:QX→QX′, β:QY→QY′ satisfy βQf=Qf′α. There exist f′′:X′′→Y′′, k:X→X′′, l:Y→Y′′, and denominators s:X′→X′′, t:Y′→Y′′, such that f′′k=lf, f′′s=tf′, α=Q(s)−1Q(k), β=Q(t)−1Q(l). Moreover two composable localized arrows and their composite can simultaneously be represented by ordinary arrows after denominator isomorphisms of the three objects.

Facts & Assumptions

Given: Let f:X→Y and f′:X′→Y′ be ordinary arrows, and let α:QX→QX′, β:QY→QY′ satisfy βQf=Qf′α. There exist f′′:X′′→Y′′, k:X→X′′, l:Y→Y′′, and denominators s:X′→X′′, t:Y′→Y′′, such that f′′k=lf, f′′s=tf′, α=Q(s)−1Q(k), β=Q(t)−1Q(l). Moreover two composable localized arrows and their composite can simultaneously be represented by ordinary arrows after denominator isomorphisms of the three objects.

[F1]

Every localized arrow has either roof orientation, and equality of ordinary arrows is detected by a denominator (The calculus of fractions constructs the localization).

[F2]

Composition of roof classes is independent of representatives and is associative (Composition of roofs is well defined).

Proof

1.1F1F2

Write α=Q(s)−1Q(k). The outgoing Ore square for s,f′ gives t:Y′→Y′′ in S and f′′:X′′→Y′′ with f′′s=tf′. Write β=Q(q)−1Q(i), and apply Ore to t,q to find r:Y′′→Y(3) in S and j with rt=jq. Replace f′′,t by rf′′,rt and put l=ji. Then β=Q(t)−1Q(l) and the right square commutes.

2.1F1step 1.1algebra

The localized commuting square now gives Q(lf)=Q(f′′k). Dual equality detection supplies d in S with dlf=df′′k. Replace l,f′′,t by dl,df′′,dt; both ordinary squares now commute and dt∈S. This proves the square assertion, including identity or coincident arrows.

3.1F1F2algebra∎

For a composable pair α:QX→QY, β:QY→QZ, write α=Q(s)−1Q(f) with s:Y→Y′ in S. Write βQ(s)−1=Q(t)−1Q(g) with t:Z→Z′ in S and g:Y′→Z′. Thus after the object comparisons 1X,Q(s),Q(t) the pair is Q(f),Q(g) and its composite is Q(gf). The equalities follow from the proved composition law, not from an assumption about arbitrary diagrams.

Depends on

Dependency tree · 2 levels

Sources