Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-24
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.

Direct and inverse image satisfy Beck–Chevalley for pullback squares of sets

Statement

Let

P→qYp↓↓gX→fZ

be a pullback square of sets. For every A⊆X,

q[p−1[A]]=g−1[f[A]].

Equivalently, direct image and inverse image satisfy q!p∗=g∗f! on power sets. The formula remains valid for empty fibres and identity pullbacks.

Facts & Assumptions

Given: The displayed pullback square and a subset A⊆X.

[L1]

A pullback of X→fZ←gY has projections satisfying fp=gq and the universal property for every compatible pair (Pullbacks and pushouts as limits and colimits of cospans and spans).

[L2]

Membership in a direct image or inverse image is witnessed by the corresponding relation equation (The image R[A] and the preimage R−1[B] of a set under a relation).

Proof

technique · direct
1.1L1L2

If y∈q[p−1[A]], then some w∈P satisfies q(w)=y and p(w)∈A. The pullback equation gives g(y)=gq(w)=fp(w), so g(y)∈f[A] and y∈g−1[f[A]].

1.2L1L2construct

Conversely, if y∈g−1[f[A]], choose x∈A with f(x)=g(y). The pullback universal property supplies the unique w∈P with p(w)=x and q(w)=y, so y∈q[p−1[A]]. If the fibre is empty, both existential conditions fail.

2.1step 1.1step 1.2∎

Steps 1.1 and 1.2 prove equality. Identity squares give the identity direct and inverse images; if one map is a section of the other, the same equality specializes to the usual section–retraction image formulas.

Depends on

Used by

Dependency tree · two levels

10 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