Alphabeta Math
False statementConstruction: Literature-sourcedVerification: 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.

Uniform C1 openness of transversality fails on arbitrary noncompact sources

Statement

False claim: if M is noncompact and F:M→N is transverse to an embedded submanifold Z⊆N, then every map uniformly C1-close to F is still transverse to Z.

Facts & Assumptions

Given: The map F:R→R, F(x)=e−x, the point submanifold Z={0}, a smooth bump β with support in [−1,1], β(0)=1, and β′(0)=0.

[L1]

Compact-source C1 openness is the honest theorem (Transversality is stable on a compact source).

Refutation

technique · direct
1.1givenalgebra

The map F never meets 0, so it is vacuously transverse to Z. For each integer n≥1, define Gn(x):=e−x−e−nβ(x−n)+e−n(x−n)β(x−n). Then Gn(n)=0 and Gn′(n)=−e−n−e−nβ′(0)+e−nβ(0)=0.

2.1givenstep 1.1algebra

The differences Gn−F and Gn′−F′ are supported in [n−1,n+1], and their sup norms are bounded by constants times e−n. Hence Gn→F in the uniform C1 topology.

3.1L1step 1.1step 2.1∎

But step 1.1 gives a critical zero of Gn at x=n, so Gn is not transverse to {0} by the regular-value criterion. Therefore no uniform C1 neighbourhood of F consists entirely of transverse maps. This agrees with [L1], which required compact source.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

5 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