Indicator Symbols: From Conditions to Counts

For an event A, the indicator 1_A equals 1 when A occurs and 0 otherwise. It is a random variable, so logical statements can enter arithmetic without losing their meaning.

In 1{x > 3}, the braces state the condition being tested. First read the condition in words, then evaluate whether it is true for the current object or outcome.

An indexed indicator I_i asks the same yes-or-no question about object i. The index may identify a customer, machine, trial, edge, time, or sample position.

Every qualifying object contributes 1 and every non-qualifying object contributes 0. Therefore the sum of indicators equals the number of objects that satisfy the condition.

Set-builder notation returns the matching objects; a sum of indicators returns how many match. Choose the expression that has the same output type as the question.

A permutation pi maps each position i to one item pi(i). Treat pi as a function call, not as the number 3.14159; context tells which meaning is intended.

The rule i < j < k keeps only increasing triples. It selects one canonical ordering for each three-element choice, avoiding all six permutations of the same set.

A condition written below Sigma restricts the index set. Read it as: add the summand only over indices that satisfy this rule.

Define I_i for one event, evaluate it as 0 or 1, then sum across i. Separating the local rule from the global sum makes the counting logic auditable.

Letters such as pi, lambda, mu, and sigma have common conventions but no universal meaning. Always find the local definition, domain, and output type before calculating.

The index i can label the i-th user, server, trial, edge, or time point. Its job is to identify which object receives the condition; it need not equal an observed measurement.

If A(omega) is the set of failed events in outcome omega, then its cardinality |A(omega)| equals the sum of failure indicators over all events.

Linearity of expectation gives E[sum I_i] = sum E[I_i] even when the indicators are dependent. Since E[I_i] = P(A_i), expected count is the sum of event probabilities.

I_ij describes a property of a pair; I_ijk describes a property of a triple. More indices mean more objects participate in the local condition, not a larger numerical value.

A function is defined by its input and output. An indicator returns 0 or 1, a counting function returns a number, and a selection function may return a set or list.

Evaluate the inner sum for a fixed outer index, producing a subtotal. Then add those subtotals across the outer index. Reading from the inside out prevents index confusion.

Omega is one outcome in the sample space and X is a rule that assigns a number to it. The expression X(omega) is the realized value when outcome omega occurs.

A counting statement, a program loop, and a sum of indicators can encode the same procedure. Translating among them is a strong check that the indices and condition are correct.

Variance of a sum contains individual variances and pairwise covariances. Independence makes covariance terms zero; without it, shared causes can increase or decrease total variability.

Identify the innermost condition, evaluate its indicator, apply the function or summand, check the index restriction, then accumulate outward. At every layer, state the output type and unit.