PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-01

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.

The critical value set of a smooth map is sigma-compact

Statement

For a smooth map $F : M \to N$ , the critical value set $CV (F)$ is a $σ$ -compact subset of $N$ .

Facts & Assumptions

Given: A smooth map $F : M \to N$ .

[F1]

The critical value set is the image of the critical locus (The critical locus and critical value set).

[L1]

The submersion locus is open, so the critical locus is closed; every manifold has a compact exhaustion; and continuous images of compact sets are compact (The immersion and submersion loci are open, Every manifold has a compact exhaustion, The image of a compact metric space under a continuous map is compact, and so is the image of any compact subset).

Proof

technique · direct

1.1

By [L1], the critical locus $Crit (F)$ is closed in $M$ . Let $K_{1} \subseteq K_{2} \subseteq \dots$ be a compact exhaustion of $M$ from [L1].

L1givenchoose

2.1

Then $Crit (F) \cap K_{j}$ is compact for every $j$ , so [L1] makes $F (Crit (F) \cap K_{j})$ compact in $N$ .

L1step 1.1

3.1

By [F1], $CV (F) = ⋃_{j \geq 1} F (Crit (F) \cap K_{j}),$ so $CV (F)$ is a countable union of compact sets.

F1step 2.1algebra∎

Depends on

Used by

Regular values form a dense G_δ set Corollary
The critical-value set need not be closed False statement

Dependency tree · two levels

18 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

Marco Gualtieri, Topology I: Smooth Manifolds, cumulative notes (standard reference, not scraped)