{'fraction_non_alphanumeric': 0.032448377581120944, 'fraction_numerical': 0.0029498525073746312, 'mean_word_length': 3.9562043795620436, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Compactness and convexity of cores of targets for neutral systems

In this paper we prove the convexity and the compactness of the cores of targets for neutral control systems. We make use of a weak compactness argument; but in the crucial part where we establish the boundeduess of the cores of the target we make use of the notion of asymptotic direction from convex Set Theory. Let En be n-dimensional Euclidean space. We prove that the core of the target H = L + E (where L = {x ∈ En | Mx = 0}, M is a constant in m × n matrix and E is a compact, convex set containing 0) of the neutral system is convex, and is compact if, and only if, the system is Euclidean controllable.