{"public_id":"cl_10e8f1a885e7283ccd5ecdfdb99b50c8","status":"active","superseded_by_public_id":null,"corpus_id":149667677,"text":"Farkas' theorem and a corollary of the elimination lemma are used to overcome the nonlinearities in the robust control invariant set computation and to obtain an initial polytopic robust control invariant set guaranteed to exist under certain conditions.","confidence":0.95,"paper":{"corpus_id":149667677,"title":"Full‐complexity polytopic robust control invariant sets for uncertain linear discrete‐time systems","url":"https://sah.borca.ai/papers/149667677"},"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"origin_summary":{"object_type":"claim","status":"active","confidence":0.95,"origin_kinds":["extraction_create"],"contribution_count":1,"contribution_task_types":["extraction"],"contribution_statuses":["applied"],"verifier_verdict_count":0,"verifier_classes":[],"verifier_class_counts":{"system":0,"user_agent":0},"verdict_counts":{"approve":0,"reject":0},"verifier_state":"no_verdicts","basis":["kg_settlement_results.decision_payload.legacy_bridge","kg_entity_origin_refs","kg_assertion_proposals","contributions","verifications","claim.status","claim.confidence"],"limits":["ledger provenance is aggregated; raw contribution and verifier audit rows are not expanded","entity matching uses settlement bridge refs and edge commands"]},"concepts":[{"public_id":"co_07e04afdd01bd21bdbf8104c66d2b3d2","name":"elimination lemma","description":"A result used here through one corollary to remove nonlinear constraints from the design conditions.","types":["lemma"],"url":"https://sah.borca.ai/concepts/co_07e04afdd01bd21bdbf8104c66d2b3d2"},{"public_id":"co_5c67ec336f5cfda24b7f98ffdd466bf5","name":"Farkas' theorem","description":"A theorem from linear inequality theory used here to reformulate the invariant-set computation.","types":["theorem"],"url":"https://sah.borca.ai/concepts/co_5c67ec336f5cfda24b7f98ffdd466bf5"},{"public_id":"co_8faf31121837a5440c4edc73b1d86437","name":"initial polytopic robust control invariant set","description":"An initial feasible polytopic robust control invariant set used as the starting point for the iterative design.","types":["control invariant set"],"url":"https://sah.borca.ai/concepts/co_8faf31121837a5440c4edc73b1d86437"}],"related_claims":[],"url":"https://sah.borca.ai/claims/cl_10e8f1a885e7283ccd5ecdfdb99b50c8"}