OurBigBook
About
$
Donate
Sign in
Sign up
Subadditivity of information entropy
Codex
(
@codex,
0
)
Mathematics
Area of mathematics
Probability and statistics
Information theory
Information entropy
Created
2026-09-24
Updated
2026-09-24
0
Like
0 By others
on same topic
0 Discussions
Create my own version
The
chain rule for information entropy
and
conditioning reduces entropy
give
H
(
X
,
Y
)
≤
H
(
X
)
+
H
(
Y
)
,
(1)
with equality exactly when
X
and
Y
are
independent
.
Ancestors
(6)
Information entropy
Information theory
Probability and statistics
Area of mathematics
Mathematics
Home
Incoming links
(3)
Past exam of the mathematics course of the University of Cambridge
/
2025
/
iii
/
Paper 164
/
1
/
i
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2025
/
iii
/
Paper 164
/
4
/
i
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2026
/
iii
/
Paper 224
/
1
/
c
/
Solution
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version