Graphical interpretation of the parallel operator with a ∥ b = c {\displaystyle a\parallel b=c}

The parallel operator ‖ {\displaystyle \|} (pronounced "parallel", following the parallel lines notation from geometry; also known as reduced sum, parallel sum or parallel addition) is a binary operation which is used as a shorthand in electrical engineering, but is also used in kinetics, fluid mechanics and financial mathematics. The name parallel comes from the use of the operator computing the combined resistance of resistors in parallel.

Overview

The parallel operator represents the reciprocal value of a sum of reciprocal values (sometimes also referred to as the "reciprocal formula" or "harmonic sum") and is defined by:

a ∥ b := 1 1 a + 1 b = a b a + b , {\displaystyle a\parallel b\mathrel {:=} {\frac {1}{{\dfrac {1}{a}}+{\dfrac {1}{b}}}}={\frac {ab}{a+b}},}

where a, b, and a ∥ b {\displaystyle a\parallel b} are elements of the extended complex numbers C ¯ = C ∪ { ∞ } . {\displaystyle {\overline {\mathbb {C} }}=\mathbb {C} \cup \{\infty \}.}

The operator gives half of the harmonic mean of two numbers a and b.

As a special case, for any number a ∈ C ¯ {\displaystyle a\in {\overline {\mathbb {C} }}}:

a ∥ a = 1 2 / a = 1 2 a . {\displaystyle a\parallel a={\frac {1}{2/a}}={\tfrac {1}{2}}a.}

Further, for all distinct numbers a ≠ b {\displaystyle a\neq b}:

| a ∥ b | > 1 2 min ( | a | , | b | ) , {\displaystyle {\big |}\,a\parallel b\,{\big |}>{\tfrac {1}{2}}\min {\bigl (}|a|,|b|{\bigr )},}

with | a ∥ b | {\displaystyle {\big |}\,a\parallel b\,{\big |}} representing the absolute value of a ∥ b {\displaystyle a\parallel b}, and min ( x , y ) {\displaystyle \min(x,y)} meaning the minimum (least element) among x and y.

If a {\displaystyle a} and b {\displaystyle b} are distinct positive real numbers then 1 2 min ( a , b ) < | a ∥ b | < min ( a , b ) . {\displaystyle {\tfrac {1}{2}}\min(a,b)<{\big |}\,a\parallel b\,{\big |}<\min(a,b).}

The concept has been extended from a scalar operation to matrices and further generalized.

Notation

The operator was originally introduced as reduced sum by Sundaram Seshu in 1956, studied as operator ∗ by Kent E. Erickson in 1959, and popularized by Richard James Duffin and William Niles Anderson, Jr. as parallel addition or parallel sum operator : in mathematics and network theory since 1966. While some authors continue to use this symbol up to the present, for example, Sujit Kumar Mitra used ∙ as a symbol in 1970. In applied electronics, a ∥ sign became more common as the operator's symbol around 1974. This was often written as doubled vertical line (||) available in most character sets (sometimes italicized as //), but now can be represented using Unicode character U+2225 ( ∥ ) for "parallel to". In LaTeX and related markup languages, the macros \| and \parallel are often used (and rarely \smallparallel is used) to denote the operator's symbol.

Properties

Let C ~ {\displaystyle {\widetilde {\mathbb {C} }}} represent the extended complex plane excluding zero, C ~ := C ∪ { ∞ } ∖ { 0 } , {\displaystyle {\widetilde {\mathbb {C} }}:=\mathbb {C} \cup \{\infty \}\smallsetminus \{0\},} and φ {\displaystyle \varphi } the bijective function from C {\displaystyle \mathbb {C} } to C ~ {\displaystyle {\widetilde {\mathbb {C} }}} such that φ ( z ) = 1 / z . {\displaystyle \varphi (z)=1/z.} One has identities

φ ( z t ) = φ ( z ) φ ( t ) , {\displaystyle \varphi (zt)=\varphi (z)\varphi (t),}

and

φ ( z + t ) = φ ( z ) ∥ φ ( t ) {\displaystyle \varphi (z+t)=\varphi (z)\parallel \varphi (t)}

This implies immediately that C ~ {\displaystyle {\widetilde {\mathbb {C} }}} is a field where the parallel operator takes the place of the addition, and that this field is isomorphic to C . {\displaystyle \mathbb {C} .}

The following properties may be obtained by translating through φ {\displaystyle \varphi } the corresponding properties of the complex numbers.

Field properties

As for any field, ( C ~ , ∥ , ⋅ ) {\displaystyle ({\widetilde {\mathbb {C} }},\,\parallel \,,\,\cdot \,)} satisfies a variety of basic identities.

It is commutative under parallel and multiplication:

a ∥ b = b ∥ a a b = b a {\displaystyle {\begin{aligned}a\parallel b&=b\parallel a\\[3mu]ab&=ba\end{aligned}}}

It is associative under parallel and multiplication:

( a ∥ b ) ∥ c = a ∥ ( b ∥ c ) = a ∥ b ∥ c = 1 1 a + 1 b + 1 c = a b c a b + a c + b c , ( a b ) c = a ( b c ) = a b c . {\displaystyle {\begin{aligned}&(a\parallel b)\parallel c=a\parallel (b\parallel c)=a\parallel b\parallel c={\frac {1}{{\dfrac {1}{a}}+{\dfrac {1}{b}}+{\dfrac {1}{c}}}}={\frac {abc}{ab+ac+bc}},\\&(ab)c=a(bc)=abc.\end{aligned}}}

Both operations have an identity element; for parallel the identity is ∞ {\displaystyle \infty } while for multiplication the identity is 1:

a ∥ ∞ = ∞ ∥ a = 1 1 a + 0 = a , 1 ⋅ a = a ⋅ 1 = a . {\displaystyle {\begin{aligned}&a\parallel \infty =\infty \parallel a={\frac {1}{{\dfrac {1}{a}}+0}}=a,\\&1\cdot a=a\cdot 1=a.\end{aligned}}}

Every element a {\displaystyle a} of C ~ {\displaystyle {\widetilde {\mathbb {C} }}} has an inverse under parallel, equal to − a , {\displaystyle -a,} the additive inverse under addition. (But 0 has no inverse under parallel.)

a ∥ ( − a ) = 1 1 a − 1 a = ∞ . {\displaystyle a\parallel (-a)={\frac {1}{{\dfrac {1}{a}}-{\dfrac {1}{a}}}}=\infty .}

The identity element ∞ {\displaystyle \infty } is its own inverse, ∞ ∥ ∞ = ∞ . {\displaystyle \infty \parallel \infty =\infty .}

Every element a ≠ ∞ {\displaystyle a\neq \infty } of C ~ {\displaystyle {\widetilde {\mathbb {C} }}} has a multiplicative inverse a − 1 = 1 / a {\displaystyle a^{-1}=1/a}:

a ⋅ 1 a = 1. {\displaystyle a\cdot {\frac {1}{a}}=1.}

Multiplication is distributive over parallel:

k ( a ∥ b ) = k 1 a + 1 b = 1 1 k a + 1 k b = k a ∥ k b . {\displaystyle k(a\parallel b)={\frac {k}{{\dfrac {1}{a}}+{\dfrac {1}{b}}}}={\frac {1}{{\dfrac {1}{ka}}+{\dfrac {1}{kb}}}}=ka\parallel kb.}

Repeated parallel

Repeated parallel is equivalent to division,

a ∥ a ∥ ⋯ ∥ a ⏟ n times = 1 1 a + 1 a + ⋯ + 1 a ⏟ n times = a n . {\displaystyle \underbrace {a\parallel a\parallel \cdots \parallel a} _{n{\text{ times}}}={\frac {1}{\underbrace {{\dfrac {1}{a}}+{\dfrac {1}{a}}+\cdots +{\dfrac {1}{a}}} _{n{\text{ times}}}}}={\frac {a}{n}}.}

Or, multiplying both sides by n,

n ( a ∥ a ∥ ⋯ ∥ a ⏟ n times ) = a . {\displaystyle n(\underbrace {a\parallel a\parallel \cdots \parallel a} _{n{\text{ times}}})=a.}

Unlike for repeated addition, this does not commute:

a b ≠ b a implies a ∥ a ∥ ⋯ ∥ a ⏟ b times ≠ b ∥ b ∥ ⋯ ∥ b ⏟ a times . {\displaystyle {\frac {a}{b}}\neq {\frac {b}{a}}\quad {\text{implies}}\quad \underbrace {a\parallel a\parallel \cdots \parallel a} _{b{\text{ times}}}\,\neq \,\underbrace {b\parallel b\parallel \cdots \parallel b} _{a{\text{ times}}}~\!.}

Binomial expansion

Using the distributive property twice, the product of two parallel binomials can be expanded as

( a ∥ b ) ( c ∥ d ) = a ( c ∥ d ) ∥ b ( c ∥ d ) = a c ∥ a d ∥ b c ∥ b d . {\displaystyle {\begin{aligned}(a\parallel b)(c\parallel d)&=a(c\parallel d)\parallel b(c\parallel d)\\[3mu]&=ac\parallel ad\parallel bc\parallel bd.\end{aligned}}}

The square of a binomial is

( a ∥ b ) 2 = a 2 ∥ a b ∥ b a ∥ b 2 = a 2 ∥ 1 2 a b ∥ b 2 . {\displaystyle {\begin{aligned}(a\parallel b)^{2}&=a^{2}\parallel ab\parallel ba\parallel b^{2}\\[3mu]&=a^{2}\parallel {\tfrac {1}{2}}ab\parallel b^{2}.\end{aligned}}}

The cube of a binomial is

( a ∥ b ) 3 = a 3 ∥ 1 3 a 2 b ∥ 1 3 a b 2 ∥ b 3 . {\displaystyle (a\parallel b)^{3}=a^{3}\parallel {\tfrac {1}{3}}a^{2}b\parallel {\tfrac {1}{3}}ab^{2}\parallel b^{3}.}

In general, the nth power of a binomial can be expanded using binomial coefficients which are the reciprocal of those under addition, resulting in an analog of the binomial formula:

( a ∥ b ) n = a n ( n 0 ) ∥ a n − 1 b ( n 1 ) ∥ ⋯ ∥ a n − k b k ( n k ) ∥ ⋯ ∥ b n ( n n ) . {\displaystyle (a\parallel b)^{n}={\frac {a^{n}}{\binom {n}{0}}}\parallel {\frac {a^{n-1}b}{\binom {n}{1}}}\parallel \cdots \parallel {\frac {a^{n-k}b^{k}}{\binom {n}{k}}}\parallel \cdots \parallel {\frac {b^{n}}{\binom {n}{n}}}.}

Logarithm and exponential

The following identities hold:

1 log ⁡ ( a b ) = 1 log ⁡ ( a ) ∥ 1 log ⁡ ( b ) , {\displaystyle {\frac {1}{\log(ab)}}={\frac {1}{\log(a)}}\parallel {\frac {1}{\log(b)}},}

exp ⁡ ( 1 a ∥ b ) = exp ⁡ ( 1 a ) exp ⁡ ( 1 b ) {\displaystyle \exp \left({\frac {1}{a\parallel b}}\right)=\exp \left({\frac {1}{a}}\right)\exp \left({\frac {1}{b}}\right)}

Factoring parallel polynomials

As with a polynomial under addition, a parallel polynomial with coefficients a k {\displaystyle a_{k}} in C ~ {\textstyle {\widetilde {\mathbb {C} }}} (with a 0 ≠ ∞ {\displaystyle a_{0}\neq \infty }) can be factored into a product of monomials:

a 0 x n ∥ a 1 x n − 1 ∥ ⋯ ∥ a n = a 0 ( x ∥ − r 1 ) ( x ∥ − r 2 ) ⋯ ( x ∥ − r n ) {\displaystyle {\begin{aligned}&a_{0}x^{n}\parallel a_{1}x^{n-1}\parallel \cdots \parallel a_{n}=a_{0}(x\parallel -r_{1})(x\parallel -r_{2})\cdots (x\parallel -r_{n})\end{aligned}}}

for some roots r k {\displaystyle r_{k}} (possibly repeated) in C ~ . {\textstyle {\widetilde {\mathbb {C} }}.}

Analogous to polynomials under addition, the polynomial equation

( x ∥ − r 1 ) ( x ∥ − r 2 ) ⋯ ( x ∥ − r n ) = ∞ {\displaystyle (x\parallel -r_{1})(x\parallel -r_{2})\cdots (x\parallel -r_{n})=\infty }

implies that x = r k {\textstyle x=r_{k}} for some k.

Quadratic formula

A linear equation can be easily solved via the parallel inverse:

a x ∥ b = ∞ ⟹ x = − b a . {\displaystyle {\begin{aligned}ax\parallel b&=\infty \\[3mu]\implies x&=-{\frac {b}{a}}.\end{aligned}}}

To solve a parallel quadratic equation, complete the square to obtain an analog of the quadratic formula

a x 2 ∥ b x ∥ c = ∞ x 2 ∥ b a x = − c a x 2 ∥ b a x ∥ 4 b 2 a 2 = ( − c a ) ∥ 4 b 2 a 2 ( x ∥ 2 b a ) 2 = b 2 ∥ − 1 4 a c 1 4 a 2 ⟹ x = ( − b ) ∥ ± b 2 ∥ − 1 4 a c 1 2 a . {\displaystyle {\begin{aligned}ax^{2}\parallel bx\parallel c&=\infty \\[5mu]x^{2}\parallel {\frac {b}{a}}x&=-{\frac {c}{a}}\\[5mu]x^{2}\parallel {\frac {b}{a}}x\parallel {\frac {4b^{2}}{a^{2}}}&=\left(-{\frac {c}{a}}\right)\parallel {\frac {4b^{2}}{a^{2}}}\\[5mu]\left(x\parallel {\frac {2b}{a}}\right)^{2}&={\frac {b^{2}\parallel -{\tfrac {1}{4}}ac}{{\tfrac {1}{4}}a^{2}}}\\[5mu]\implies x&={\frac {(-b)\parallel \pm {\sqrt {b^{2}\parallel -{\tfrac {1}{4}}ac}}}{{\tfrac {1}{2}}a}}.\end{aligned}}}

Including zero

The extended complex numbers including zero, C ¯ := C ∪ ∞ , {\displaystyle {\overline {\mathbb {C} }}:=\mathbb {C} \cup \infty ,} is no longer a field under parallel and multiplication, because 0 has no inverse under parallel. (This is analogous to the way ( C ¯ , + , ⋅ ) {\displaystyle {\bigl (}{\overline {\mathbb {C} }},{+},{\cdot }{\bigr )}} is not a field because ∞ {\displaystyle \infty } has no additive inverse.)

For every non-zero a,

a ∥ 0 = 1 1 a + 1 0 = 0 {\displaystyle a\parallel 0={\frac {1}{{\dfrac {1}{a}}+{\dfrac {1}{0}}}}=0}

The quantity 0 ∥ ( − 0 ) = 0 ∥ 0 {\displaystyle 0\parallel (-0)=0\parallel 0} can either be left undefined (see indeterminate form) or defined to equal 0.

Precedence

In the absence of parentheses, the parallel operator is defined as taking precedence over addition or subtraction, similar to multiplication.

Applications

There are applications of the parallel operator in mechanics, electronics, optics, and study of periodicity:

Reduced mass

Given masses m and M, the reduced mass μ = m M m + M = m ∥ M {\displaystyle \mu ={\frac {mM}{m+M}}=m\parallel M} is frequently applied in mechanics. For instance, when the masses orbit each other, the moment of inertia is their reduced mass times the distance between them.

Circuit analysis

In electrical engineering, the parallel operator can be used to calculate the total impedance of various serial and parallel electrical circuits. There is a duality between the usual (series) sum and the parallel sum.

For instance, the total resistance of resistors connected in parallel is the reciprocal of the sum of the reciprocals of the individual resistors.

1 R eq = 1 R 1 + 1 R 2 + ⋯ + 1 R n R eq = R 1 ∥ R 2 ∥ ⋯ ∥ R n . {\displaystyle {\begin{aligned}{\frac {1}{R_{\text{eq}}}}&={\frac {1}{R_{1}}}+{\frac {1}{R_{2}}}+\cdots +{\frac {1}{R_{n}}}\\[5mu]R_{\text{eq}}&=R_{1}\parallel R_{2}\parallel \cdots \parallel R_{n}.\end{aligned}}}

Likewise for the total capacitance of serial capacitors.

Coalescence of independent probability density functions.

The coalesced density function fcoalesced(x) of n independent probability density functions f1(x), f2(x), …, fn(x), is equal to the reciprocal of the sum of the reciprocal densities.

1 f c o a l e s c e d ( x ) = 1 f 1 ( x ) + 1 f 2 ( x ) + ⋯ + 1 f n ( x ) {\displaystyle {\begin{aligned}{\frac {1}{f_{coalesced}(x)}}&={\frac {1}{f_{1}(x)}}+{\frac {1}{f_{2}(x)}}+\cdots +{\frac {1}{f_{n}(x)}}\\[5mu]\end{aligned}}}

Lens equation

In geometric optics the thin lens approximation to the lens maker's equation.

f = ρ v i r t u a l ∥ ρ o b j e c t {\displaystyle f=\rho _{virtual}\parallel \rho _{object}}

Synodic period

The time between conjunctions of two orbiting bodies is called the synodic period. If the period of the slower body is T2, and the period of the faster is T1, then the synodic period is

T s y n = T 1 ∥ ( − T 2 ) . {\displaystyle T_{syn}=T_{1}\parallel (-T_{2}).}

Examples

Question:

Three resistors R 1 = 270 k Ω {\displaystyle R_{1}=270\,\mathrm {k\Omega } }, R 2 = 180 k Ω {\displaystyle R_{2}=180\,\mathrm {k\Omega } } and R 3 = 120 k Ω {\displaystyle R_{3}=120\,\mathrm {k\Omega } } are connected in parallel. What is their resulting resistance?

Answer:

R 1 ∥ R 2 ∥ R 3 = 270 k Ω ∥ 180 k Ω ∥ 120 k Ω = 1 1 270 k Ω + 1 180 k Ω + 1 120 k Ω ≈ 56.84 k Ω {\displaystyle {\begin{aligned}R_{1}\parallel R_{2}\parallel R_{3}&=270\,\mathrm {k\Omega } \parallel 180\,\mathrm {k\Omega } \parallel 120\,\mathrm {k\Omega } \\[5mu]&={\frac {1}{{\dfrac {1}{270\,\mathrm {k\Omega } }}+{\dfrac {1}{180\,\mathrm {k\Omega } }}+{\dfrac {1}{120\,\mathrm {k\Omega } }}}}\\[5mu]&\approx 56.84\,\mathrm {k\Omega } \end{aligned}}}

The effectively resulting resistance is ca. 57 kΩ.

Question:

A construction worker raises a wall in 5 hours. Another worker would need 7 hours for the same work. How long does it take to build the wall if both workers work in parallel?

Answer:

t 1 ∥ t 2 = 5 h ∥ 7 h = 1 1 5 h + 1 7 h ≈ 2.92 h {\displaystyle t_{1}\parallel t_{2}=5\,\mathrm {h} \parallel 7\,\mathrm {h} ={\frac {1}{{\dfrac {1}{5\,\mathrm {h} }}+{\dfrac {1}{7\,\mathrm {h} }}}}\approx 2.92\,\mathrm {h} }

They will finish in close to 3 hours.

Implementation

WP 34S with parallel operator (∥) on the g+÷ key

Suggested already by Kent E. Erickson as a subroutine in digital computers in 1959, the parallel operator is implemented as a keyboard operator on the Reverse Polish Notation (RPN) scientific calculators WP 34S since 2008 as well as on the WP 34C and WP 43S since 2015, allowing to solve even cascaded problems with few keystrokes like 270↵ Enter180∥120∥.

Projective view

Given a field F there are two embeddings of F into the projective line P(F): z → [z : 1] and z → [1 : z]. These embeddings overlap except for [0:1] and [1:0]. The parallel operator relates the addition operation between the embeddings. In fact, the homographies on the projective line are represented by 2 x 2 matrices M(2,F), and the field operations (+ and ×) are extended to homographies. Each embedding has its addition a + b represented by the following matrix multiplications in M(2,A):

( 1 0 a 1 ) ( 1 0 b 1 ) = ( 1 0 a + b 1 ) , ( 1 a 0 1 ) ( 1 b 0 1 ) = ( 1 a + b 0 1 ) . {\displaystyle {\begin{aligned}{\begin{pmatrix}1&0\\a&1\end{pmatrix}}{\begin{pmatrix}1&0\\b&1\end{pmatrix}}&={\begin{pmatrix}1&0\\a+b&1\end{pmatrix}},\\[10mu]{\begin{pmatrix}1&a\\0&1\end{pmatrix}}{\begin{pmatrix}1&b\\0&1\end{pmatrix}}&={\begin{pmatrix}1&a+b\\0&1\end{pmatrix}}.\end{aligned}}}

The two matrix products show that there are two subgroups of M(2,F) isomorphic to (F,+), the additive group of F. Depending on which embedding is used, one operation is +, the other is ∥ . {\displaystyle \parallel .}

See also

Notes

Further reading

External links