// Numbas version: exam_results_page_options
{"name": "Find characteristic polynomial, eigenvalues and eigenvectors of a 2x2 matrix", "extensions": ["linear-algebra", "linalg2"], "custom_part_types": [{"source": {"pk": 2, "author": {"name": "Christian Lawson-Perfect", "pk": 7}, "edit_page": "/part_type/2/edit"}, "name": "List of numbers", "short_name": "list-of-numbers", "description": "<p>The answer is a comma-separated list of numbers.</p>\n<p>The list is marked correct if each number occurs the same number of times as in the expected answer, and no extra numbers are present.</p>\n<p>You can optionally treat the answer as a set, so the number of occurrences doesn't matter, only whether each number is included or not.</p>", "help_url": "", "input_widget": "string", "input_options": {"correctAnswer": "join(\n  if(settings[\"correctAnswerFractions\"],\n    map(let([a,b],rational_approximation(x), string(a/b)),x,settings[\"correctAnswer\"])\n  ,\n    settings[\"correctAnswer\"]\n  ),\n  settings[\"separator\"] + \" \"\n)", "hint": {"static": false, "value": "if(settings[\"show_input_hint\"],\n  \"Enter a list of numbers separated by <code>{settings['separator']}</code>.\",\n  \"\"\n)"}, "allowEmpty": {"static": true, "value": true}}, "can_be_gap": true, "can_be_step": true, "marking_script": "bits:\nlet(b,filter(x<>\"\",x,split(studentAnswer,settings[\"separator\"])),\n    if(isSet,list(set(b)),b)\n)\n\nexpected_numbers:\nlet(l,settings[\"correctAnswer\"] as \"list\",\n    if(isSet,list(set(l)),l)\n)\n\nvalid_numbers:\nif(all(map(not isnan(x),x,interpreted_answer)),\n    true,\n    let(index,filter(isnan(interpreted_answer[x]),x,0..len(interpreted_answer)-1)[0], wrong, bits[index],\n      warn(wrong+\" is not a valid number\");\n      fail(wrong+\" is not a valid number.\")\n    )\n  )\n\nis_sorted:\nassert(sort(interpreted_answer)=interpreted_answer,\n    multiply_credit(0.5,\"Not in order\")\n  )\n\nincluded:\nmap(\n      let(\n        num_student,len(filter(x=y,y,interpreted_answer)),\n        num_expected,len(filter(x=y,y,expected_numbers)),\n        switch(\n          num_student=num_expected,\n            true,\n          num_student<num_expected,\n            incorrect(\n              if(isSet,\"Your answer does not contain \"+x+\" but should.\",\n                \"Your answer does not contain \"+x+\" enough times.\"\n              )\n            );false\n          ,\n            incorrect(\n              if(isSet,\"Your answer contains \"+x+\" but should not.\",\n                \"Your answer contains \"+x+\" too many times.\"\n              )\n            );false\n        )\n      )\n      ,\n      x,\n      sort(list(set(expected_numbers)))\n  )\n\nall_included:\nall(included)\n\nno_extras:\nif(all(map(x in expected_numbers, x, interpreted_answer)),\n    true\n  ,\n    incorrect(\"Your answer contains \"+extra_numbers[0]+\" but should not.\");\n    false\n  )\n\ninterpreted_answer:\nif(lower(studentAnswer) in [\"empty\",\"\u2205\"],[],\n  map(\n    if(settings[\"allowFractions\"],parsenumber_or_fraction(x,notationStyles), parsenumber(x,notationStyles))\n    ,x\n    ,bits\n  )\n)\n\nmark:\nif(studentanswer=\"\",fail(\"You have not entered an answer\"),false);\napply(valid_numbers);\napply(included);\napply(no_extras);\ncorrectif(all_included and no_extras)\n\nnotationStyles:\n[\"en\"]\n\nisSet:\nsettings[\"isSet\"]\n\nextra_numbers:\nfilter(not (x in expected_numbers),x,interpreted_answer)", "marking_notes": [{"name": "bits", "description": "<p>The separate items in the student's answer</p>", "definition": "let(b,filter(x<>\"\",x,split(studentAnswer,settings[\"separator\"])),\n    if(isSet,list(set(b)),b)\n)"}, {"name": "expected_numbers", "description": "", "definition": "let(l,settings[\"correctAnswer\"] as \"list\",\n    if(isSet,list(set(l)),l)\n)"}, {"name": "valid_numbers", "description": "<p>Is every number in the student's list valid?</p>", "definition": "if(all(map(not isnan(x),x,interpreted_answer)),\n    true,\n    let(index,filter(isnan(interpreted_answer[x]),x,0..len(interpreted_answer)-1)[0], wrong, bits[index],\n      warn(wrong+\" is not a valid number\");\n      fail(wrong+\" is not a valid number.\")\n    )\n  )"}, {"name": "is_sorted", "description": "<p>Are the student's answers in ascending order?</p>", "definition": "assert(sort(interpreted_answer)=interpreted_answer,\n    multiply_credit(0.5,\"Not in order\")\n  )"}, {"name": "included", "description": "<p>Is each number in the expected answer present in the student's list the correct number of times?</p>", "definition": "map(\n      let(\n        num_student,len(filter(x=y,y,interpreted_answer)),\n        num_expected,len(filter(x=y,y,expected_numbers)),\n        switch(\n          num_student=num_expected,\n            true,\n          num_student<num_expected,\n            incorrect(\n              if(isSet,\"Your answer does not contain \"+x+\" but should.\",\n                \"Your answer does not contain \"+x+\" enough times.\"\n              )\n            );false\n          ,\n            incorrect(\n              if(isSet,\"Your answer contains \"+x+\" but should not.\",\n                \"Your answer contains \"+x+\" too many times.\"\n              )\n            );false\n        )\n      )\n      ,\n      x,\n      sort(list(set(expected_numbers)))\n  )"}, {"name": "all_included", "description": "<p>Has every number been included the right number of times?</p>", "definition": "all(included)"}, {"name": "no_extras", "description": "<p>True if the student's list doesn't contain any numbers that aren't in the expected answer.</p>", "definition": "if(all(map(x in expected_numbers, x, interpreted_answer)),\n    true\n  ,\n    incorrect(\"Your answer contains \"+extra_numbers[0]+\" but should not.\");\n    false\n  )"}, {"name": "interpreted_answer", "description": "A value representing the student's answer to this part.", "definition": "if(lower(studentAnswer) in [\"empty\",\"\u2205\"],[],\n  map(\n    if(settings[\"allowFractions\"],parsenumber_or_fraction(x,notationStyles), parsenumber(x,notationStyles))\n    ,x\n    ,bits\n  )\n)"}, {"name": "mark", "description": "This is the main marking note. It should award credit and provide feedback based on the student's answer.", "definition": "if(studentanswer=\"\",fail(\"You have not entered an answer\"),false);\napply(valid_numbers);\napply(included);\napply(no_extras);\ncorrectif(all_included and no_extras)"}, {"name": "notationStyles", "description": "", "definition": "[\"en\"]"}, {"name": "isSet", "description": "<p>Should the answer be considered as a set, so the number of times an element occurs doesn't matter?</p>", "definition": "settings[\"isSet\"]"}, {"name": "extra_numbers", "description": "<p>Numbers included in the student's answer that are not in the expected list.</p>", "definition": "filter(not (x in expected_numbers),x,interpreted_answer)"}], "settings": [{"name": "correctAnswer", "label": "Correct answer", "help_url": "", "hint": "The list of numbers that the student should enter. The order does not matter.", "input_type": "code", "default_value": "", "evaluate": true}, {"name": "allowFractions", "label": "Allow the student to enter fractions?", "help_url": "", "hint": "", "input_type": "checkbox", "default_value": false}, {"name": "correctAnswerFractions", "label": "Display the correct answers as fractions?", "help_url": "", "hint": "", "input_type": "checkbox", "default_value": false}, {"name": "isSet", "label": "Is the answer a set?", "help_url": "", "hint": "If ticked, the number of times an element occurs doesn't matter, only whether it's included at all.", "input_type": "checkbox", "default_value": false}, {"name": "show_input_hint", "label": "Show the input hint?", "help_url": "", "hint": "", "input_type": "checkbox", "default_value": true}, {"name": "separator", "label": "Separator", "help_url": "", "hint": "The substring that should separate items in the student's list", "input_type": "string", "default_value": ",", "subvars": false}], "public_availability": "always", "published": true, "extensions": []}], "resources": [], "navigation": {"allowregen": true, "showfrontpage": false, "preventleave": false, "typeendtoleave": false}, "question_groups": [{"pickingStrategy": "all-ordered", "questions": [{"name": "Find characteristic polynomial, eigenvalues and eigenvectors of a 2x2 matrix", "tags": ["characteristic polynomial", "eigenvalue", "eigenvector", "explore mode", "Linear algebra", "Linear Algebra", "linear algebra"], "metadata": {"description": "<p>Example of an explore mode question. Student is given a 2x2 matrix and is asked to find the characteristic polynomial and eigenvalues, and then eigenvectors for each eigenvalue. The part asking for eigenvectors can be repeated as often as the student wants, to be used for different eigenvalues.</p>\n<p>Assessed: calculating characteristic polynomial and eigenvectors.</p>\n<p>Feature: any correct eigenvector is recognised by the marking algorithm, also multiples of the \"obvious\" one(s) (given the reduced row echelon form that we use to calculate them).</p>\n<p>Randomisation: a random true/false for invertibility is created, and the eigenvalues a and b are randomised (condition: two different evalues, and a=0 iff invertibility is false), and a random invertible 2x2 matrix with determinant 1 or -1 is created (via random elementary row operations) to change base from diag(a,b) to the matrix for the question. Determinant 1 or -1 ensures that we keep integer entries.</p>\n<p>The implementation uses linear algebra functions such as \"find reduced echelon form\" or \"find kernel of a reduced echelon form\", from the extension \"linalg2\".</p>", "licence": "Creative Commons Attribution 4.0 International"}, "statement": "<p>Find the characteristic polynomial, eigenvalues and eigenvectors (bases for eigenspaces) for the matrix \\(\\var[fractionNumbers]{matrixA}\\).</p>", "advice": "<p>The characteristic polynomial of \\(A\\) is defined as \\(\\chi_A(t)=\\det(tI-A)\\). So in this case you should calculate</p>\n<p>\\[\\begin{vmatrix} \\simplify{t-{matrixA[0][0]}} &amp; \\var{-matrixA[0][1]} \\\\ \\var{-matrixA[1][0]} &amp; \\simplify{t-{matrixA[1][1]}} \\end{vmatrix}=\\simplify[!zeroterm]{(t-{matrixA[0][0]})(t-{matrixA[1][1]})-{matrixA[0][1]*matrixA[1][0]}}=\\var{chiAexpanded}= \\var[timesdot]{chiA}.\\]</p>\n<p>You can use the formula for the determinant a \\(2\\times 2\\) matrix:\\( \\begin{vmatrix}a&amp;b\\\\c&amp;d\\end{vmatrix}=ad-bc\\).</p>\n<p>The eigenvalues are exactly the roots of the characteristic polynomial. So the eigenvalues of \\(A\\) are \\(\\var{a}\\) and \\(\\var{b}\\).</p>\n<p>To calculate the eigenvectors for a given eigenvalue \\(\\lambda\\), we calculate the kernel of \\(A-\\lambda I\\).</p>\n<p>So, for \\(\\lambda=\\var{a}\\), we calculate the kernel of \\(\\var{matrixA-a*id(2)}\\), using the Gauss-Jordan algorithm.</p>\n<p><span data-jme-visible=\"matrixA[0][0]-a&lt;&gt;0\">\\[ \\begin{pmatrix} \\var{matrixA[0][0]-a} &amp; \\var{matrixA[0][1]} \\\\ \\var{matrixA[1][0]}&amp; \\var{matrixA[1][1]-a} \\end{pmatrix} \\to \\begin{pmatrix}1 &amp; \\var[fractionNumbers]{matrixA[0][1]/(matrixA[0][0]-a)} \\\\ \\var{matrixA[1][0]}&amp; \\var{matrixA[1][1]-a} \\end{pmatrix} \\to \\var[fractionNumbers]{RREFa}\\]</span> <span data-jme-visible=\"matrixA[0][0]-a=0\">\\[ \\begin{pmatrix} \\var{matrixA[0][0]-a} &amp; \\var{matrixA[0][1]} \\\\ \\var{matrixA[1][0]}&amp; \\var{matrixA[1][1]-a} \\end{pmatrix} \\to \\begin{pmatrix}0 &amp; 1\\\\ \\var{matrixA[1][0]}&amp; \\var{matrixA[1][1]-a} \\end{pmatrix} \\to \\var[fractionNumbers]{RREFa} \\]</span></p>\n<p>The reduced row echelon form is \\(\\var[fractionNumbers]{RREFa}\\). If we write the eigenvector as \\(\\begin{pmatrix}x\\\\y\\end{pmatrix}\\), this means that we have \\(\\simplify[fractionNumbers, timesdot,all]{{RREFa[0][0]}*x+{RREFa[0][1]}*y=0}\\). <span data-jme-visible=\"RREFa[0][0]&lt;&gt;0\">We can choose \\(y=1\\)<span data-jme-visible=\"RREFa[0][1]&lt;&gt;0\">, which gives us \\(x=\\var[fractionNumbers]{-RREFa[0][1]}\\)</span>.</span> <span data-jme-visible=\"RREFa[0][0]=0\">But \\(x\\) can be any number, and we can choose it to be \\(1\\).</span> So the eigenvector for \\(\\lambda=\\var{a}\\) is \\(\\var[fractionNumbers]{v1}\\) (or any multiple of this).</p>\n<p>And for \\(\\lambda=\\var{b}\\), the reduced row echelon form of \\(\\var{matrixA-b*id(2)}\\) is \\(\\var[fractionNumbers]{RREFb}\\). If we write the eigenvector as \\(\\begin{pmatrix}x\\\\y\\end{pmatrix}\\) again, this means that we have \\(\\simplify[fractionNumbers, timesdot,all]{{RREFb[0][0]}*x+{RREFb[0][1]}*y=0}\\). <span data-jme-visible=\"RREFb[0][0]&lt;&gt;0\">We can choose \\(y=1\\)<span data-jme-visible=\"RREFb[0][1]&lt;&gt;0\">, which gives us \\(x=\\var[fractionNumbers]{-RREFb[0][1]}\\)</span>.</span> <span data-jme-visible=\"RREFb[0][0]=0\">But \\(x\\) can be any number, and we can choose it to be \\(1\\).</span> So the eigenvector is \\(\\var[fractionNumbers]{v2}\\) (or any multiple).</p>", "rulesets": {}, "extensions": ["linalg2", "linear-algebra"], "builtin_constants": {"e": true, "pi,\u03c0": true, "i": true}, "constants": [], "variables": {"matrixA": {"name": "matrixA", "group": "Getting the matrix", "definition": "Pinverse*matrix([a,0],[0,b])*P", "description": "<p>The matrix is calculated from a diagonal matrix by base change. This ensures we have the correct characteristic polynomial and eigenvalues. To get integer entries, we ensure that det P = 1 or -1. (see variable testing condition)</p>", "templateType": "anything", "can_override": false}, "a": {"name": "a", "group": "Eigenvalues", "definition": "random(-5..5)", "description": "<p>Picking between 0 as eigenvalue and a non-zero eigenvalue</p>", "templateType": "anything", "can_override": false}, "b": {"name": "b", "group": "Eigenvalues", "definition": "random(-5..5  except 0 )", "description": "<p>Second eigenvalue should not be the same as the first, because otherwise the matrix is just a multiple of the identity, which is too easy. This is ensured by a variable testing condition.</p>", "templateType": "anything", "can_override": false}, "chiA": {"name": "chiA", "group": "Characteristic polynomial", "definition": "simplify(expression(\"(t-{a})*(t-{b})\"),\"all\")", "description": "<p>The characteristic polynomial in factorised form.</p>", "templateType": "anything", "can_override": false}, "v1": {"name": "v1", "group": "Getting the matrix", "definition": "matrix(le_row_shuffle(id(n),2,5))", "description": "<p>This is a base change matrix which is used to calculate the matrix A. The function le_row_shuffle is in the Leicester extension \"linalg2\", and performs some random elementary row operations on the identity matrix to get a random invertible matrix. The testing condition ensures that the determinant of this matrix is 1 or -1, so that the matrix A will have integer entries.</p>", "templateType": "anything", "can_override": false}, "v2": {"name": "v2", "group": "Eigenvectors and their calculation", "definition": "transpose(matrix(le_kernel(RREFb)))", "description": "<p>Eigenvector for eigenvalue b. The function \"le_kernel\" gives the kernel of a reduced row echelon form as a row, so we tranpose it to get the vector.</p>", "templateType": "anything", "can_override": false}, "RREFa": {"name": "RREFa", "group": "Eigenvectors and their calculation", "definition": "matrix(reduced_row_echelon_form(matrixA-a*id(n)))", "description": "<p>Reduced row echelon form of \\(A-a I\\). The kernel of \\(A-aI\\) gives the eigenvectors for eigevalue a. This reduced row echelon form is automatically calculated by the extension \"Linear algebra\".</p>", "templateType": "anything", "can_override": false}, "RREFb": {"name": "RREFb", "group": "Eigenvectors and their calculation", "definition": "matrix(reduced_row_echelon_form(matrixA-b*id(n)))", "description": "<p>Reduced row echelon form of \\(A-b I\\). The kernel of \\(A-bI\\) gives the eigenvectors for eigevalue b. This reduced row echelon form is automatically calculated by the extension \"Linear algebra\".</p>", "templateType": "anything", "can_override": false}, "n": {"name": "n", "group": "Getting the matrix", "definition": "2", "description": "<p>The matrix has size \\(n\\times n\\). Mostly this is here because I copied much of the implementation over to use for \\(3\\times 3\\) matrices as well, and maybe bigger. That means one doesn't have to change the \\(n\\) everywhere, only once.</p>", "templateType": "anything", "can_override": false}, "chiAexpanded": {"name": "chiAexpanded", "group": "Characteristic polynomial", "definition": "simplify(expression(\"(t-{a})*(t-{b})\"),[\"expandBrackets\",\"all\"])", "description": "<p>The characteristic polynomial in expanded form, so we can use it in Advice.</p>", "templateType": "anything", "can_override": false}, "detP": {"name": "detP", "group": "Getting the matrix", "definition": "det(P)", "description": "<p>Determinant of P, to use in testing condition (and in calculating the inverse).</p>", "templateType": "anything", "can_override": false}, "Pinverse": {"name": "Pinverse", "group": "Getting the matrix", "definition": "1/detP*matrix([P[1][1],-P[0][1]],[-P[1][0],P[0][0]])", "description": "<p>This is the inverse of the base change matrix P, which we also need to calculate the matrix A.</p>", "templateType": "anything", "can_override": false}, "testinverse": {"name": "testinverse", "group": "Getting the matrix", "definition": "P*Pinverse=id(n)", "description": "<p>Just so we can visually ensure ourselves that we have really calculated the inverse of P :-)</p>", "templateType": "anything", "can_override": false}, "p": {"name": "p", "group": "Ungrouped variables", "definition": "", "description": "", "templateType": "anything", "can_override": false}}, "variablesTest": {"condition": "(detP=1 or detP=-1) and a<>b", "maxRuns": "100"}, "ungrouped_variables": ["p"], "variable_groups": [{"name": "Eigenvalues", "variables": ["a", "b"]}, {"name": "Getting the matrix", "variables": ["n", "v1", "Pinverse", "testinverse", "detP", "matrixA"]}, {"name": "Characteristic polynomial", "variables": ["chiA", "chiAexpanded"]}, {"name": "Eigenvectors and their calculation", "variables": ["RREFa", "RREFb", "v1", "v2"]}], "functions": {}, "preamble": {"js": "", "css": ""}, "parts": [{"type": "gapfill", "useCustomName": true, "customName": "Char poly", "marks": 0, "scripts": {}, "customMarkingAlgorithm": "", "extendBaseMarkingAlgorithm": true, "unitTests": [], "showCorrectAnswer": true, "showFeedbackIcon": true, "variableReplacements": [], "variableReplacementStrategy": "originalfirst", "nextParts": [{"label": "Find eigenvalues", "rawLabel": "Find eigenvalues", "otherPart": 1, "variableReplacements": [], "availabilityCondition": "answered and credit=1", "penalty": "", "penaltyAmount": 0, "lockAfterLeaving": true}], "suggestGoingBack": false, "adaptiveMarkingPenalty": 0, "exploreObjective": null, "prompt": "<p>The characteristic polynomial is \\(\\chi_A(t)= \\) [[0]]</p>", "gaps": [{"type": "jme", "useCustomName": true, "customName": "char_A", "marks": 1, "scripts": {}, "customMarkingAlgorithm": "", "extendBaseMarkingAlgorithm": true, "unitTests": [], "showCorrectAnswer": true, "showFeedbackIcon": true, "variableReplacements": [], "variableReplacementStrategy": "originalfirst", "nextParts": [], "suggestGoingBack": false, "adaptiveMarkingPenalty": 0, "exploreObjective": null, "answer": "{chiA}", "showPreview": true, "checkingType": "absdiff", "checkingAccuracy": 0.001, "failureRate": 1, "vsetRangePoints": 5, "vsetRange": [0, 1], "checkVariableNames": false, "singleLetterVariables": false, "allowUnknownFunctions": true, "implicitFunctionComposition": false, "caseSensitive": false, "valuegenerators": []}], "sortAnswers": false}, {"type": "gapfill", "useCustomName": true, "customName": "eigenvalues", "marks": 0, "scripts": {}, "customMarkingAlgorithm": "", "extendBaseMarkingAlgorithm": true, "unitTests": [], "showCorrectAnswer": true, "showFeedbackIcon": true, "variableReplacements": [], "variableReplacementStrategy": "originalfirst", "nextParts": [{"label": "Find eigenvectors", "rawLabel": "Find eigenvectors", "otherPart": 2, "variableReplacements": [], "availabilityCondition": "answered and credit=1", "penalty": "", "penaltyAmount": 0, "lockAfterLeaving": true}], "suggestGoingBack": false, "adaptiveMarkingPenalty": 0, "exploreObjective": null, "prompt": "<p>The eigenvalues of \\(A\\) are (in any order): [[0]]</p>", "gaps": [{"type": "list-of-numbers", "useCustomName": true, "customName": "eigenvalues", "marks": 1, "scripts": {}, "customMarkingAlgorithm": "included:\nmap(\n      let(\n        num_student,len(filter(x=y,y,interpreted_answer)),\n        num_expected,len(filter(x=y,y,expected_numbers)),\n        switch(\n          num_student=num_expected,\n            true,\n          num_student<num_expected,\n            incorrect(\"You are missing some numbers.\");\n            false\n          ,\n            incorrect(\"You have some entries more often than they should be.\"); \n            false\n        )\n      )\n      ,\n      x,\n      sort(list(set(expected_numbers)))\n  )\n\nno_extras:\nif(all(map(x in expected_numbers, x, interpreted_answer)),\n    true\n  ,\n    incorrect(\"Your answer contains numbers which are incorrect.\");\n    false\n  )", "extendBaseMarkingAlgorithm": true, "unitTests": [], "showCorrectAnswer": true, "showFeedbackIcon": true, "variableReplacements": [], "variableReplacementStrategy": "originalfirst", "nextParts": [], "suggestGoingBack": false, "adaptiveMarkingPenalty": 0, "exploreObjective": null, "settings": {"correctAnswer": "[{a}, {b}]", "allowFractions": true, "correctAnswerFractions": true, "isSet": true, "show_input_hint": true, "separator": ","}}], "sortAnswers": false}, {"type": "gapfill", "useCustomName": true, "customName": "evectors", "marks": 0, "scripts": {}, "customMarkingAlgorithm": "student_eval:\n  interpreted_answers[0]\n\nstudent_evectors:\n  interpreted_answers[1]\n\ncheck_matrix:\n  matrixA-student_eval*id(n)\n\ngeometric_mult:\n  numrows(check_matrix)-rank(check_matrix)\n\nare_evectors:\n  if(numrows(student_evectors)=numcolumns(matrixA),\n  check_matrix*student_evectors=le_zero_matrix(numrows(matrixA),numcolumns(student_evectors)),\n  false)\n\ncorrect_dim:\n  rank(student_evectors)=geometric_mult\n\nlinear_indep:\n  numcolumns(student_evectors)=rank(student_evectors)\n\nfurther_feedback:\n  assert(numrows(student_evectors)=numcolumns(matrixA),feedback(\"You dont' have the right number of rows.\");end());\n  assert(are_evectors,feedback(\"Your entries are not all eigenvectors for your chosen eigenvalue.\"));\n  assert(numcolumns(student_evectors)=geometric_mult,feedback(\"You don't have the right number of eigenvectors.\"));\n  assert(numcolumns(student_evectors)=rank(student_evectors),feedback(\"The vectors you entered are not linearly independent.\"))\n\n\nmark:\n  assert(all_valid or not settings[\"sortAnswers\"], fail(translate(\"question.can not submit\")));\n  apply(answers);\n  correctif(correct_dim and are_evectors and linear_indep);\n  apply(further_feedback)", "extendBaseMarkingAlgorithm": true, "unitTests": [], "showCorrectAnswer": true, "showFeedbackIcon": true, "variableReplacements": [], "variableReplacementStrategy": "originalfirst", "nextParts": [{"label": "Find eigenvectors for a different eigenvalue", "rawLabel": "Find eigenvectors for a different eigenvalue", "otherPart": 2, "variableReplacements": [], "availabilityCondition": "answered", "penalty": "", "penaltyAmount": 0, "lockAfterLeaving": true}, {"label": "Finish", "rawLabel": "", "otherPart": 3, "variableReplacements": [], "availabilityCondition": "answered", "penalty": "", "penaltyAmount": 0, "lockAfterLeaving": true}], "suggestGoingBack": false, "adaptiveMarkingPenalty": 0, "exploreObjective": null, "prompt": "<p>Now choose one of the eigenvalues of \\(A\\): [[0]]</p>\n<p>and enter the corresponding eigenvector(s).</p>\n<p><em>Enter a basis for the relevant eigenspace of \\(A\\), i.e. a linearly independent set of eigenvectors for your chosen eigenvalue, as the columns of a matrix. E.g. if there is only one eigenvector, select \"1 column\" and enter the vector. If there are two, select \"2 columns\" and enter the first vector in the first column and the second vector in the second column, etc. This way you can determine how many eigenvectors there are.</em></p>\n<p><em>[[1]]</em></p>", "gaps": [{"type": "numberentry", "useCustomName": true, "customName": "Chosen eigenvalue", "marks": "0", "scripts": {}, "customMarkingAlgorithm": "", "extendBaseMarkingAlgorithm": true, "unitTests": [], "showCorrectAnswer": false, "showFeedbackIcon": false, "variableReplacements": [], "variableReplacementStrategy": "originalfirst", "nextParts": [], "suggestGoingBack": false, "adaptiveMarkingPenalty": 0, "exploreObjective": null, "minValue": "a", "maxValue": "a", "correctAnswerFraction": false, "allowFractions": true, "mustBeReduced": false, "mustBeReducedPC": "0", "showFractionHint": true, "notationStyles": ["plain", "en", "si-en"], "correctAnswerStyle": "plain"}, {"type": "matrix", "useCustomName": true, "customName": "Eigenvector(s)", "marks": 1, "scripts": {}, "customMarkingAlgorithm": "", "extendBaseMarkingAlgorithm": true, "unitTests": [], "showCorrectAnswer": false, "showFeedbackIcon": false, "variableReplacements": [], "variableReplacementStrategy": "originalfirst", "nextParts": [], "suggestGoingBack": false, "adaptiveMarkingPenalty": 0, "exploreObjective": null, "correctAnswer": "v1", "correctAnswerFractions": false, "numRows": 1, "numColumns": 1, "allowResize": true, "tolerance": 0, "markPerCell": false, "allowFractions": true, "minColumns": 1, "maxColumns": 0, "minRows": 1, "maxRows": 0}], "sortAnswers": false}, {"type": "information", "useCustomName": true, "customName": "Finish", "marks": 0, "scripts": {}, "customMarkingAlgorithm": "", "extendBaseMarkingAlgorithm": true, "unitTests": [], "showCorrectAnswer": true, "showFeedbackIcon": true, "variableReplacements": [], "variableReplacementStrategy": "originalfirst", "nextParts": [], "suggestGoingBack": false, "adaptiveMarkingPenalty": 0, "exploreObjective": null, "prompt": "<p>You have calculated everything, or decided you do not want to calculate anything else. Above you can see which parts you have worked on, and you can go back to them by clicking on the corresponding link.</p>"}], "partsMode": "explore", "maxMarks": 0, "objectives": [], "penalties": [], "objectiveVisibility": "always", "penaltyVisibility": "always", "contributors": [{"name": "Christian Lawson-Perfect", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/7/"}, {"name": "Julia Goedecke", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/5121/"}]}]}], "contributors": [{"name": "Christian Lawson-Perfect", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/7/"}, {"name": "Julia Goedecke", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/5121/"}]}