Approximative compactness of linear combinations of characteristic functions (Q783713): Difference between revisions

From MaRDI portal
Normalize DOI.
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1016/J.JAT.2020.105435 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.JAT.2020.105435 / rank
 
Normal rank

Latest revision as of 03:33, 10 December 2024

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
    0 references