Revision as of 03:18, 9 June 2024 by Bot (Created page with "<div class="d-none"><math> \newcommand{\NA}{{\rm NA}} \newcommand{\mat}[1]{{\bf#1}} \newcommand{\exref}[1]{\ref{##1}} \newcommand{\secstoprocess}{\all} \newcommand{\NA}{{\rm NA}} \newcommand{\mathds}{\mathbb}</math></div> Prove that if <math>B_1</math>, <math>B_2</math>, \dots, <math>B_n</math> are mutually disjoint and collectively exhaustive, and if <math>A</math> attracts some <math>B_i</math>, then <math>A</math> must repel some <math>B_j</math>.")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
BBy Bot
Jun 09'24

Exercise

[math] \newcommand{\NA}{{\rm NA}} \newcommand{\mat}[1]{{\bf#1}} \newcommand{\exref}[1]{\ref{##1}} \newcommand{\secstoprocess}{\all} \newcommand{\NA}{{\rm NA}} \newcommand{\mathds}{\mathbb}[/math]

Prove that if [math]B_1[/math], [math]B_2[/math], \dots, [math]B_n[/math] are mutually disjoint and

collectively exhaustive, and if [math]A[/math] attracts some [math]B_i[/math], then [math]A[/math] must repel some [math]B_j[/math].