Analysis (relay analysis, 1st chapter)

37 topics across 6 chapters

Chapter 1

Chapter I orientation: what “relay analysis” is trying to achieve

Where relay circuits show up (telephone switching, control/protective circuits)

Three core problems: equivalence, simplification (least contacts), and synthesis

Binary abstraction: open vs closed circuit; encoding with 0 and 1

Chapter 2

Modeling relay/switching circuits as two-terminal algebraic objects

↗ Binary abstraction: open vs closed circuit; encoding with 0 and 1 (see Chapter 1)

Define the hindrance function X_ab for a two-terminal circuit a–b

Define operations: series connection as “+” and parallel connection as multiplication

Postulates/axioms for series-parallel switching behavior and their physical meaning

Negation via make/break contacts: define X′ and interpret complements

Chapter 3

Bridge to logic: Boolean algebra / calculus of propositions viewpoint

Translate between circuits and logic: OR/AND/NOT as parallel/series/negation

↗ Negation via make/break contacts: define X′ and interpret complements (see Chapter 2)

Huntington-style postulates: why these rules define a Boolean algebra structure

De Morgan’s laws and what they mean for “complementing” a relay network

Two interpretations: algebra of classes vs calculus of propositions (and why it matters)

Chapter 4

Manipulating relay expressions: proving theorems, duality, simplification

Proof method: “perfect induction” by checking all 0/1 cases

Core algebraic theorems used for relay simplification

4 subtopics

Commutativity and associativity: rearranging series/parallel without changing behavior

Distributive laws: multiply-out vs factor expressions (network expansion vs reduction)

Identity, idempotence, and absorption-style rules (fast simplifications)

↗ De Morgan’s laws and what they mean for “complementing” a relay network (see Chapter 3)

Duality principle: generate the “dual theorem” by swapping +/· and 0/1

Canonical expansions for switching functions (toward systematic synthesis)

3 subtopics

Shannon-style expansion: expand f(X1,…,Xn) about a variable (two cases X1=0/1)

Build sum-of-products and product-of-sums forms from a truth-table specification

Minimize: reduce contact count by algebraic rewriting and factoring choices

Chapter 5

Synthesis workflow preview: from desired behavior to a (simplest) circuit

Write the desired switching behavior as equations/functions of relay variables

Turn an expression into a series/parallel circuit diagram (and back again)

Equivalence checking: show two circuits match by simplifying to the same expression

Cost model: what “least number of relay contacts/switch blades” means in practice

Chapter 6

How to study the 1st chapter effectively (deliverables + practice)

Deliverable: 1-page Chapter I summary + a glossary of every symbol used

Pitfalls checklist: confusing + vs OR, 0/1 meaning, and complement conventions

Re-derive: explain 0/1, +, multiplication, and complement using only circuit pictures

Practice: simplify 10 relay expressions and justify each step by a named theorem

Mini-lab: implement 3 small switching functions and verify equivalence by simulation