How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Density-defined Jensen–Shannon divergence
Definition
In the common-density setting, put . Additivity and nonnegative homogeneity of the integral give . Define and where , and define where ; then and wherever . Let and for . The density-defined Jensen–Shannon divergence is
The integrals are finite, and this formula is the average of the two density-relative-entropy terms from and to the mixture density .
Definition references
Common-density setting and probability laws
Lebesgue integrability of signed functions
Coordinatewise measurability into Euclidean space
Measurability of arithmetic and products
Additivity of the nonnegative integral
Nonnegative homogeneity of the integral
Goodfellow et al., §4.1, equations (5)–(6), complete 9-page paper
Depends on
- GAN minimax objective and its distributional domain
- Integrable real and complex functions, and their integrals
- The natural logarithm as the inverse of the exponential function
- A map into $\mathbb{R}^n$ is measurable exactly when its coordinates are measurable
- Composition with a Borel measurable outer map preserves measurability
- Arithmetic and lattice operations preserve measurability whenever they are defined
- Closure properties of measurable functions used by the integral
- Additivity of the nonnegative Lebesgue integral
- Monotonicity and nonnegative homogeneity of the nonnegative integral
Used by
Dependency tree · two levels
35 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Ian J. Goodfellow et al., Generative Adversarial Nets, arXiv:1406.2661v1 (standard reference, not scraped)
- Yingzhen Li, Lecture notes on generative adversarial networks (GANs), Deep Learning (Winter 2022, Imperial College London) (standard reference, not scraped)