Skip to content

? Sample Space

Julio Toboso edited this page Oct 1, 2026 · 1 revision

Data begins with distinction.

Before a probability can be assigned, before a pattern can be detected, before randomness can even be seen, something deeper must already have happened:

the world must have been cut into possibilities.

A die must be allowed to land on one face rather than another.
A measurement must be allowed to take one value rather than another.
A signal must be allowed to rise, fall, persist, or vanish.

This field of possible distinction is called the sample space.

🔰 At first, this may sound technical. It is not. It is one of the most philosophical ideas in all of probability.

A sample space is the decision about what counts as a possible result.

That decision depends on the world, but also on the model.

A coin may be modeled as:

  • heads or tails
  • angle of landing
  • number of spins
  • a cylinder of metal aloys
  • sound at impact

Each of these is a different view of the same event.
The world has not changed.
The space of relevant outcomes has.

⚜️ This is the first lesson:

probability begins not with chance, but with a question.

To choose a sample space is to decide the Type of answers we understand.

And once that space is chosen, deeper structures emerge:

  • randomness
  • events
  • patterns
  • continuity
  • measure
  • probability
  • information

From there, probability theory becomes the art of reasoning about what may happen, what must happen, and what can be said before the outcome arrives.

This chapter builds that structure from the ground up.

We begin with a question:

What is the relationship between reality and the spaces we use to describe it?

Data

Legend:

  • 🔰 Start here
  • 🏵️ Important Insight
  • ⚙️ Technical and applications
  • 💻 Some Code
  • ⚜️ Advanced Topics

Start

01 · Ω — What could happen

02 · X, 𝒳 — What we observe

03 · p(x) — What we expected

04 · I(x), H(X) — What an observation tells us

05 · Data — What is consistent

06 · Statistics — What we can learn.

07 · Databases - How to store data

08 · μ(x) — Fuzzy - When data is flexible

  • 08.1 Fuzzy Logic (planned)
  • 08.2 Fuzzy Numbers (planned)
  • 08.3 Possibility vs Probability (planned)

09 · x(t) — Signals and systems - Where patterns live

  • 09.1 Signals (stub)
  • 09.2 Sampling and Aliasing (planned)
  • 09.3 Convolution (planned)
  • 09.4 Frequency (planned)

10 · f_θ — Modelling and linear algebra

  • 10.1 🔰 Vectors and Matrices (planned)
  • 10.2 Mathematical Modelling (planned)

11 · min L(θ) — Optimisation

  • 11.1 🔰 Derivatives (planned)
  • 11.2 Convex Optimisation (planned)

12 · Learning from data

13 · Cause, design, capstone

  • 13.1 Cause and Effect (planned)
  • 13.2 Capstone Guide (planned)

Appendix

Clone this wiki locally