Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-31
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.

Every submersion is an open map

Statement

Every smooth submersion F:M→N is an open map.

Facts & Assumptions

Given: A smooth submersion F:M→N.

[L1]

Around each point of M, a submersion is locally the projection (u,v)↦u (Local normal form for submersions).

[L2]

Products carry the usual product topology, so if (u0,v0) lies in an open set of a product, some product neighbourhood of (u0,v0) lies inside that open set (A map into a product is continuous iff each of its components is; the projections are continuous and open; and each projection is surjective when every factor is nonempty, which for an infinite index set uses the Axiom of Choice).

Proof

technique · direct
1.1L1given

Let W⊆M be open and let y∈F(W). Choose x∈W with F(x)=y. By [L1], after shrinking around x and y, the map is identified with a coordinate projection (u,v)↦u.

2.1step 1.1L2

Since W is open and contains x, [L2] gives a product neighbourhood U1×U2⊆W in those coordinates. The projection sends this product neighbourhood onto the open set U1. Therefore y has an open neighbourhood contained in F(W).

3.1F1step 2.1∎

Because every point of F(W) is interior, F(W) is open. Thus F is an open map in the sense of [F1].

Depends on

Used by

Dependency tree · two levels

17 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