Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21
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 wedge of a family of pointed spaces

Definition

Let ((Xi,xi))iI be a family of pointed topological spaces. On the tagged disjoint union iIXi (The disjoint union (coproduct) iXi with the final topology of the canonical injections: a set is open exactly when each of its traces is), define

(x,i)(y,j)(x,i)=(y,j)  or  (x=xi  and  y=xj).

This relation is reflexive and symmetric. For transitivity, the only nontrivial case has two related pairs that are not equal; then every point appearing is its summand's basepoint, so the first and third points are related as well. Thus is an equivalence relation.

For nonempty I, the wedge is the quotient space

iI(Xi,xi):=(iIXi) ⁣/

with the quotient topology (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection). The common equivalence class of the tagged basepoints is the wedge point, which makes the quotient pointed. The relation identifies no other points.

The wedge of the empty family is defined to be a one-point space, pointed at its sole element. For a pair one writes (X,x0)(Y,y0), and for rN one writes j<r(Xj,xj). In particular, the empty finite wedge is a point rather than an empty space.

Depends on

Used by

Dependency tree · two levels

13 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