Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Equivariant maps descend on free proper quotients

Statement

Let M and N be smooth free proper G-manifolds. Every smooth G-equivariant map f:MN induces a unique smooth map f:M/GN/G such that

fqM=qNf.

Facts & Assumptions

Given: The two free proper G-manifolds, their quotient maps, and a smooth equivariant map f:MN.

[F1]

Equivariance means f(gx)=gf(x). Equivariant maps and equivariant vector bundles.

[F2]

The quotient maps are smooth surjective submersions. Free proper action quotient manifold.

[F4]

A smooth submersion has local projection form and smooth local sections. The constant-rank theorem for manifolds.

Proof

Proof technique: quotient universality followed by local submersion sections.

1.1

If qM(x)=qM(y), then y=gx for some gG. By [F1], f(y)=gf(x), so qN(f(y))=qN(f(x)). Thus the smooth map qNf is constant on the fibres of qM.

F1given
2.1

Apply [F3] to obtain a unique continuous map f:M/GN/G with fqM=qNf.

F2F3step 1.1
3.1

Let uM/G. Since qM is a submersion by [F2], [F4] supplies a smooth local section s:UM near u. On U, the factorization identity gives fU=qNfs, which is smooth. Such neighborhoods cover M/G, so f is smooth. Uniqueness as a smooth map follows from the uniqueness in [F3]. No choice principle is used.

F2F3F4step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

26 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