2021International Journal of Computers Communications & ControlOpen access

Entropic Explanation of Power Set

Yutong Song, Yong Deng

Open full text 65 citations

Abstract

A power set of a set S is defined as the set of all subsets of S, including set S itself and empty set, denoted as P(S) or 2S. Given a finite set S with |S|=n hypothesis, one property of power set is that the amount of subsets of S is |P(S)| = 2n. However, the physica meaning of power set needs exploration. To address this issue, a possible explanation of power set is proposed in this paper. A power set of n events can be seen as all possible k-combination, where k ranges from 0 to n. It means the power set extends the event space in probability theory into all possible combination of the single basic event. From the view of power set, all subsets or all combination of basic events, are created equal. These subsets are assigned with the mass function, whose uncertainty can be measured by Deng entropy. The relationship between combinatorial number, Pascal's triangle and power set is revealed by Deng entropy quantitively from the view of information measure.

Open-access reader

About this research paper

What this paper is about

A power set of a set S is defined as the set of all subsets of S, including set S itself and empty set, denoted as P(S) or 2S. Given a finite set S with |S|=n hypothesis, one property of power set is that the amount of subsets of S is |P(S)| = 2n. However, the physica meaning of power set needs exploration. To address this issue, a possible explanation of power set is proposed in this paper. A power set of n events can be seen as all possible k-combination, where k ranges from 0 to n. It means the power set extends the event space in probability theory into all possible combination of the single basic event. From the view of power set, all subsets or all combination of basic events, are created equal. These subsets are assigned with the mass function, whose uncertainty can be measured by Deng entropy. The relationship between combinatorial number, Pascal's triangle and power set is revealed by Deng entropy quantitively from the view of information measure.

Why it matters

OpenAlex reports 65 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A power set of a set S is defined as the set of all subsets of S, including set S itself and empty set, denoted as P(S) or 2S. Given a finite set S with |S|=n hypothesis, one property of power set is that the amount of subsets of S is |P(S)| = 2n. However, the physica meaning of power set needs exploration. To address this issue, a possible explanation of power set is proposed in this paper. A power set of n events can be seen as all possible k-combination, where k ranges from 0 to n. It means the power set extends the event space in probability theory into all possible combination of the single basic event. From the view of power set, all subsets or all combination of basic events, are created equal. These subsets are assigned with the mass function, whose uncertainty can be measured by Deng entropy. The relationship between combinatorial number, Pascal's triangle and power set is revealed by Deng entropy quantitively from the view of information measure.

Key concepts: Power set, Set function, Set (abstract data type), Mathematics, Discrete mathematics, Entropy (arrow of time), Combinatorics, Event (particle physics)

Related papers

Back to paper searchBrowse research topicsOriginal source
Entropic Explanation of Power Set — Research Paper | ScholarLens