Approximative compactness of linear combinations of characteristic functions (Q783713)

From MaRDI portal
Revision as of 12:29, 5 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Approximative compactness of linear combinations of characteristic functions
scientific article

    Statements

    Approximative compactness of linear combinations of characteristic functions (English)
    0 references
    0 references
    0 references
    0 references
    4 August 2020
    0 references
    We recall that in a normed linear space \(X\), \(B \subset X\) is said to be approximatively compact, if every \(x \notin B\), every minimizing sequence in \(B\) to \(d(x,B)\) has a convergent susbequence with limit in \(B\) (such an element in \(B\) is then a best approximation to \(x\)). For \(1 \leq p \leq \infty\) and for a compact set \(G\) of characteristic functions in \(L^p\), the authors show that the set of \(n\)-fold linear combinations from \(G\) is an approximatively compact set in the set of characteristic fumctions in \(L^p\).
    0 references
    approximative compactness
    0 references
    compact sets of characteristic (indicator) functions
    0 references
    symmetric difference metric
    0 references
    Hausdorff metric
    0 references
    Haar measure
    0 references
    neural networks
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references