Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (gpt-5.6-terra)audited 2026-08-29
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.

Each smooth atlas is contained in a unique maximal smooth atlas

Statement

Let A be a smooth atlas on a topological manifold M, with generated smooth structure [A].

  1. [A] is a smooth atlas containing A, and it is maximal: every smooth atlas on M that contains [A] equals [A].
  2. For a second smooth atlas B on M, the two generated structures coincide, [A]=[B], if and only if AB is a smooth atlas.
  3. Consequently A is contained in exactly one maximal smooth atlas, namely [A].

Facts & Assumptions

Given: Smooth atlases A and B on a topological manifold M, and the generated structures [A], [B].

[F1]

A smooth atlas is a family of charts whose domains cover M and whose members are pairwise smoothly compatible, and two atlases are compatible when every chart of one is compatible with every chart of the other; the family of all charts of both is written AB (Smooth atlases).

[F2]

The structure generated by A is the family [A] of all charts compatible with every chart of A, and it is a smooth atlas containing A (The smooth structure generated by an atlas).

[L1]

All charts compatible with a smooth atlas form a smooth atlas (All charts compatible with a smooth atlas form a smooth atlas).

Proof

technique · direct
1.1

By [F2] and [L1], [A] is a smooth atlas on M containing A.

givenF2L1
1.2

If C is any smooth atlas containing A, then every [given, F1, F2] chart of C is compatible with every chart of A, because all members of the single atlas C are pairwise compatible by [F1]; hence C[A] by the defining membership condition in [F2]. Applied to an atlas containing [A], this yields C[A], so [A] is maximal.

givenF1F2
1.3

If [A]=[B], then every chart of AB [given, F1, F2] belongs to the smooth atlas [A]; therefore the domains cover M and all members are pairwise compatible by [F1], so AB is a smooth atlas.

givenF1F2
2.1

If AB is a smooth atlas, then each chart of [given, F1, F2, step 1.2] B is compatible with every chart of A, so B[A] by [F2]; symmetrically A[B]. Step 1.2 applied to the atlas [B] containing B gives [B][A], and the same argument with A and B exchanged gives [A][B]. Hence [A]=[B].

givenF1F2step 1.2
3.1

Steps 1.1 and 1.2 prove that [A] is a maximal smooth atlas [step 1.1, step 1.2, step 2.1] containing A. If C is any maximal smooth atlas containing A, then step 1.2 gives C[A], and this containment cannot be proper because [A] is itself a smooth atlas by step 1.1. Therefore C=[A], and with steps 1.3 and 2.1 all three claims are proved.

step 1.1step 1.2step 1.3step 2.1

Depends on

Used by

Dependency tree · two levels

8 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