Skip to main content

Chapter 3
Sets, Mappings, and Transformation Space

Foundations of Mathematics
Author: Mark Anthony Higgins
© Mark Anthony Higgins 11 October 2025
Revised Date: 15 June 2026
Ai Search
Audio Overview
Previous Chapter 2
Next Chapter 4
Flow Algebra 
flow "Sets, Mappings, and Transformation Space"

# ---------- CONCEPT ----------
# Sets define existence — what belongs within a boundary.
# Mappings define transformation — how one boundary connects to another.
# Together they create a transformation space: the structured field through which coherence moves.

# ---------- STATES ----------
state Structures:
  Set(S):
    description: "A defined boundary of elements sharing coherent identity."
    property: "Membership is determined by inclusion rule x ∈ S."
  Mapping(f):
    description: "A rule linking elements between sets: f: A → B."
    property: "Each input has a defined output — coherence between domains."
  TransformationSpace(T):
    description: "The composite field of all mappings between sets; dynamic topology of coherence."
    property: "Encodes relation, not objects — the motion between boundaries."

# ---------- PARAMETERS ----------
params:
  domain: "Source boundary A."
  codomain: "Target boundary B."
  injective: "Preserves uniqueness (1→1 coherence)."
  surjective: "Covers full target (complete mapping)."
  bijective: "Invertible coherence — one-to-one and onto."
  closure: true
  continuity: variable # Continuous if small change in input → small change in output.

# ---------- INVARIANTS ----------
invariants:
  - "Every element of domain maps to exactly one element of codomain."
  - "Composition preserves coherence: (f ∘ g)(x) = f(g(x))."
  - "Identity mapping acts as neutral element: id_A(x) = x."
  - "If bijective, inverse mapping exists: f⁻¹(f(x)) = x."
  - "Coherence preserved under mapping: structure(A) ↔ structure(B)."

# ---------- TRANSFORMS ----------
transforms:
  DefineSet(elements):
    rule: "Establish membership boundary: S = {x | property(x)}."
  Map(f, A→B):
    rule: "For each a ∈ A, assign b = f(a) ∈ B."
  Compose(f,g):
    rule: "Link two transformations coherently: (f ∘ g)(x) = f(g(x))."
  Invert(f):
    condition: "If bijective."
    rule: "Construct f⁻¹: B → A preserving mapping integrity."
  ExtendToSpace(F):
    rule: "Treat set of all mappings as a field of coherent transitions — transformation space T(A,B)."

# ---------- MONITORS ----------
monitors:
  CoherenceCheck:
    measure: "∀ a ∈ A, ∃! b ∈ B such that f(a)=b"
    output: "True if mapping is well-defined."
  CompositionIntegrity:
    track: "Associativity of composed functions."
    result: "(f∘(g∘h)) = ((f∘g)∘h)"
  Invertibility:
    check: "Bijectivity condition"
    output: "True if inverse mapping exists and maintains coherence."
  ContinuityMonitor:
    measure: "Δinput → Δoutput finite."
    meaning: "Detects smooth coherence transitions across mapping space."

# ---------- EQUATIONS ----------
equations:
  - "f: A → B"
  - "(f ∘ g)(x) = f(g(x))"
  - "id_A(x) = x"
  - "f⁻¹(f(x)) = x, if f bijective"
  - "T(A,B) = {f | f: A → B}"
  - "Coherence: ∀ a₁,a₂ ∈ A, a₁≈a₂ ⇒ f(a₁)≈f(a₂)"

# ---------- NOTES ----------
notes:
  - "A set defines a coherent region; a mapping defines coherent transformation."
  - "Composition is recursion in motion — the algebra of transitions."
  - "Bijection is perfect coherence: no loss or duplication of identity."
  - "The transformation space T(A,B) generalises both geometry and function analysis — every dynamic system is a mapping between sets of states."
  - "In Flow Algebra, mappings represent the connective tissue of reality — boundaries joined by consistent flow."
Explanatory Notes

The concept of a set is the first act of definition in mathematics — the drawing of a boundary that distinguishes what is included from what is not.
Every set is therefore a coherence region: a collection of entities that share a common property or relation.
To write x∈Sx ∈ S is to affirm that xx belongs within that boundary — that its nature aligns with the coherence of SS.

But mathematics truly comes alive when those boundaries interact.
A mapping f:A→Bf: A → B connects two sets, expressing how coherence transfers from one domain to another.
In its simplest form, a mapping is a rule: each element of AA finds a partner in BB.
When the mapping is bijective, this relationship becomes perfect — one-to-one and onto — forming a reversible bridge of structure.
This is coherence as symmetry: nothing is lost, nothing is duplicated, transformation without distortion.

As mappings combine, they generate a transformation space — the collection of all possible ways coherence can move between boundaries.
Each mapping is like a current in that field, and the composition of mappings becomes the algebra of transformation:

\( (f \circ g)(x) = f(g(x)) \)

revealing that the order of coherence matters, and that recursive transformation can build structured behaviour.

In this view, mathematics is not a study of objects but of relations.
Sets define where coherence resides; mappings define how it moves.
Together they form a topological field of motion — a space of transformations through which structure evolves.

Continuity adds another layer: when small changes in input produce small changes in output, coherence becomes smooth, and the mapping acquires geometric meaning.
This is where function theory, calculus, and geometry all meet — within the living network of transformation.

In Flow Algebra, sets and mappings are not static definitions but boundaries and flows.
Each mapping acts as a transformation channel that sustains identity across difference.
The entire mathematical universe can be seen as one vast transformation space —
a network of coherent boundaries joined by the logic of relation itself.

Previous Chapter 2
Next Chapter 4
Related Chapters
Privacy Policy
Site Map
Kireth Research
38 Thorndale Croft, Wetwang, Driffield
East Riding of Yorkshire YO25 9XZ
Telephone:
01377 236594
Designed By
Kireth Web Design
Audio Explainer RSS Feed