KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesRandom VariablesEngineering · Engineering MathematicsLesson 574/887← PrevNext →
GuidePublished 7 Aug 2026Updated 13 Aug 20267 min readBy Kevin Jogin
On this page

Ask about this page

KEVOS AIRandom Variables

KEVOS knowledge first · trusted web sources when needed

Engineering  /  Mathematics  — Discrete Probability

Random Variables

Random variables, their distributions, joint behaviour and independence.

Page KV-MATH-0343Reading time 3 minReviewed 2026-08-07Author Kevin Jogin

Executive summary

A random variable is a function on the sample space. It converts a probability distribution into a distribution over numbers, which is what makes averaging and concentration arguments available.

Indicator variables are the workhorse: nearly every counting argument in randomised algorithm analysis is a sum of indicators.

Learning objectives

  1. Define random variables and their induced distributions.
  2. Use indicator variables to express counts.
  3. State independence for random variables.

01Definition and induced distribution

Definition

Random variable

A function X : Ω → S for some set S, usually the integers or reals.

It induces a distribution on S by P(X = s) = P({ω : X(ω) = s}).

The sample space frequently disappears from view once the induced distribution is known, which is convenient and occasionally dangerous — two random variables can have identical distributions while being wildly different as functions, and their joint behaviour depends on the functions, not the distributions.

02Indicator variables

For an event A, the indicator 1_A takes value 1 on A and 0 elsewhere. Its expectation is exactly P(A), which is the bridge between counting and probability.

X = Σᵢ 1_{Aᵢ}  ⇒  E[X] = Σᵢ P(Aᵢ)

Because expectation is linear regardless of dependence, this identity holds with no independence assumption whatever. It is the reason so many expected-value computations in algorithm analysis are one line.

Note
The birthday problem, the expected number of comparisons in randomised quicksort, and the expected number of trials before finding a prime are all computed this way: define an indicator per potential contribution, sum the probabilities, and stop.

03Independence of random variables

Definition

Independent random variables

X and Y are independent if P(X = a, Y = b) = P(X = a)P(Y = b) for all a, b.

What independence buys
PropertyHolds when
E[X + Y] = E[X] + E[Y]Always
E[XY] = E[X]E[Y]X, Y independent
Var[X + Y] = Var[X] + Var[Y]X, Y independent (pairwise suffices for sums)
f(X), g(Y) independentX, Y independent

The first row is the important one: linearity of expectation needs nothing. The second and third do need independence, and forgetting that is a standard source of wrong variance calculations.

04Frequently asked questions

Why is linearity of expectation independent of independence?

Because it is just rearranging a finite sum over the sample space. Each outcome contributes its weight times the sum of the values, and reordering summation gives the result with no structural assumption.

Can uncorrelated variables be dependent?

Yes. Let X be uniform on {−1, 0, 1} and Y = X². Then E[XY] = E[X³] = 0 = E[X]E[Y], so they are uncorrelated, yet Y is a function of X.

Do identically distributed variables behave identically?

Individually, yes; jointly, no. X and X have the same distribution as X and an independent copy, but their sum behaves completely differently — 2X versus a genuinely averaged quantity.

Related pages

  • Expectation and Variance
  • Conditional Probability and Independence

Sources and method

Structural reference: Victor Shoup, A Computational Introduction to Number Theory and Algebra, Version 1, Cambridge University Press, 2005 — book pages 104-111.

This page carries the durable method layer only: definitions, constructions, algorithms, complexity results and selection criteria, authored originally for KEVOS. No text is transcribed or paraphrased from the source, and no numeric tables or benchmark data are reproduced — these are routed to live authoritative sources instead.

Author: Kevin Jogin. Last reviewed 2026-08-07.

Handbook application: from concept to controlled practice

Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review Random Variables. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.

The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.

Treat Random Variables as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—variables, random, independence, distributions, joint—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.

For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.

A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.

Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.

Step-by-step operating method

  1. Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
  2. Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
  3. Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
  4. Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
  5. Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.

Worked-example protocol

Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.

StageRecordQuality check
InputObjects, domain, notation, assumptionsEvery symbol is defined
MethodPermitted operation or cited result at each stepAll hypotheses hold
OutputExact result and representationCorrect type, domain and form
VerificationSubstitution, invariant or alternative derivationIndependent agreement
Boundary testZero, identity, degenerate or failed hypothesisScope is understood

Common failure modes and recovery actions

1. Watch for

Using a theorem without checking every hypothesis.

Recovery: Return to the governing definition or requirement and restate the decision in one sentence.

2. Watch for

Treating a suggestive example as a proof of the general case.

Recovery: Separate evidence from assumption, assign an owner and set a date for validation.

3. Watch for

Changing notation or conventions part-way through an argument.

Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.

4. Watch for

Hiding a division-by-zero, convergence, finiteness or commutativity assumption.

Recovery: Record the consequence, decision and rationale, then update the controlled baseline.

5. Watch for

Reporting a computed result without a residual, substitution or structural check.

Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.

Review checklist

  • Can every symbol be traced to a definition or prior result?
  • Which hypothesis does each major step use?
  • Does the method cover zero, identity, degenerate and boundary cases?
  • Can the conclusion be checked by a second representation or calculation?
  • Are mandatory requirements distinguished from recommendations and illustrative values?
  • Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
  • Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
  • Is there a named owner and a trigger for review, escalation, change or retirement?

Questions for deeper application

What is the most important distinction a practitioner must preserve when applying Random Variables?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

Which assumption about variables would change the result most if it proved false?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

What evidence would allow an independent reviewer to reproduce or challenge the conclusion?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

Which boundary, exception or failure case has not yet been tested?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

What must be handed over, monitored or reviewed after the immediate work is complete?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

Authoritative references and use notes

The sources below were selected as institutional or primary guidance for the broader practice. They support the handbook method; they do not imply that every statement or clause in a source applies to every project. Confirm the current edition, jurisdiction, contract and application before treating any requirement as mandatory.

  • MIT OpenCourseWare — Introduction to Probability and Statistics — Massachusetts Institute of Technology. Used for probability, inference, hypothesis testing and regression. Accessed 2026-08-13.
  • NIST Digital Library of Mathematical Functions — National Institute of Standards and Technology. Used for mathematical notation, numerical methods, asymptotics and special functions. Accessed 2026-08-13.

Continue learning

Conditional Probability and IndependenceGuide · Engineering MathematicsNEXT LESSON →Expectation and VarianceGuide · Engineering MathematicsFinite Probability DistributionsGuide · Engineering MathematicsMarkov's and Chebyshev's InequalitiesGuide · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®