Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

Faithfully flat descent of modules and affine algebras is effective

Statement

Assume the Axiom of Choice. For a faithfully flat ring map A→B, base change identifies A-modules with B-modules equipped with a descent isomorphism between their two pullbacks to B⊗AB, satisfying the cocycle identity over the triple tensor product. The same is true for commutative unital algebras, when transport is an algebra isomorphism. Writing transport as θ:N⊗AB→B⊗AN, the descended module or algebra is D={n∈N:θ(n⊗1)=1⊗n}, and B⊗AD→N, b⊗d↦bd, is an isomorphism respecting the datum.

Facts & Assumptions

[F1]

Faithfully flat tensor extension preserves exactness and detects zero modules and isomorphisms. Iterated tensor products give the pullbacks of affine modules and their maps. (Descent of vanishing along a faithfully flat morphism, Associativity of tensor products for compatible bimodules)

[F2]

Affine schemes and rings are contravariantly equivalent. (Affine schemes are contravariantly equivalent to commutative rings)

Proof

Given: AC, A→B, N, and the compatible transport θ.

1.1F1F2construct

First consider an affine cover with a section. For the equivalent scheme map g:T→S with section s, set M=s∗N. Pull transport back along T→T×ST, t↦(s(g(t)),t); it gives an isomorphism g∗M→N. Compatibility with the original transport is the cocycle identity pulled back along (s(g(t1)),t1,t2). Diagonal transport is an invertible idempotent, hence the identity, and reverse transport is its inverse by the same cocycle. Pulling back a compatible map along s recovers its unique map on M. Therefore descent is effective and fully faithful for this split cover. The argument applies equally to algebra transports.

2.1F1step 1.1algebra

The displayed D is the kernel of the difference of two A-linear maps from N into B⊗AN. Flat scalar extension preserves this kernel. After extending A to B, the cover becomes Spec⁡(B⊗AB)→Spec⁡B, with diagonal section supplied by multiplication B⊗AB→B. The datum becomes split, so step 1.1 says its invariant module recovers its downstairs module, and the base extension of the natural map B⊗AD→N is an isomorphism. Faithful flatness in [F1] reflects that isomorphism, proving the displayed descent map is an isomorphism before extension.

3.1F1step 1.1step 2.1algebra

For the canonical datum on B⊗AQ, the invariant equalizer is Q. Indeed after tensoring by B, the sequence 0→Q→B⊗AQ⇉B⊗AB⊗AQ becomes split exact, using multiplication and the split-cover argument of step 1.1. Exactness and detection in [F1] give the original assertion. A compatible map N→N′ preserves invariant equalizers; step 2.1 identifies it uniquely with the base extension of its restriction D→D′. This proves full faithfulness as well as effectiveness for modules.

4.1F1F2step 2.1step 3.1algebra∎

For algebra transport, the invariant subset is closed under unit, sums, scalar multiplication, and products, because transport preserves these operations. Thus D is an A-algebra. The module isomorphism in step 2.1 preserves multiplication and unit and is an algebra isomorphism. Compatible algebra maps restrict to algebra maps on invariants by step 3.1, giving the asserted algebra equivalence and effective affine scheme descent through [F2]. AC is inherited from the module and affine-scheme suppliers.

Depends on

Used by

Dependency tree · two levels

24 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